A fast quartet tree heuristic for hierarchical clustering

DOI10.1016/j.patcog.2010.08.033zbMath1209.68448arXiv1409.4276OpenAlexW2164411384MaRDI QIDQ622012

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

Publication date: 31 January 2011

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

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

zbMATH Keywords

global optimizationMonte Carlo methodhierarchical clusteringsimilarity 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)

Related Items (5)

Combining attribute content and label information for categorical data ensemble clustering ⋮ Similarity and denoising ⋮ 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

Uses Software

• fastDNAml
• BIONJ
• CompLearn
• SplitsTree
• CLUSTAG

Cites Work

• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• The complexity of reconstructing trees from qualitative characters and subtrees
• A discipline of evolutionary programming
• Phylogenetic supertrees. Combining information to reveal the tree of life
• Hierarchical clustering schemes
• 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
• Shared Information and Program Plagiarism Detection
• Clustering by Compression
• The Similarity Metric
• Tree structures for proximity data
• Information distance
• Equation of State Calculations by Fast Computing Machines
• Clustered SplitsNetworks
• An introduction to Kolmogorov complexity and its applications
• Calculating Sums of Infinite Series

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