2 2 Ja n 20 14 On Randomly Projected Hierarchical Clustering with Guarantees


1 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 single (SLC) and average (ALC) linkage clustering as well as for the minimum spanning tree problem (MST). We present a thorough adaptive analysis… (More)

11 Figures and Tables


  • Presentations referencing similar topics