An artificial bee colony rough clustering algorithm based on mutative precision search

DOI10.13195/J.KZYJC.2013.0101MaRDI QIDQ5499282zbMATH OpenFDO

Authors Ke Luo, Lian Li, Boxiang Zhou

Publication date 11 February 2015

Full work available at URL https://doi.org/10.13195/J.KZYJC.2013.0101

zbMATH Keywords

\(K\)-meansartificial bee colonyclusteringmutation operatorrough set

Mathematics Subject Classification ID

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

Recommendations

• A new clustering algorithm based on ant colony algorithm
• A hybrid clustering algorithm ABCKHM combining ABC and KHM
• An artificial bee colony clustering algorithm based on the location update technology
• scientific article; zbMATH DE number 6311430
• scientific article; zbMATH DE number 5283790

Cited in

(5)

• HC\_AB: a new heuristic clustering algorithm based on approximate backbone
• An artificial bee colony clustering algorithm based on the location update technology
• scientific article; zbMATH DE number 6612619 (Why is no real title available?)
• A hybrid clustering algorithm ABCKHM combining ABC and KHM
• K-means clustering algorithm based on flower pollination algorithm

This page was built for publication: An artificial bee colony rough clustering algorithm based on mutative precision search

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