DocumentCode
2371035
Title
Class decomposition via clustering: a new framework for low-variance classifiers
Author
Vilalta, Ricardo ; Achari, Murali-Krishna ; Eick, Christoph F.
Author_Institution
Dept. of Comput. Sci., Houston Univ., TX, USA
fYear
2003
fDate
19-22 Nov. 2003
Firstpage
673
Lastpage
676
Abstract
We propose a preprocessing step to classification that applies a clustering algorithm to the training set to discover local patterns in the attribute or input space. We demonstrate how this knowledge can be exploited to enhance the predictive accuracy of simple classifiers. Our focus is mainly on classifiers characterized by high bias but low variance (e.g., linear classifiers); these classifiers experience difficulty in delineating class boundaries over the input space when a class distributes in complex ways. Decomposing classes into clusters makes the new class distribution easier to approximate and provides a viable way to reduce bias while limiting the growth in variance. Experimental results on real-world domains show an advantage in predictive accuracy when clustering is used as a preprocessing step to classification.
Keywords
Bayes methods; data mining; learning (artificial intelligence); optimisation; pattern classification; statistical analysis; support vector machines; class decomposition; clustering algorithm; low-variance classifier; pattern discovery; predictive accuracy; training set; Accuracy; Classification algorithms; Clustering algorithms; Computer science; Kernel; Polynomials; Space exploration; Support vector machine classification; Support vector machines; Testing;
fLanguage
English
Publisher
ieee
Conference_Titel
Data Mining, 2003. ICDM 2003. Third IEEE International Conference on
Print_ISBN
0-7695-1978-4
Type
conf
DOI
10.1109/ICDM.2003.1251005
Filename
1251005
Link To Document