The complexity of ultrametric partitions on graphs
Information Processing Letters
Parallel algorithms for hierarchical clustering
Parallel Computing
Fast hierarchical clustering and other applications of dynamic closest pairs
Journal of Experimental Algorithmics (JEA)
Webmining: learning from the world wide web
Computational Statistics & Data Analysis - Nonlinear methods and data mining
Clustering in massive data sets
Handbook of massive data sets
Cluster aggregate inequality and multi-level hierarchical clustering
PKDD'05 Proceedings of the 9th European conference on Principles and Practice of Knowledge Discovery in Databases
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Clustering based on kolmogorov information
KES'10 Proceedings of the 14th international conference on Knowledge-based and intelligent information and engineering systems: Part I
Towards a practical O(n log n) phylogeny algorithm
WABI'11 Proceedings of the 11th international conference on Algorithms in bioinformatics
Fast and flexible unsupervised custering algorithm based on ultrametric properties
Proceedings of the 7th ACM symposium on QoS and security for wireless and mobile networks
Predetermined versus learned linkage models
Proceedings of the 14th annual conference on Genetic and evolutionary computation
Linkage neighbors, optimal mixing and forced improvements in genetic algorithms
Proceedings of the 14th annual conference on Genetic and evolutionary computation
Learning the neighborhood with the linkage tree genetic algorithm
LION'12 Proceedings of the 6th international conference on Learning and Intelligent Optimization
More concise and robust linkage learning by filtering and combining linkage hierarchies
Proceedings of the 15th annual conference on Genetic and evolutionary computation
On the usefulness of linkage processing for solving MAX-SAT
Proceedings of the 15th annual conference on Genetic and evolutionary computation
Proceedings of the 15th annual conference on Genetic and evolutionary computation
Hierarchical problem solving with the linkage tree genetic algorithm
Proceedings of the 15th annual conference on Genetic and evolutionary computation
Efficient software clustering technique using an adaptive and preventive dendrogram cutting approach
Information and Software Technology
Stock market co-movement assessment using a three-phase clustering method
Expert Systems with Applications: An International Journal
| Hi-index | 0.89 |
In this work we consider hierarchical clustering algorithms, such as UPGMA, which follow the closest-pair joining scheme. We survey optimal O(n2)-time implementations of such algorithms which use a 'locally closest' joining scheme, and specify conditions under which this relaxed joining scheme is equivalent to the original one (i.e. 'globally closest').