By Topic

GA-based pattern classification: theoretical and experimental studies

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Bandyopadhyay, S. ; Machine Intelligence Unit, Indian Stat. Inst., Calcutta, India ; Murthy, C.A. ; Pal, S.K.

Merits of genetic algorithms (GAs), an efficient evolutionary searching paradigm, are utilized for pattern classification in ℜN by fitting hyperplanes to model the decision boundaries in the feature space. Theoretical analysis establishes that as the size of the training set (n) goes towards infinity, the error probability and the decision boundary of the GA based classifier will approach those of Bayes (optimum) classifier

Published in:

Pattern Recognition, 1996., Proceedings of the 13th International Conference on  (Volume:4 )

Date of Conference:

25-29 Aug 1996