K-means clustering algorithm based on flower pollination algorithm

DOI10.13338/J.ISSN.1006-8341.2016.04.025MaRDI QIDQ5276444zbMATH OpenFDO

Authors Jiao Zhang, Hong Xue, Xiaodong Wang

Publication date 14 July 2017

Full work available at URL https://doi.org/10.13338/J.ISSN.1006-8341.2016.04.025

zbMATH Keywords

\(K\)-means clusteringflower pollination algorithmoriginal clustering center

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• An improved k-means algorithm based on outliers and original clustering center
• Improved \(k\)-means clustering algorithm
• scientific article; zbMATH DE number 7071628
• A K-means optimal clustering algorithm based on complex
• An artificial bee colony rough clustering algorithm based on mutative precision search

Cited in

(1)

• A chaotic moth flame optimization algorithm based on dimension learning and quadratic interpolation

This page was built for publication: \(K\)-means clustering algorithm based on flower pollination algorithm

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