2020
DOI: 10.4108/eai.9-10-2017.163211
|View full text |Cite
|
Sign up to set email alerts
|

Analysis and improvement of evaluation indexes for clustering results

Abstract: Clustering algorithm is the main field in collaborative computing of social network. How to evaluate clustering results accurately has become a hot spot in clustering algorithm research. Commonly used evaluation indexes are SC, DBI and CHI. There are two shortcomings in the calculation of three indexes. (1) Keep the number of clusters and the objects in the cluster unchanged. When transforming the feature vector, the three indexes will change greatly; (2) Keep the feature vector and the number of clusters unch… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
3
1
1

Relationship

0
5

Authors

Journals

citations
Cited by 7 publications
(4 citation statements)
references
References 31 publications
0
4
0
Order By: Relevance
“…The multicolor fabric has complex colors and patterns, and it is extremely inefficient to identify the color number of the fabric manually, so the internal evaluation index silhouette coefficient (SC) is used to determine the number of cluster centers automatically in this paper. 26…”
Section: Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…The multicolor fabric has complex colors and patterns, and it is extremely inefficient to identify the color number of the fabric manually, so the internal evaluation index silhouette coefficient (SC) is used to determine the number of cluster centers automatically in this paper. 26…”
Section: Methodsmentioning
confidence: 99%
“…The multicolor fabric has complex colors and patterns, and it is extremely inefficient to identify the color number of the fabric manually, so the internal evaluation index silhouette coefficient (SC) is used to determine the number of cluster centers automatically in this paper. 26 In the EDSC algorithm, first the coefficient matrix is calculated based on the input data and the affinity matrix is constructed; Then, the input data were divided into three parts according to the affinity matrix: noise data, noise-free data and outliers. It converts the subspace clustering into an optimization problem of each data point, which is divided into the following cases generally.…”
Section: The Edsc Algorithmmentioning
confidence: 99%
“…These metrics provide a quantitative basis for comparison and help illustrate why DEC outperformed traditional methods. These metrics are: Inertia, Silhouette Score, Davies-Bouldin Index, Calinski-Harabasz Index [12]. The DEC algorithm stands out with its superior performance, as evidenced by the highest Silhouette Score and Calinski-Harabasz Index, alongside the lowest Davies-Bouldin Index.…”
Section: Communities Clustering and Identificationmentioning
confidence: 99%
“…To inform this determination, k-means clustering was performed for a range of numbers of clusters and a silhouette coefficient was calculated for each number of clusters. The silhouette coefficient is a measure of cluster validity that measures the distance between samples within the same cluster and distances between samples in separate clusters, with higher values indicating more effective clustering (Zhong, Zhang, & Jia, 2020). Charts were created to see the silhouette coefficients for each number of clusters for the primary and secondary clusters, with the number of clusters being selected from observable peaks in the charts.…”
Section: Clusteringmentioning
confidence: 99%