World Scientific
  • Search
  •   
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×
Our website is made possible by displaying certain online content using javascript.
In order to view the full content, please disable your ad blocker or whitelist our website www.worldscientific.com.

System Upgrade on Tue, Oct 25th, 2022 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at [email protected] for any enquiries.

COARSE-TO-FINE CLASSIFIER ENSEMBLE SELECTION USING CLUSTERING AND GENETIC ALGORITHMS

    https://doi.org/10.1142/S021800140900751XCited by:2 (Source: Crossref)

    A good classifier ensemble should show high complementarity among classifiers to produce a high recognition rate and it should also have a small size to be efficient. This paper proposes a classifier ensemble selection algorithm operating in a coarse-to-fine paradigm. For the algorithm to be successful, the original classifier pool should be sufficiently diverse. So this paper produces a large classifier pool by combining several different classification algorithms and several feature subsets. The coarse selection stage reduces greatly the size of the classifier pool using a clustering algorithm. The fine selection finds the near-optimal ensemble using genetic algorithms. A hybrid genetic algorithm with improved searching capability is also proposed. The experimentation used handwritten numeral datasets and UCI datasets. The experimental results and the test of statistical significance showed that the proposed algorithm is superior to the conventional ones.

    References