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

DOI10.1016/J.IPL.2011.05.020MaRDI QIDQ1944152zbMATH OpenOpenAlexFDO

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

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)

Recommendations

• Backbone analysis and applications in heuristic algorithm design
• A \(K\)-means clustering algorithm based on a novel approach for improved initial seeds
• Heuristic clustering based on centroid learning and cognitive feature capturing
• An artificial bee colony rough clustering algorithm based on mutative precision search
• Adaptive initialization method based on spatial local information for \(k\)-means algorithm

Cites work

• scientific article; zbMATH DE number 2084703 (Why is no real title available?)
• scientific article; zbMATH DE number 3340881 (Why is no real title available?)
• scientific article; zbMATH DE number 2242691 (Why is no real title available?)
• Clustering algorithms research
• 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

Cited in

(1)

• Heuristic clustering based on centroid learning and cognitive feature capturing

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

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