Pattern Association: A Reference Book

Pattern Association: A Reference Book

EnglishPaperback / softbackPrint on demand
Kumar, Somesh
LAP Lambert Academic Publishing
EAN: 9783330021198
Print on demand
Delivery on Friday, 28. of August 2026
CZK 1,320
Common price CZK 1,467
Discount 10%
pc
Do you want this product today?
Megabooks Praha Korunní
not available
Librairie Francophone Praha Štěpánská
not available
Megabooks Ostrava
not available
Megabooks Olomouc
not available
Megabooks Plzeň
not available
Megabooks Brno
not available
Megabooks Hradec Králové
not available
Megabooks České Budějovice
not available
Megabooks Liberec
not available

Detailed information

In the present book, our objective is to develop a hybrid evolutionary system consisting of Hopfield neural network and genetic algorithm which will be responsible for evolution of weight matrices in order to store some input patterns and analyze the performance of such a system in the terms of correct recalling of these already stored patterns again with evolutionary algorithm by presenting the same or noisy versions of input patterns. In this process, first the patterns of training set have been encoded in the neural network using MC-adaptation rule. It is expected that all the patterns of training set has been successfully stored as the associative memory feature of Hopfield type neural network. As a result of this learning process, we obtain the expected optimized weight matrices. Now, we employ the genetic algorithm to evolve the population of these approximate optimal weight matrices obtained by MC-adaptation rule. The fitness of every evolved population of weight matrices is evaluated by using the two fitness evaluation functions.
EAN 9783330021198
ISBN 3330021195
Binding Paperback / softback
Publisher LAP Lambert Academic Publishing
Pages 108
Language English
Dimensions 220 x 150
Authors Kumar, Somesh
Manufacturer information
The manufacturer's contact information is currently not available online, we are working intensively on the axle. If you need information, write us on [email protected], we will be happy to provide it.