DocumentCode
3756952
Title
Class Decomposition Using K-Means and Hierarchical Clustering
Author
Shadi Banitaan;Ali Bou Nassif;Mohammad Azzeh
Author_Institution
Dept. of Math., Univ. of Detroit Mercy, Detroit, MI, USA
fYear
2015
Firstpage
1263
Lastpage
1267
Abstract
This paper presents a clustering-based class decomposition approach to improve the performance of classifiers. Class decomposition works by dividing each class into clusters, and by relabeling instances contained by each cluster with a new class. Several case studies used class decomposition combined with linear classifiers. While there is an essential improvement in classification accuracy because of class decomposition, the most effective clustering algorithm is not obvious. The aim of this work is to investigate the effect of two clustering algorithms, K-means and hierarchical, on class decomposition. In this work, we study class decomposition when combined with the Naive Bayes classifier using four real-world datasets. Experimental results show an improvement in classification accuracy for most of the datasets when class decomposition using both K-means and hierarchical clustering is performed. The results also show that class decomposition is not suitable for all datasets.
Keywords
"Clustering algorithms","Liver","Ionosphere","Couplings","Data mining","Convergence","Computers"
Publisher
ieee
Conference_Titel
Machine Learning and Applications (ICMLA), 2015 IEEE 14th International Conference on
Type
conf
DOI
10.1109/ICMLA.2015.169
Filename
7424495
Link To Document