This chapter provides a tutorial overview of hierarchical clustering. Several data visualization methods based on hierarchical clustering are demonstrated and the scaling of hierarchical clustering in time and memory is discussed. A new method for speeding up hierarchical clustering with cluster seeding is introduced, and this method is compared with a traditional agglomerative hierarchical, average link clustering algorithm using several internal and external cluster validation indices. A benchmark study compares the cluster performance of both approaches using a wide variety of real-world and artificial benchmark data sets. © 2013 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Embrechts, M. J., Gatti, C. J., Linton, J., & Roysam, B. (2013). Hierarchical clustering for large data sets. Studies in Computational Intelligence. Springer Verlag. https://doi.org/10.1007/978-3-642-28696-4_8
Mendeley helps you to discover research relevant for your work.