Efficient hierarchical clustering algorithms using partially overlapping partitions

DOI10.1007/3-540-45357-1_52MaRDI QIDQ2768599zbMATH OpenFDO

Authors Manoranjan Dash, Huan Liu

Publication date 3 February 2002

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2035/20350495

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Database theory (68P15) Learning and adaptive systems in artificial intelligence (68T05) Computing methodologies and applications (68U99)

Recommendations

• Geometric algorithms for agglomerative hierarchical clustering
• Euro-Par 2004 Parallel Processing
• Efficient algorithms for agglomerative hierarchical clustering methods
• Fast hierarchical clustering and its validation
• scientific article; zbMATH DE number 3994794

Cited in

(4)

• A tractable multi-partitions clustering
• scientific article; zbMATH DE number 6699826 (Why is no real title available?)
• scientific article; zbMATH DE number 3930160 (Why is no real title available?)
• An efficient successive iteration partial cluster algorithm for large datasets

This page was built for publication: Efficient hierarchical clustering algorithms using partially overlapping partitions

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