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

DOI10.1016/S0167-9473(96)00019-9zbMath0900.62319OpenAlexW2001302965MaRDI QIDQ1350795

Shingo Oue, Audris Mockus, 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)

Related Items (2)

The snake for visualizing and for counting clusters in multivariate data ⋮ Model‐based clustering of regression time series data via APECM—an AECM algorithm sung to an even faster beat

Cites Work

• A sweepline algorithm for Voronoi diagrams
• A randomized linear-time algorithm for finding minimum spanning trees
• Unnamed Item
• Unnamed Item

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