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}
}
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
87 Citations
Hierarchical clustering of large text datasets using Locality-Sensitive Hashing
  • 3
  • PDF
Efficient hierarchical clustering of large high dimensional datasets
  • 12
  • PDF
Distance Based Fast Hierarchical Clustering Method for Large Datasets
  • 15
  • PDF
Hashing-based clustering in high dimensional data
  • 12
SAHN Clustering in Arbitrary Metric Spaces Using Heuristic Nearest Neighbor Search
  • 7
  • PDF
Practical SAHN Clustering for Very Large Data Sets and Expensive Distance Metrics
  • 10
  • PDF
SPARCL: an effective and efficient algorithm for mining arbitrary shape-based clusters
  • 27
  • PDF
A distance based clustering method for arbitrary shaped clusters in large datasets
  • 35
  • PDF
Approximative distance computation by random hashing
  • 2
  • PDF
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 16 REFERENCES
An agglomerative hierarchical clustering using partial maximum array and incremental similarity computation method
  • Sungyoung Jung, T. Kim
  • Computer Science
  • Proceedings 2001 IEEE International Conference on Data Mining
  • 2001
  • 18
Chameleon: Hierarchical Clustering Using Dynamic Modeling
  • 1,937
  • PDF
SLINK: An Optimally Efficient Algorithm for the Single-Link Cluster Method
  • 1,076
  • PDF
An Efficient Approach to Clustering in Large Multimedia Databases with Noise
  • 1,327
  • PDF
A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise
  • 15,473
  • Highly Influential
  • PDF
Similarity Search in High Dimensions via Hashing
  • 3,254
  • PDF
WaveCluster: A Multi-Resolution Clustering Approach for Very Large Spatial Databases
  • 848
  • PDF
OPTICS: ordering points to identify the clustering structure
  • 3,317
  • Highly Influential
  • PDF
STING: A Statistical Information Grid Approach to Spatial Data Mining
  • 1,321
  • Highly Influential
  • PDF
...
1
2
...