轮廓
聚类分析
计算机科学
模式识别(心理学)
星团(航天器)
人工智能
度量(数据仓库)
k均值聚类
数据挖掘
数学
程序设计语言
作者
Ketan Shahapure,Charles Nicholas
标识
DOI:10.1109/dsaa49011.2020.00096
摘要
Clustering is an important phase in data mining. Selecting the number of clusters in a clustering algorithm, e.g. choosing the best value of k in the various k-means algorithms [1], can be difficult. We studied the use of silhouette scores and scatter plots to suggest, and then validate, the number of clusters we specified in running the k-means clustering algorithm on two publicly available data sets. Scikit-learn's [4] silhouette score method, which is a measure of the quality of a cluster, was used to find the mean silhouette co-efficient of all the samples for different number of clusters. The highest silhouette score indicates the optimal number of clusters. We present several instances of utilizing the silhouette score to determine the best value of k for those data sets.
科研通智能强力驱动
Strongly Powered by AbleSci AI