Improved metaheuristics for the quartet method of hierarchical clustering

DOI10.1007/S10898-019-00871-1MaRDI QIDQ2022207zbMATH OpenOpenAlexWikidataFDO

Authors S. Consoli, Steffen Pauws, Gijs Geleijnse, J. Korst

Publication date 28 April 2021

Published in Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10898-019-00871-1

zbMATH Keywords

combinatorial optimizationdata mininggraphshierarchical clusteringmetaheuristicsminimum quartet tree costNP-hardnessquartet trees

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• A fast quartet tree heuristic for hierarchical clustering
• An exact algorithm for the minimum quartet tree cost problem
• NP-hard problems in hierarchical-tree clustering
• Minimum tree cost quartet puzzling
• Computing sharp bounds for hard clustering problems on trees

Cites work

• A Comparison of Alternative Tests of Significance for the Problem of m Rankings
• A Fast Algorithm For The Greedy Interchange For Large-Scale Clustering And Median Location Problems
• A fast quartet tree heuristic for hierarchical clustering
• A polynomial time approximation scheme for inferring evolutionary trees from quartet topologies and its application
• An exact algorithm for the minimum quartet tree cost problem
• Clustering by Compression
• Continuous Variable Neighborhood Search (C-VNS) for Solving Systems of Nonlinear Equations
• Future paths for integer programming and links to artificial intelligence
• scientific article; zbMATH DE number 1010621 (Why is no real title available?)
• scientific article; zbMATH DE number 1512197 (Why is no real title available?)
• scientific article; zbMATH DE number 1518742 (Why is no real title available?)
• scientific article; zbMATH DE number 1405796 (Why is no real title available?)
• Integer linear programming as a tool for constructing trees from quartet data
• Optimization by simulated annealing
• Search Methodologies
• Solving spread spectrum radar polyphase code design problem by tabu search and variable neighbourhood search.
• Statistical comparisons of classifiers over multiple data sets
• The complexity of reconstructing trees from qualitative characters and subtrees
• The generation of random, binary unordered trees
• Variable neighborhood decomposition search

Cited in

(4)

• Preface to the special issue ``ICVNS 2018
• An exact algorithm for the minimum quartet tree cost problem
• scientific article; zbMATH DE number 2044684 (Why is no real title available?)
• A fast quartet tree heuristic for hierarchical clustering

Describes a project that uses

Uses Software

• CompLearn

This page was built for publication: Improved metaheuristics for the quartet method of hierarchical clustering

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