返回
A Tabu search based clustering algorithm and its parallel implementation on Spark
DOI:10.1016/j.asoc.2017.11.038.png)
摘要
En 中文
The well-known K-means clustering algorithm has been employed widely in different application domains ranging from data analytics to logistics applications. However, the K-means algorithm can be affected by factors such as the initial choice of centroids and can readily become trapped in a local optimum. In this paper, we propose an improved K-means clustering algorithm that is augmented by a Tabu Search strategy, and which is better adapted to meet the needs of big data applications. Our design focuses on enhancements to take advantage of parallel processing based on the Spark framework. Computational experiments demonstrate the superiority of our parallel Tabu Search based clustering algorithm over a widely used version of the K-means approach embodied in the parallel Spark MLlib system, comparing the algorithms in terms of scalability, accuracy, and effectiveness. (C) 2017 Elsevier B.V. All rights reserved.
Keyword:
Clustering
K-means
Tabu search
Parallel computing
Spark
Big data
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.6
论文数:
1.4W
被引数:
4.8W
机构
引用论文
Near real-time space-time cluster analysis for detection of enteric disease outbreaks in a community setting
JOURNAL OF INFECTION
IF11.9
A comparative study of efficient initialization methods for the k-means clustering algorithmK-means聚类算法高效初始化方法的比较研究
Adsorption of Cu(II), Pb(II), and Cd(II) Ions from Acidic Aqueous Solutions by Diethylenetriaminepentaacetic Acid-Modified Magnetic Graphene Oxide二乙烯三胺五乙酸改性的磁性氧化石墨烯对酸性水溶液中Cu(II),Pb(II) 和Cd(II) 离子的吸附


