Decomposition/Aggregation K-means for Big Data

DOI10.1007/978-3-030-58657-7_32zbMath1460.90153OpenAlexW3084674434MaRDI QIDQ4965129

Nenad Mladenović, Alexander Krassovitskiy, 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

datasetaggregationdecompositionclusteringparallelbig data\(k\)-meansMSSC

Mathematics Subject Classification ID

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

Uses Software

• k-means++

Cites Work

• Unnamed Item
• Sequential clustering with radius and split criteria
• Variable neighborhood search for harmonic means clustering
• Modified global \(k\)-means algorithm for minimum sum-of-squares clustering problems
• An efficient \(K\)-means clustering algorithm for tall data

This page was built for publication: Decomposition/Aggregation K-means for Big Data