A Fast Quartet Tree Heuristic for Hierarchical Clustering
Rudi L. Cilibrasi (CWI, Amsterdam), Paul M.B. Vitanyi (CWI and, University of Amsterdam)

TL;DR
This paper introduces a fast Monte Carlo heuristic for approximating optimal hierarchical clustering trees based on quartet topologies, significantly improving computational efficiency over previous methods.
Contribution
The authors present a highly efficient heuristic for the Minimum Quartet Tree Cost problem, reducing runtime by a factor of 1000 to 10,000 and enabling practical application to large, complex datasets.
Findings
The improved heuristic drastically reduces running time.
The method achieves near-optimal trees with high accuracy.
Performance compares favorably with UPGMA, BioNJ, and NJ algorithms.
Abstract
The Minimum Quartet Tree Cost problem is to construct an optimal weight tree from the weighted quartet topologies on objects, where optimality means that the summed weight of the embedded quartet topologies is optimal (so it can be the case that the optimal tree embeds all quartets as nonoptimal topologies). We present a Monte Carlo heuristic, based on randomized hill climbing, for approximating the optimal weight tree, given the quartet topology weights. The method repeatedly transforms a dendrogram, with all objects involved as leaves, achieving a monotonic approximation to the exact single globally optimal tree. The problem and the solution heuristic has been extensively used for general hierarchical clustering of nontree-like (non-phylogeny) data in various domains and across domains with heterogeneous data. We also present a greatly improved heuristic, reducing…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgorithms and Data Compression · Genome Rearrangement Algorithms · Gene expression and cancer classification
