A fast quartet tree heuristic for hierarchical clustering

DOI10.1016/J.PATCOG.2010.08.033zbMATH Open1209.68448arXiv1409.4276OpenAlexW2164411384MaRDI QIDQ622012FDOQ622012

Rudi L. Cilibrasi, Paul M. B. Vitányi

Publication date: 31 January 2011

Published in: Pattern Recognition (Search for Journal in Brave)

Abstract: The Minimum Quartet Tree Cost problem is to construct an optimal weight tree from the $3nchoose4$ weighted quartet topologies on $n$ 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 the running time by a factor of order a thousand to ten thousand. All this is implemented and available, as part of the CompLearn package. We compare performance and running time of the original and improved versions with those of UPGMA, BioNJ, and NJ, as implemented in the SplitsTree package on genomic data for which the latter are optimized. Keywords: Data and knowledge visualization, Pattern matching--Clustering--Algorithms/Similarity measures, Hierarchical clustering, Global optimization, Quartet tree, Randomized hill-climbing,

Full work available at URL: https://arxiv.org/abs/1409.4276

zbMATH Keywords

global optimizationhierarchical clusteringMonte Carlo methodsimilarity measuresdata and knowledge visualizationpattern matching clustering algorithmsquartet treerandomized hill-climbing

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cites Work

• Title not available (Why is that?)
• Optimization by Simulated Annealing
• Pattern classification.
• Tree structures for proximity data
• Equation of State Calculations by Fast Computing Machines
• Hierarchical clustering schemes
• The complexity of reconstructing trees from qualitative characters and subtrees
• Clustering by Compression
• The Similarity Metric
• Information distance
• An introduction to Kolmogorov complexity and its applications
• Phylogenetic supertrees. Combining information to reveal the tree of life
• Shared Information and Program Plagiarism Detection
• A discipline of evolutionary programming
• Integer linear programming as a tool for constructing trees from quartet data
• A polynomial time approximation scheme for inferring evolutionary trees from quartet topologies and its application
• Clustered SplitsNetworks
• Calculating Sums of Infinite Series

Cited In (5)

• Improved metaheuristics for the quartet method of hierarchical clustering
• An exact algorithm for the minimum quartet tree cost problem
• Hesitant fuzzy agglomerative hierarchical clustering algorithms
• Similarity and denoising
• Combining attribute content and label information for categorical data ensemble clustering

Uses Software

• fastDNAml
• BIONJ
• CompLearn
• SplitsTree
• CLUSTAG

This page was built for publication: A fast quartet tree heuristic for hierarchical clustering

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q622012)