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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
F Murtagh: Multidimensional Clustering Algorithms. Physica-Verlag, Vienna., 1985.
P. Michaud: Clustering techniques. Future Generation Computer Systems, (13), 1997.
J. A. Hartigan: Clustering Algorithms. 1975.
K. Sambasiva Rao: K-means Clustering for Categorical Attributes. M. Tech. Thesis, Dec 1998, Indian Institute of Technology, New Delhi, India.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gupta, S.K., Rao, K.S., Bhatnagar, V. (1999). K-means Clustering Algorithm for Categorical Attributes. In: Mohania, M., Tjoa, A.M. (eds) DataWarehousing and Knowledge Discovery. DaWaK 1999. Lecture Notes in Computer Science, vol 1676. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48298-9_22
Download citation
DOI: https://doi.org/10.1007/3-540-48298-9_22
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66458-1
Online ISBN: 978-3-540-48298-7
eBook Packages: Springer Book Archive