ETRI-Knowledge Sharing Plaform

ENGLISH

성과물

논문 검색
구분 SCI
연도 ~ 키워드

상세정보

학술지 Coarse-to-Fine Classifier Ensemble Selection using Clustering and Genetic Algorithms
Cited 2 time in scopus Download 0 time Share share facebook twitter linkedin kakaostory
저자
김영원, 오일석
발행일
200909
출처
International Journal of Pattern Recognition and Artificial Intelligence, v.23 no.6, pp.1083-1106
ISSN
0218-0014
출판사
World Scientific
DOI
https://dx.doi.org/10.1142/S021800140900751X
협약과제
08MD1200, 실시간 우편물류 운영기술 개발, 박종흥
초록
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. © 2009 World Scientific Publishing Company.
KSP 제안 키워드
Classification algorithm, Clustering algorithm, Ensemble selection, Optimal ensemble, Recognition rate, Scientific publishing, Statistical Significance, UCI datasets, classifier ensemble, coarse-to-fine, hybrid genetic algorithm