Abstract
This chapter covers Java classes used for data clustering. It describes the k-means algorithm with a single and a multi-pass data processing, the c-means (fuzzy) algorithm and an agglomerative hierarchical clustering algorithm.
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
References
Spath, H.: Cluster Analysis Algorithms. Wiley, New York (1980)
Kaufman, L., Rousseeuw, P.: Finding Groups in Data: An Introduction to Cluster Analysis. Wiley, New York (2005)
Jain, A., Dubes, R.: Algorithms for Clustering Data. Prentice Hall, New York (1988)
Chekanov, S.: The jminhep package. URL http://hepforge.cedar.ac.uk/jminhep/
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2010 Springer-Verlag London Limited
About this chapter
Cite this chapter
Chekanov, S.V. (2010). Data Clustering. In: Scientific Data Analysis using Jython Scripting and Java. Advanced Information and Knowledge Processing. Springer, London. https://doi.org/10.1007/978-1-84996-287-2_14
Download citation
DOI: https://doi.org/10.1007/978-1-84996-287-2_14
Publisher Name: Springer, London
Print ISBN: 978-1-84996-286-5
Online ISBN: 978-1-84996-287-2
eBook Packages: Computer ScienceComputer Science (R0)