Abstract
Clustering can be considered the most important unsupervised learning problem; as with every other problem of this kind, it deals with finding structure in a collection of unlabeled data. A cluster is therefore a collection of objects which are “similar” to one another and are “dissimilar” to the objects belonging to other clusters.
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.
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Barbakh, W.A., Wu, Y., Fyfe, C. (2009). Review of Clustering Algorithms. In: Non-Standard Parameter Adaptation for Exploratory Data Analysis. Studies in Computational Intelligence, vol 249. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04005-4_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-04005-4_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04004-7
Online ISBN: 978-3-642-04005-4
eBook Packages: EngineeringEngineering (R0)