Decomposition/aggregation k-means for big data

DOI10.1007/978-3-030-58657-7_32MaRDI QIDQ4965129zbMATHOpenAlexFDO

Authors Alexander Krassovitskiy, Nenad Mladenović, Rustam Mussabayev

Publication date 25 February 2021

Published in Mathematical Optimization Theory and Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-58657-7_32

zbMATH Keywords

clusteringdatasetaggregationdecompositionbig data\(k\)-meansparallelMSSC

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Recommendations

• An efficient \(K\)-means clustering algorithm for tall data
• Improvement of the fast clustering algorithm improved by \(K\)-means in the big data
• Parallel Processing and Applied Mathematics
• The fast clustering algorithm for the big data based on K-means
• A parallel algorithm based on K-means clustering in cloud environment

Cites work

• scientific article; zbMATH DE number 6381735 (Why is no real title available?)
• An efficient \(K\)-means clustering algorithm for tall data
• Modified global \(k\)-means algorithm for minimum sum-of-squares clustering problems
• Sequential clustering with radius and split criteria
• Variable neighborhood search for harmonic means clustering

Cited in

(1)

• The fast clustering algorithm for the big data based on K-means

Describes a project that uses

Uses Software

• k-means++

This page was built for publication: Decomposition/aggregation \(k\)-means for big data

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