Large scale K-means clustering using GPUs
From MaRDI portal
Publication:6486121
DOI10.1007/S10618-022-00869-6zbMATH Open1514.62117WikidataQ114859235 ScholiaQ114859235MaRDI QIDQ6486121FDOQ6486121
Authors: Mi Li, Eibe Frank, Bernhard Pfahringer
Publication date: 9 January 2023
Published in: Data Mining and Knowledge Discovery (Search for Journal in Brave)
Recommendations
- scientific article; zbMATH DE number 1926668
- Fast kernel \(k\)-means clustering using incomplete Cholesky factorization
- An efficient \(K\)-means clustering algorithm for tall data
- A fast \(k\)-means clustering algorithm using cluster center displacement
- An efficient enhanced \(k\)-means clustering algorithm
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Numerical algorithms for specific classes of architectures (65Y10)
Cited In (1)
This page was built for publication: Large scale K-means clustering using GPUs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6486121)