Abstract
Clustering is a fundamental tool for analyzing the structure of feature spaces. It has been applied to various fields such as pattern recognition, information retrieval and so on. Many studies have been done on this problem and various kinds of clustering methods have been proposed and compared (e.g., [1]). Some clustering algorithms partition the points in the feature space into the given number of clusters, and others generate hierarchical structure of clusters. Either type of clustering algorithms is not able to compare the partitions consisting of different number of clusters and users must specify the optimal number of clusters. However, when applying a clustering method, we don’t often know how many clusters exist in the given data. This paper discusses the framework for comparing partitions that consist of different number of clusters
Similar content being viewed by others
References
Punj, G. and Stewart, D.W.:Cluster Analysis in Marketing Research: Review and Suggestions for Applications, Journal of Marketing Research,Vol.XX, 134–1481983.
Akaike, H.:A New Look at the Statistical Model Identification, IEEE Trans. on Automat. Contr., Vol.AC19, 716–7231974.
Preparata, F.P. and Shamos, M. I.: Computational Geometry-An Introduction, Springer-Verlag1985.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Takasu, A. (1998). On the Number of Clusters in Cluster Analysis. In: Arikawa, S., Motoda, H. (eds) Discovey Science. DS 1998. Lecture Notes in Computer Science(), vol 1532. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49292-5_50
Download citation
DOI: https://doi.org/10.1007/3-540-49292-5_50
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65390-5
Online ISBN: 978-3-540-49292-4
eBook Packages: Springer Book Archive