Abstract
A very difficult problem in cluster analysis is to determine the number of clusters present in a data set. Most clustering algorithms can partition a data set into any specified number of clusters even if the data set has no cluster structure. Unfortunately, it is very hard to decide if a K-cluster structure makes sense for the given data set.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Davies D.L. and Bouldin D., “A cluster separation measure,” IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. PAMI-1, no.2, 224–227, 1979.
Diaconis P. and Efron D., “Computer intensive methods in statistics,” Scientific American, Vol. 248, 116–130, 1983.
Dubes R. and Jain A.K., “Validity studies in clustering methodologies,” Pattern Recognition, Vol. 11, 235–254, 1979.
Efron B., “Bootstrap method: another look at the jacknife,” The Annals of Statistics, Vol. 7, no.l, 1–26, 1979.
Fisher R.A., “The use of multiple measurements in taxonomic problems,” Machine Recognition of Patterns, A.K. Agrawala, Ed., New York: IEEE Press (1976).
[]Hartigan J.A., “A K-means clustering algorithm,” Applied Statistics, Vol. 28, 100–108, 1979.
Milligan G.W and Cooper M.C., “An examination of procedures for determining the number of clusters in a data-set,” The Psychometric Society, Vol. 50, no.2, 159–179, 1985.
Peck R., Fisher L., Van Ness J., “Bootstrap confidence interval for the number of clusters in cluster analysis”, (unpublished paper).
Ripley B.D.,Spatial Statistics, New-York: Wiley, 1981.
Hoffman R.L. and Jain A.K., “Segmentation and classification of range images,” Technical Report MSU-ENGR-86–002, Department of Computer Science, Michigan State University, 1986.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Moreau, J.V., Jain, A.K. (1987). The Bootstrap Approach to Clustering. In: Devijver, P.A., Kittler, J. (eds) Pattern Recognition Theory and Applications. NATO ASI Series, vol 30. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-83069-3_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-83069-3_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-83071-6
Online ISBN: 978-3-642-83069-3
eBook Packages: Springer Book Archive