An efficient algorithm for a complete link method
From MaRDI portal
Cited in
(46)- Input-output networks offer new insights of economic structure
- A tandem clustering process for multimodal datasets
- Improved analysis of complete-linkage clustering
- Improved analysis of complete-linkage clustering
- An efficient and effective generic agglomerative hierarchical clustering approach
- Optimization on Lie manifolds and pattern recognition
- Fuzzy clustering of probability density functions
- Nonlinear time series clustering based on Kolmogorov-Smirnov 2D statistic
- Similar coefficient for cluster of probability density functions
- Relaxed triangle inequality for the orbital similarity criterion by Southworth and Hawkins and its variants
- Hierarchical clustering with optimal transport
- A review on declarative approaches for constrained clustering
- Visual attractiveness in vehicle routing via bi-objective optimization
- Topological graph clustering with thin position
- On model-based clustering of directional data with heavy tails
- Clustering probability distributions
- Metaheuristics for data mining
- Reverse engineering of CAD models via clustering and approximate implicitization
- Efficient algorithms for agglomerative hierarchical clustering methods
- A sampling-based exact algorithm for the solution of the minimax diameter clustering problem
- Similar coefficient of cluster for discrete elements
- Clustering algorithm based on feature space partitioning
- Modal clustering using semiparametric mixtures and mode flattening
- MulticlusterKDE: a new algorithm for clustering based on multivariate kernel density estimation
- Weighting dissimilarities to detect communities in networks
- A fast epigraph and hypograph-based approach for clustering functional data
- From genome-scale data to models of infectious disease: a Bayesian network-based strategy to drive model development
- Optimal algorithms for complete linkage clustering in d dimensions
- An efficient technique for superfamily classification of amino acid sequences: feature extraction, fuzzy clustering and prototype selection
- Iterative category discovery via multiple kernel metric learning
- Analysing microarray expression data through effective clustering
- Belief functions clustering for epipole localization
- The upper envelope of piecewise linear functions: Algorithms and applications
- Using projection-based clustering to find distance- and density-based clusters in high-dimensional data
- GrDBSCAN: a granular density-based clustering algorithm
- Randomly projected convex clustering model: motivation, realization, and cluster recovery guarantees
- Experiments on mapping techniques for exploratory pattern analysis
- Handling revision inconsistencies: towards better explanations
- Maximizing the ratio of cluster split to cluster diameter without and with cardinality constraints
- Kernel treelets
- Efficient algorithms for divisive hierarchical clustering with the diameter criterion
- A complete linkage algorithm for clustering dynamic datasets
- A self-adjusting spectral clustering algorithm
- TreeKDE: clustering multivariate data based on decision tree and using one-dimensional kernel density estimation
- Efficient, certifiably optimal clustering with applications to latent variable graphical models
- Clustering and maximum likelihood search for efficient statistical classification with medium-sized databases
This page was built for publication: An efficient algorithm for a complete link method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4139673)
