An efficient algorithm for a complete link method
From MaRDI portal
Publication:4139673
DOI10.1093/comjnl/20.4.364zbMath0364.68038OpenAlexW2107946060WikidataQ55934585 ScholiaQ55934585MaRDI QIDQ4139673
Publication date: 1977
Published in: The Computer Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/comjnl/20.4.364
Related Items (41)
Clustering algorithm based on feature space partitioning ⋮ Handling Revision Inconsistencies: Towards Better Explanations ⋮ Improved Analysis of Complete-Linkage Clustering ⋮ Input-output networks offer new insights of economic structure ⋮ Similar coefficient for cluster of probability density functions ⋮ Improved analysis of complete-linkage clustering ⋮ Visual attractiveness in vehicle routing via bi-objective optimization ⋮ Reverse engineering of CAD models via clustering and approximate implicitization ⋮ GrDBSCAN: a granular density-based clustering algorithm ⋮ Weighting dissimilarities to detect communities in networks ⋮ Efficient, certifiably optimal clustering with applications to latent variable graphical models ⋮ From genome-scale data to models of infectious disease: a Bayesian network-based strategy to drive model development ⋮ On model-based clustering of directional data with heavy tails ⋮ A fast epigraph and hypograph-based approach for clustering functional data ⋮ Iterative category discovery via multiple kernel metric learning ⋮ Analysing microarray expression data through effective clustering ⋮ Clustering probability distributions ⋮ The upper envelope of piecewise linear functions: Algorithms and applications ⋮ Experiments on mapping techniques for exploratory pattern analysis ⋮ Fuzzy clustering of probability density functions ⋮ Efficient algorithms for divisive hierarchical clustering with the diameter criterion ⋮ Using projection-based clustering to find distance- and density-based clusters in high-dimensional data ⋮ Belief functions clustering for epipole localization ⋮ Topological graph clustering with thin position ⋮ Clustering and maximum likelihood search for efficient statistical classification with medium-sized databases ⋮ Metaheuristics for data mining ⋮ Relaxed triangle inequality for the orbital similarity criterion by Southworth and Hawkins and its variants ⋮ Hierarchical clustering with optimal transport ⋮ An efficient technique for superfamily classification of amino acid sequences: feature extraction, fuzzy clustering and prototype selection ⋮ Unnamed Item ⋮ A sampling-based exact algorithm for the solution of the minimax diameter clustering problem ⋮ Similar coefficient of cluster for discrete elements ⋮ Modal clustering using semiparametric mixtures and mode flattening ⋮ Nonlinear time series clustering based on Kolmogorov-Smirnov 2D statistic ⋮ Maximizing the ratio of cluster split to cluster diameter without and with cardinality constraints ⋮ Kernel Treelets ⋮ A tandem clustering process for multimodal datasets ⋮ Optimization on Lie manifolds and pattern recognition ⋮ Efficient algorithms for agglomerative hierarchical clustering methods ⋮ MulticlusterKDE: a new algorithm for clustering based on multivariate kernel density estimation ⋮ Optimal algorithms for complete linkage clustering in \(d\) dimensions
This page was built for publication: An efficient algorithm for a complete link method
