A novel approach for finding alternative clusterings using feature selection

1Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Alternative clustering algorithms target finding alternative groupings of a dataset, on which traditional clustering algorithms can find only one even though many alternatives could exist. In this research, we propose a method for finding alternative clusterings of a dataset based on feature selection. Using the finding that each clustering has a set of so-called important features, we find the possible important features for the altenative clustering in subsets of data; we transform the data by weighting these features so that the original clustering will not likely to be found in the new data space. We then use the incremental K-means algorithm to directly maximizes the quality of the new clustering found in the new data space. We compare our approach with some previous works on a collection of machine learning datasets and another collection of documents. Our approach was the most stable one as it resulted in different and high quality clusterings in all of the tests. The results showed that by using feature selection, we can improve the dissimilarity between clusterings, and by directly maximizing the clustering quality, we can also achieve better clustering quality than the other approaches. © 2012 Springer-Verlag.

Cite

CITATION STYLE

APA

Tao, V. T., & Lee, J. H. (2012). A novel approach for finding alternative clusterings using feature selection. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7238 LNCS, pp. 482–493). https://doi.org/10.1007/978-3-642-29038-1_35

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free