.png){kind=icon}
返回
Staleness-Reduction Mini-Batch K-Means
.png){kind=icon}
PRE
AI
DOI：10.1109/TNNLS.2023.3279122.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
K-means (km) is a clustering algorithm that has been widely adopted due to its simple implementation and high clustering quality. However, the standard km suffers from high computational complexity and is therefore time-consuming. Accordingly, the mini-batch (mbatch) km is proposed to significantly reduce computational costs in a manner that updates centroids after performing distance computations on just a mbatch, rather than a full batch, of samples. Even though the mbatch km converges faster, it leads to a decrease in convergence quality because it introduces staleness during iterations. To this end, in this article, we propose the staleness-reduction mbatch (srmbatch) km, which achieves the best of two worlds: low computational costs like the mbatch km and high clustering quality like the standard km. Moreover, srmbatch still exposes massive parallelism to be efficiently implemented on multicore CPUs and many-core GPUs. The experimental results show that srmbatch can converge up to 40x-130x faster than mbatch when reaching the same target loss, and srmbatch is able to reach 0.2%-1.7% lower final loss than that of mbatch.
Keyword:
Clustering
K-means (km)
machine learning
staleness-reduction
期刊
IF:
8.9
论文数:
7.6K
被引数:
7.2W
机构
引用论文
Development of top-level requirements for regional aircraft based on the needs of the Russian market
OAAI
OAAI分享收藏<title>Using KDD to analyze the impact of curriculum revisions in a Brazilian university</title>
PREAI
分享收藏Cerebral morphology and dopamine D2/D3 receptor distribution in humans: A combined [18F]fallypride and voxel-based morphometry study.png)
NeuroImageOAAI
NeuroImageIF0
OAAI分享收藏分享收藏
查看更多内容