On Randomly Projected Hierarchical Clustering with Guarantees

back to overview


Schneider, J., & Vlachos,M. (2014). On Randomly Projected Hierarchical Clustering with Guarantees. Paper presented at the 2014 SIAM International Conference on Data Mining (SDM).

Publication type

Paper in Conference Proceedings


Hierarchical clustering (HC) algorithms are generally limited to small data instances due to their runtime costs. Here we mitigate this shortcoming and explore fast HC algorithms based on random projections for sin- gle (SLC) and average (ALC) linkage clustering as well as for the minimum spanning tree problem (MST). We present a thorough adaptive analysis of our algorithms that improve prior work from O(N^2 ) by up to a factor of N/(log N )^2 for a dataset of N points in Euclidean space. The algorithms maintain, with arbitrary high probabil- ity, the outcome of hierarchical clustering as well as the worst-case running-time guarantees. We also present parameter-free instances of our algorithms.


Organizational Units

  • Institute of Information Systems
  • Hilti Chair of Business Process Management

Original Source URL


Open Repository URL