Improved metaheuristics for the quartet method of hierarchical clustering
type: Item
instance of: scholarly article
title: Improved metaheuristics for the quartet method of hierarchical clustering
zbMATH Open document ID: 1465.90085
author: S. Consoli
author: Steffen Pauws
author: Gijs Geleijnse
author: J. Korst
published in: Journal of Global Optimization
publication date: 2021-04-28T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 7340728
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: NP-hardness
zbMATH Keywords: quartet trees
zbMATH Keywords: hierarchical clustering
zbMATH Keywords: data mining
zbMATH Keywords: metaheuristics
zbMATH Keywords: graphs
zbMATH Keywords: minimum quartet tree cost
describes a project that uses: CompLearn
MaRDI profile type: Publication
full work available at URL: s10898-019-00871-1
OpenAlex ID: W2999532546
cites work: Search Methodologies
cites work: Q4938781
cites work: Clustering by Compression
cites work: A fast quartet tree heuristic for hierarchical clustering
cites work: An exact algorithm for the minimum quartet tree cost problem
cites work: Q4505842
cites work: Q3093335
cites work: Q4507228
cites work: A Comparison of Alternative Tests of Significance for the Problem of $m$ Rankings
cites work: The generation of random, binary unordered trees
cites work: Future paths for integer programming and links to artificial intelligence
cites work: Variable neighborhood decomposition search
cites work: A polynomial time approximation scheme for inferring evolutionary trees from quartet topologies and its application
cites work: Optimization by Simulated Annealing
cites work: Q4337021
cites work: Solving spread spectrum radar polyphase code design problem by tabu search and variable neighbourhood search.
cites work: Continuous Variable Neighborhood Search (C-VNS) for Solving Systems of Nonlinear Equations
cites work: The complexity of reconstructing trees from qualitative characters and subtrees
cites work: Integer linear programming as a tool for constructing trees from quartet data
cites work: A Fast Algorithm For The Greedy Interchange For Large-Scale Clustering And Median Location Problems
Wikidata QID: Q126379427
DOI: 10.1007/S10898-019-00871-1
description: scientific article; zbMATH DE number 7340728