Approximate single linkage cluster analysis of large data sets in high-dimensional spaces

DOI10.1016/S0167-9473(96)00019-9MaRDI QIDQ1350795zbMATH OpenOpenAlexFDO

Authors Audris Mockus, Shingo Oue, William F. Eddy

Publication date 27 February 1997

Published in Computational Statistics and Data Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0167-9473(96)00019-9

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Clustering in the social and behavioral sciences (91C20)

Recommendations

• Sparse cluster analysis of large-scale discrete variables with application to single nucleotide polymorphism data
• Improved analysis of complete-linkage clustering
• Improved analysis of complete-linkage clustering
• Fast algorithms for complete linkage clustering
• Statistical properties of the single linkage hierarchical clustering estimator
• Optimal algorithms for complete linkage clustering in \(d\) dimensions
• scientific article; zbMATH DE number 714540
• A characterization of linkage-based hierarchical clustering

Cites work

• scientific article; zbMATH DE number 3841211 (Why is no real title available?)
• scientific article; zbMATH DE number 43279 (Why is no real title available?)
• A randomized linear-time algorithm for finding minimum spanning trees (extended abstract)
• A sweepline algorithm for Voronoi diagrams

Cited in

(6)

• Single linkage clustering and continuum percolation
• Model‐based clustering of regression time series data via APECM—an AECM algorithm sung to an even faster beat
• Topographical multilevel single linkage
• Fast algorithms for complete linkage clustering
• The snake for visualizing and for counting clusters in multivariate data
• Robust scalable visualized clustering in vector and non vector semi-metric spaces

This page was built for publication: Approximate single linkage cluster analysis of large data sets in high-dimensional spaces

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