Hierarchical clustering for large data sets

22Citations
Citations of this article
32Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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.

Cite

CITATION STYLE

APA

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

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free