Pruning Ensembles of One-Class Classifiers with X-means Clustering
In this paper, we present a novel approach for pruning ensembles of one-class classifiers. One-class classification is among the most challenging topics in the contemporary machine learning. Creating multiple classifier systems for this task is one of the most effective ways of improving the quality and robustness in case of lack of counterexamples. However, very often we are faced with the problem of redundant or weak classifiers in the pool, as one-class ensembles tend to overproduce the base learners. To tackle this problem a dedicated pruning scheme must be employed, which will allow to discard classifiers that do not contribute to the formed ensemble. We propose to approach this problem as a clustering task. We discover groups of classifiers according to their support function values for the target class. For each group, we select the most representative classifier and discard the remaining ones. We apply an efficient x-means clustering algorithm, that automatically establishes the optimal number of clusters with the use of the Bayesian Information Criterion. Experimental results carried out on a set of benchmarks prove, that our proposed method is able to provide an efficient pruning mechanism for one-class problems.
KeywordsMachine learning One-class classification Classifier ensemble Ensemble pruning Clustering X-means
Unable to display preview. Download preview PDF.
- 10.Pelleg, D., Moore, A.W.: X-means: extending k-means with efficient estimation of the number of clusters. In: Proceedings of the Seventeenth International Conference on Machine Learning (ICML 2000), June 29 - July 2, 2000, pp. 727–734. Stanford University, Stanford (2000)Google Scholar
- 12.Tax, D.M.J., Muller, K.: A consistency-based model selection for one-class classification. In: Proceedings - International Conference on Pattern Recognition, vol. 3, pp. 363–366 (2004). Cited By (since 1996):12Google Scholar