A polynomial training algorithm for calculating perceptrons of optimal stability

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A polynomial training algorithm for calculating perceptrons of optimal stability

Recomi (Repeated correlation matrix inversion) is a polynomially fast algorithm for searching optimally stable solutions of the perceptron learning problem. For random unbiased and biased patterns it is shown that the algorithm is able to find optimal solutions, if any exist, in at worst O(N) floating point operations. Even beyond the critical storage capacity αc the algorithm is able to find l...

متن کامل

A Novel Algorithm for Training Polynomial Networks

Modern recognition systems require high-accuracy low-complexity methods. We explore a polynomial network approach to recognition problems. Traditionally, polynomial networks have been difficult to use for recognition because of either low accuracy or problems associated with large training sets. We detail a new training method that solves these problems. For identification, the method partition...

متن کامل

A Polynomial Algorithm for Optimal Microaggregation

− Microaggregation is a technique that is used by statistical agencies to limit disclosure of sensitive microdata. Noting that no polynomial time algorithms are known to microaggregate optimally, Domingo-Ferrer and Mateo-Sanz have presented heuristic methods based on hierarchical clustering and genetic algorithms to identify sub-optimal solutions. We present an efficient polynomial time algorit...

متن کامل

A Polynomial Algorithm for Optimal Univariate Microaggregation

Microaggregation is a technique used by statistical agencies to limit disclosure of sensitive microdata. Noting that no polynomial algorithms are known to microaggregate optimally, Domingo-Ferrer and Mateo-Sanz have presented heuristic microaggregation methods. This paper is the first to present an efficient polynomial algorithm for optimal univariate microaggregation. Optimal partitions are sh...

متن کامل

Training Algorithm for Extra Reduced Size Lattice–Ladder Multilayer Perceptrons

A quick gradient training algorithm for a specific neural network structure called an extra reduced size lattice–ladder multilayer perceptron is introduced. Presented derivation of the algorithm utilizes recently found by author simplest way of exact computation of gradients for rotation parameters of lattice–ladder filter. Developed neural network training algorithm is optimal in terms of mini...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Physics A: Mathematical and General

سال: 1995

ISSN: 0305-4470,1361-6447

DOI: 10.1088/0305-4470/28/8/011