A parallel k-means algorithm based on constrained information

DOI10.3969/J.ISSN.1001-0505.2011.03.014MaRDI QIDQ2886050zbMATH OpenFDO

Authors Yuecheng Yu, Guan-Sheng Zheng, Jiandong Wang, Bin Chen

Publication date 1 June 2012

Published in Journal of Southeast University. Natural Science Edition (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3969/J.ISSN.1001-0505.2011.03.014

zbMATH Keywords

constrained clusteringconstrained parallel \(k\)-means algorithmparallel \(k\)-means algorithm

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Parallel algorithms in computer science (68W10)

Recommendations

• A parallel algorithm based on K-means clustering in cloud environment
• K-means-type algorithms on distributed memory computer
• Parallel Processing and Applied Mathematics
• Parallel Processing and Applied Mathematics
• scientific article; zbMATH DE number 2090606

Cited in

(4)

• CONQUEST: A coarse-grained algorithm for constructing summaries of distributed discrete datasets
• A parallel algorithm based on K-means clustering in cloud environment
• The Parallel Seeding Algorithm for k-Means Problem with Penalties
• scientific article; zbMATH DE number 2247697 (Why is no real title available?)

This page was built for publication: A parallel \(k\)-means algorithm based on constrained information

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