Efficient algorithms for agglomerative hierarchical clustering methods
Whenever n objects are characterized by a matrix of pairwise dissimilarities, they may be clustered by any of a number of sequential, agglomerative, hierarchical, nonoverlapping clustering methods. These SAHN clustering methods are defined by a paradigmatic algorithm that usually requires \(O(n^ 3)\) time, in the worst case, to cluster the objects. We describe a SAHN clustering algorithm that requires \(O(n^ 2 \log n)\) time in the worst case. When SAHN clustering methods exhibit reasonable space distortion properties, further improvements are possible. We adapt a SAHN clustering algorithm, based on the efficient construction of nearest neighbor chains, to obtain a reasonably general SAHN clustering algorithm that requires in the worst case \(O(n^ 2)\) time and space. Whenever n objects are characterized by k-tuples of real numbers, they may be clustered by any of a family of a centroid SAHN clustering methods. These methods are based on a geometric model in which clusters are represented by points in k-dimensional real space and points being agglomerated are replaced by a single (centroid) point. For this model, we have solved a class of special packing problems involving point- symmetric convex objects and have exploited it to design an efficient centroid clustering algorithm.
- A mathematical comparison of the members of an infinite family of agglomerative clustering algorithms
- A probabilistic minimum spanning tree algorithm
- A Survey of Recent Advances in Hierarchical Clustering Algorithms
- Abschätzungen für die Anzahl der konvexen Körper, die einen konvexen Körper berühren
- An O ( n log n ) Algorithm for Rectilinear Minimal Spanning Trees
- An efficient algorithm for a complete link method
- Ausgewählte Einzelprobleme der kombinatorischen Geometrie in der Ebene
- HIERARCHICAL CLUSTERING AND THE CONCEPT OF SPACE DISTORTION
- Hierarchical clustering schemes
- scientific article; zbMATH DE number 3710924 (Why is no real title available?)
- scientific article; zbMATH DE number 3774721 (Why is no real title available?)
- scientific article; zbMATH DE number 3469876 (Why is no real title available?)
- scientific article; zbMATH DE number 3504320 (Why is no real title available?)
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 3571501 (Why is no real title available?)
- scientific article; zbMATH DE number 3579840 (Why is no real title available?)
- scientific article; zbMATH DE number 3797024 (Why is no real title available?)
- scientific article; zbMATH DE number 3800811 (Why is no real title available?)
- scientific article; zbMATH DE number 3806759 (Why is no real title available?)
- scientific article; zbMATH DE number 3448387 (Why is no real title available?)
- scientific article; zbMATH DE number 3221920 (Why is no real title available?)
- Ultrametric hierarchical clustering algorithms
- Über Treffanzahlen bei translationsgleichen Eikörpern
- Computing the nearest neighbor interchange metric for unlabeled binary trees is NP-complete
- Clustering methods for geometric objects and applications to design problems
- Efficient algorithms for divisive hierarchical clustering with the diameter criterion
- Space-contracting, space-dilating, and positive admissible clustering algorithms
- Euclidean spanner graphs with degree four
- Cluster analysis and mathematical programming
- Optimal algorithms for complete linkage clustering in d dimensions
- Low-degree minimum spanning trees
- Algorithms for subsetting attribute values with relief
- Composite likelihood estimation method for hierarchical Archimedean copulas defined with multivariate compound distributions
- Hierarchical clustering schemes
- Mining interpretable spatio-temporal logic properties for spatially distributed systems
- Continuous discovery of causal nets for non-stationary business processes using the Online Miner
- Reverse engineering of CAD models via clustering and approximate implicitization
- 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
- Belief functions clustering for epipole localization
- Hierarchical constraints
- A framework to uncover multiple alternative clusterings
- CORES: fusion of supervised and unsupervised training methods for a multi-class classification problem
- A comparative study of divisive and agglomerative hierarchical clustering algorithms
- Optimal implementations of UPGMA and other common clustering algorithms
- Landmark diffusion maps (L-dMaps): accelerated manifold learning out-of-sample extension
- Implementation of hierarchical clustering methods
- A tandem clustering process for multimodal datasets
- An exemplar-based clustering using efficient variational message passing
- Summarization and visualization of multi-level and multi-dimensional itemsets
- Point clustering via voting maximization
- scientific article; zbMATH DE number 1700015 (Why is no real title available?)
- Modeling, simulating, and parameter Fitting of biochemical kinetic experiments
- Theoretical foundations and experimental results for a hierarchical classifier with overlapping clusters
- Practical SAHN clustering for very large data sets and expensive distance metrics
- Efficient Computation of the Weighted Clustering Coefficient
- Computing hierarchies of clusters from the Euclidean minimum spanning tree in linear time
- Geometric algorithms for agglomerative hierarchical clustering
- An Agglomerative Hierarchical Clustering by Finding Adjacent Hyper-Rectangles
- An Efficient Clustering Algorithm
- scientific article; zbMATH DE number 2013297 (Why is no real title available?)
- An efficient and effective generic agglomerative hierarchical clustering approach
- Hierarchical clustering
- A faster estimation method for the probability of informed trading using hierarchical agglomerative clustering
- scientific article; zbMATH DE number 3994794 (Why is no real title available?)
- scientific article; zbMATH DE number 764292 (Why is no real title available?)
- Introduction to the peptide binding problem of computational immunology: new results
- The fast clustering algorithm for the big data based on K-means
- Consensus-Based Agglomerative Hierarchical Clustering
- A practical algorithm for spatial agglomerative clustering
- A New Agglomerative 2–3 Hierarchical Clustering Algorithm
- Discovery Science
- Maximum sum-of-splits clustering
- Efficient computation of the Weighted Clustering Coefficient
- Algorithm of Hierarchical Matrix Clusterization and Its Applications
- Time series clustering using the total variation distance with applications in oceanography
- Fast block-wise partitioning for extreme multi-label classification
- NISQ-friendly measurement-based quantum clustering algorithms
- A complete linkage algorithm for clustering dynamic datasets
- Dirichlet compound negative multinomial mixture models and applications
- Faster and more robust point symmetry-based K-means algorithm
- Experiments on mapping techniques for exploratory pattern analysis
This page was built for publication: Efficient algorithms for agglomerative hierarchical clustering methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1057599)
