Efficient algorithms for agglomerative hierarchical clustering methods

DOI10.1007/BF01890115zbMath0563.62034OpenAlexW2035890032WikidataQ56235366 ScholiaQ56235366MaRDI QIDQ1057599

William H. E. Day, Herbert Edelsbrunner

Publication date: 1984

Published in: Journal of Classification (Search for Journal in Brave)

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

zbMATH Keywords

geometric modelpacking problemsalgorithm designcentroid SAHN clustering methodsnearest neighbor chainsSAHN clustering methodssequential, agglomerative, hierarchical, nonoverlapping clustering methods

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to statistics (62-04) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Analysis of algorithms and problem complexity (68Q25)

Related Items

Computing the nearest neighbor interchange metric for unlabeled binary trees is NP-complete, Point clustering via voting maximization, Euclidean spanner graphs with degree four, Optimal implementations of UPGMA and other common clustering algorithms, Low-degree minimum spanning trees, Mining interpretable spatio-temporal logic properties for spatially distributed systems, Clustering methods for geometric objects and applications to design problems, Faster and more robust point symmetry-based K-means algorithm, Cluster analysis and mathematical programming, Continuous discovery of causal nets for non-stationary business processes using the Online Miner, An exemplar-based clustering using efficient variational message passing, Summarization and visualization of multi-level and multi-dimensional itemsets, Reverse engineering of CAD models via clustering and approximate implicitization, Landmark diffusion maps (L-dMaps): accelerated manifold learning out-of-sample extension, Time series clustering using the total variation distance with applications in oceanography, Algorithms for subsetting attribute values with relief, Experiments on mapping techniques for exploratory pattern analysis, Versatile linkage: a family of space-conserving strategies for agglomerative hierarchical clustering, Local-entity resolution for building location-based social networks by using stay points, Efficient algorithms for divisive hierarchical clustering with the diameter criterion, Introduction to the peptide binding problem of computational immunology: new results, The fast clustering algorithm for the big data based on K-means, Belief functions clustering for epipole localization, Hierarchical constraints, Composite likelihood estimation method for hierarchical Archimedean copulas defined with multivariate compound distributions, A framework to uncover multiple alternative clusterings, Unnamed Item, CORES: fusion of supervised and unsupervised training methods for a multi-class classification problem, Modeling, Simulating, and Parameter Fitting of Biochemical Kinetic Experiments, A faster estimation method for the probability of informed trading using hierarchical agglomerative clustering, A tandem clustering process for multimodal datasets, THEORETICAL FOUNDATIONS AND EXPERIMENTAL RESULTS FOR A HIERARCHICAL CLASSIFIER WITH OVERLAPPING CLUSTERS, Optimal algorithms for complete linkage clustering in \(d\) dimensions

Uses Software

• AS 15

Cites Work

• Ausgewählte Einzelprobleme der kombinatorischen Geometrie in der Ebene
• Über Treffanzahlen bei translationsgleichen Eikörpern
• Abschätzungen für die Anzahl der konvexen Körper, die einen konvexen Körper berühren
• Ultrametric hierarchical clustering algorithms
• A probabilistic minimum spanning tree algorithm
• Hierarchical clustering schemes
• A Survey of Recent Advances in Hierarchical Clustering Algorithms
• A mathematical comparison of the members of an infinite family of agglomerative clustering algorithms
• HIERARCHICAL CLUSTERING AND THE CONCEPT OF SPACE DISTORTION
• An efficient algorithm for a complete link method
• An O ( n log n ) Algorithm for Rectilinear Minimal Spanning Trees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item