• DOI:10.1007/s10115-006-0027-5
Corpus ID: 4613827

Fast agglomerative hierarchical clustering algorithm using Locality-Sensitive Hashing

@article{Koga2006FastAH,
  title={Fast agglomerative hierarchical clustering algorithm using Locality-Sensitive Hashing},
  author={H. Koga and T. Ishibashi and T. Watanabe},
  journal={Knowledge and Information Systems},
  year={2006},
  volume={12},
  pages={25-53}
}

• H. Koga, T. Ishibashi, T. Watanabe
• Published 2006
• Mathematics, Computer Science
• Knowledge and Information Systems

The single linkage method is a fundamental agglomerative hierarchical clustering algorithm. [...] Key Method In the agglomeration step, it connects a pair of clusters such that the distance between the nearest members is the shortest. This step is repeated until only one cluster remains. The single linkage method can efficiently detect clusters in arbitrary shapes. However, a drawback of this method is a large time complexity of O(n2), where n represents the number of data points. This time complexity makes…Expand

View on Springer

page-one.springer.com

Save to Library

Create Alert

Cite

Launch Research Feed