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

DOI10.1016/J.IPL.2011.05.020zbMATH Open1260.68360OpenAlexW2078277510MaRDI QIDQ1944152FDOQ1944152

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

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

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

• Clustering by passing messages between data points
• Title not available (Why is that?)
• Clustering large graphs via the singular value decomposition
• Landscapes, operators and heuristic search
• On constructing an optimal consensus clustering from multiple clusterings
• Title not available (Why is that?)
• Title not available (Why is that?)
• Clustering algorithms research

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)