k-means-g*: accelerating \(k\)-means clustering algorithm utilizing primitive geometric concepts

DOI10.1016/j.ins.2022.11.001OpenAlexW4308469945MaRDI QIDQ6150442

No author found.

Publication date: 6 March 2024

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2022.11.001

zbMATH Keywords

\(k\)-meansmassive datalarge-scale datafast variantspeeded-up variant

Mathematics Subject Classification ID

Statistics (62-XX) Computer science (68-XX)

Cites Work

• Unnamed Item
• Improved analysis of \(D^2\)-sampling based PTAS for \(k\)-means and other clustering problems
• Clustering large graphs via the singular value decomposition
• Randomized Dimensionality Reduction for <inline-formula> <tex-math notation="LaTeX">$k$ </tex-math></inline-formula>-Means Clustering
• Performance of Johnson-Lindenstrauss transform for k -means and k -medians clustering

This page was built for publication: k-means-g*: accelerating \(k\)-means clustering algorithm utilizing primitive geometric concepts