This paper describes a method for production of an ensemble of general classifiers using unsupervised learning. The method uses the 'divide and conquer' strategy. Using competitive learning the feature space is divided into subregions where the classifiers are constructed. The structure of the ensemble starts from a single member and new members are being added during the training. The growth of the ensemble is self determined until the ensemble reaches the desired accuracy. The overall response of the ensemble to an input pattern is represented by the output of a winning member for the particular pattern. The method is generic, i.e. it is not bound to a specific type of classifier and it is suitable for parallel implementation. It is possible to use the method for data mining. A basic wide margin linear classifier is used in the experiments here. Experimental results achieved on artificial and real world data are presented and compared to the results of Gaussian SVM. Parallel implementation of the method is described. © 2008 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Bundzel, M., & Sinčák, P. (2008). Ensembling classifiers using unsupervised learning. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5097 LNAI, pp. 513–521). https://doi.org/10.1007/978-3-540-69731-2_50
Mendeley helps you to discover research relevant for your work.