How to Use K-means for Big Data Clustering?

•We suggest a new parallel big data clustering scheme based on K-means and K-means++ algorithms;•By decomposing the dataset, the proposed global search scheme efficiently finds quality clustering solutions processing significantly less data;•Requirements for “true big data” clustering algorithms are...

Full description

Saved in:

Bibliographic Details
Published in:	Pattern recognition Vol. 137; p. 109269
Main Authors:	Mussabayev, Rustam, Mladenovic, Nenad, Jarboui, Bassem, Mussabayev, Ravil
Format:	Journal Article
Language:	English
Published:	Elsevier Ltd 01.05.2023
Subjects:	Big data Clustering Decomposition Divide and conquer algorithm Global optimization K-means Minimum sum-of-squares Unsupervised learning Minimum sum-of-squares K-means Global optimization Big data Decomposition Clustering Divide and conquer algorithm Unsupervised learning
ISSN:	0031-3203, 1873-5142
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!