HC\_AB: a new heuristic clustering algorithm based on approximate backbone

DOI10.1016/j.ipl.2011.05.020zbMath1260.68360OpenAlexW2078277510MaRDI QIDQ1944152

Guandong Xu, Ping Jin, Enhong Chen, Yanchun Zhang, Yu Zong

Publication date: 4 April 2013

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2011.05.020

zbMATH Keywords

data miningapproximation algorithmsNP-hard problemapproximate backboneheuristic clustering

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Clustering by Passing Messages Between Data Points
• Clustering large graphs via the singular value decomposition
• Landscapes, operators and heuristic search
• On constructing an optimal consensus clustering from multiple clusterings
• Clustering Algorithms Research

This page was built for publication: HC\_AB: a new heuristic clustering algorithm based on approximate backbone