Fast hierarchical clustering algorithm using locality-sensitive hashing

DOI10.1007/978-3-540-30214-8_9MaRDI QIDQ5464567zbMATH OpenOpenAlexFDO

Authors Hisashi Koga, Tetsuo Ishibashi, Toshinori Watanabe

Publication date 18 August 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b100845

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Fast Clustering Algorithms
• scientific article; zbMATH DE number 1303605
• Fast hierarchical clustering and other applications of dynamic closest pairs
• Efficient algorithms for agglomerative hierarchical clustering methods
• Fast hierarchical clustering and its validation

Cited in

(4)

• Fast hierarchical clustering and its validation
• scientific article; zbMATH DE number 907945 (Why is no real title available?)
• A classification for community discovery methods in complex networks
• $$\mathtt {IP.LSH.DBSCAN}$$: Integrated Parallel Density-Based Clustering Through Locality-Sensitive Hashing

This page was built for publication: Fast hierarchical clustering algorithm using locality-sensitive hashing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5464567)