K-means clustering algorithm for categorical attributes

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

Abstract

Efficient partitioning of large data sets into homogeneous clusters is a fundamental problem in data mining. The hierarchical clustering methods are not adaptable because of their high computational complexity. The K-means based algorithms give promising results for their efficiency. However their use is often limited to numeric data. The quality of clusters produced depends on the initialization of clusters and the order in which data elements are processed in the iteration. We present a method which is based on the K-means philosophy but removes the numeric data limitation.

Cite

CITATION STYLE

APA

Gupta, S. K., Sambasiva Rao, K., & Bhatnagar, V. (1999). K-means clustering algorithm for categorical attributes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1676, pp. 203–208). Springer Verlag. https://doi.org/10.1007/3-540-48298-9_22

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