By Topic

Design of a compact cluster structure by using genetic algorithms

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)
Hong Lan Jin ; Dept. of Electron. Eng., Hokkaido Univ., Sapporo, Japan ; Miyanaga, Y. ; Tochinai, K.

Cluster nodes produced in the experiments of our handwritten Japanese character recognition involve the enormous increasement of computation quantity. It is necessary to delete unnecessary cluster nodes to get the compact cluster structure. A compress algorithm using genetic algorithms (GA) is employed in this report to reduce redundant cluster nodes. The results of the handwritten Japanese character recognition using GA are also shown

Published in:

Circuits and Systems, 1995. ISCAS '95., 1995 IEEE International Symposium on  (Volume:2 )

Date of Conference:

30 Apr-3 May 1995