.png){kind=icon}
.png){kind=icon}
Return
A high-performance clustering algorithm based on searched experiences
.png){kind=icon}
PRE
AI
DOI：10.1016/j.chb.2018.08.038.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Clustering is a traditional data mining problem that has attracted researchers from different disciplines because its solution can be applied to many useful problems in our daily life. Since the era of big data is coming, how to reduce the computing time of an effective clustering algorithm has been a promising research issue in recent years. Thus, this paper presents an effective clustering algorithm, by using the so-called searched information to determine later search directions, and then has it implemented on Spark to accelerate its response time for analyzing large-scale datasets. Simulation results show that the proposed algorithm provides a better result than the other clustering algorithms compared in this paper because it is less sensitive to the initial solutions. The simulation results further show that cloud computing platform is capable of enhancing the performance of the proposed algorithm.
Keywords:
Clustering
Big data
Cloud computing
Spark
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
8.9
Papers:
9.0K
Citations:
5.8W
Organization
View more organizations