.png){kind=icon}
返回
Parallel random swap: An efficient and reliable clustering algorithm in java
.png){kind=icon}
PRE
AI
DOI：10.1016/j.simpat.2022.102712.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Solving large-scale clustering problems requires an efficient algorithm that can also be implemented in parallel. K-means would be suitable, but it can lead to an inaccurate clustering result. To overcome this problem, we present a parallel version of the random swap clustering algorithm. It combines the scalability of k-means with the high clustering accuracy of random swap. The algorithm is implemented in Java in two ways. The first implementation uses Java parallel streams and lambda expressions. The solution exploits a built-in multi-threaded organization capable of offering competitive speedup. The second implementation is achieved on top of the Theatre actor system which ensures better scalability and high-performance computing through fine-grain resource control. The two implementations are then applied to standard benchmark datasets, with a varying population size and distribution of managed records, dimensionality of data points and the number of clusters. The experimental results confirm that high-quality clustering can be obtained together with a very good execution efficiency. Our Java code is publicly available at: https://github.com/uef-machine-learning.
Keyword:
Clustering problem
K -means
Random swap
Parallelism
Java
Streams
Lambda expressions
Actors
Multi -core machines
期刊
IF:
4.6
论文数:
2.6K
被引数:
4.8K
机构
引用论文
分享收藏A Novel Sampling Model to Study the Epidemiology of Canine Leishmaniasis in an Urban Environment
OAAI
OAAI分享收藏How much can k-means be improved by using better initialization and repeats?通过使用更好的初始化和重复，k均值可以提高多少？.png)
PATTERN RECOGNITION
OAAI
PATTERN RECOGNITIONIF7.6
OAAI分享收藏分享收藏
查看更多内容