Decomposition/aggregation k-means for big data

DOI10.1007/978-3-030-58657-7_32zbMATH Open1460.90153OpenAlexW3084674434MaRDI QIDQ4965129FDOQ4965129

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

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

zbMATH Keywords

clusteringdatasetaggregationdecompositionbig data\(k\)-meansparallelMSSC

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Variable neighborhood search for harmonic means clustering
• Modified global \(k\)-means algorithm for minimum sum-of-squares clustering problems
• Sequential clustering with radius and split criteria
• An efficient \(K\)-means clustering algorithm for tall data

Cited In (1)

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

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)