.png){kind=icon}
返回
FC-Kmeans: Fixed-centered K-means algorithm
.png){kind=icon}
PRE
AI
DOI：10.1016/j.eswa.2022.118656.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Clustering is one of the data mining methods that partition large-sized data into subgroups according to their similarities. K-means clustering algorithm works well in spherical or convex data distribution of large-sized data sets. Most of the algorithms based on K-means have generally been interested in an initial cluster centers se-lection or cluster distribution. However, these algorithms may not meet satisfy some requirements in practice. This paper presents the FC-Kmeans algorithm, which enables clustering by fixing some cluster centers consid-ering real conditions. Thus, while some of the cluster centers are fixed, it is tried to obtain the most appropriate cluster centers for the others and the best distribution of the data to the clusters. The K-means clustering al-gorithm is compared with two different fixed-centered clustering algorithms which are FC-Kmeans and FC-Kmeans 2. The experimental results show that although the FC-Kmeans algorithm has more limitations than K-means, it converges the performance of K-means algorithm according to some performance indicators such as SSE, DB Index and Silhouette Index.
Keyword:
K -means
Clustering
Fixed cluster center
Big data
Data mining
期刊
IF:
7.5
论文数:
3.0W
被引数:
10.2W
机构
引用论文
Dynamic Evolution of Safety Regulation of the Ridesharing Industry under Social Media Participation.png)
Symmetry
OAAI
SymmetryIF0
OAAI分享收藏A cooperative coevolutionary algorithm for the Multi-Depot Vehicle Routing Problem多车场车辆路径问题的协同进化算法
OAAI
OAAI分享收藏A comparative study of efficient initialization methods for the k-means clustering algorithmK-means聚类算法高效初始化方法的比较研究
PREAI
分享收藏
查看更多内容