2008
DOI: 10.3844/jcssp.2008.252.255
|View full text |Cite
|
Sign up to set email alerts
|

An Efficient Approach for Computing Silhouette Coefficients

Abstract: Abstract:One popular approach for finding the best number of clusters (K) in a data set is through computing the silhouette coefficients. The silhouette coefficients for different values of K, are first found and then the maximum value of these coefficients is chosen. However, computing the silhouette coefficient for different Ks is a very time consuming process. This is due to the amount of CPU time spent on distance calculations. A proposed approach to compute the silhouette coefficient quickly had been pres… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
22
0
4

Year Published

2013
2013
2018
2018

Publication Types

Select...
9

Relationship

0
9

Authors

Journals

citations
Cited by 51 publications
(26 citation statements)
references
References 10 publications
0
22
0
4
Order By: Relevance
“…We used k-means clustering to best group the 60 images into 2, 3, 4, 5, and 6 clusters. The fit of these different solutions was quantified using both silhouette coefficients (Al-Zoubi & Rawi, 2008) and the Dunn index (Dunn, 1974). Both measures attempt to identify dense and wellseparated clusters, reflected in higher values.…”
Section: Clustering Of Familiar and Unfamiliar Identitiesmentioning
confidence: 99%
“…We used k-means clustering to best group the 60 images into 2, 3, 4, 5, and 6 clusters. The fit of these different solutions was quantified using both silhouette coefficients (Al-Zoubi & Rawi, 2008) and the Dunn index (Dunn, 1974). Both measures attempt to identify dense and wellseparated clusters, reflected in higher values.…”
Section: Clustering Of Familiar and Unfamiliar Identitiesmentioning
confidence: 99%
“…Similarly k x and k y can be determined as cor [5] cor [10] cor [15] cor [20] cor [16] cor [21] cor [11] cor [6] cor [1] cor [2] cor [7] cor [17] cor [22] cor [12] cor [3] cor [18] cor [23] cor [8] cor [13] cor [4] cor [19] cor [24] cor [9] cor [14] x…”
Section: ) Building Corner Objectsunclassified
“…For instance, if L = 2, the number of corners is 25 and these are (cor[0], cor [1], ... , cor [24]). …”
Section: ) Building Corner Objectsmentioning
confidence: 99%
“…where a(i) is the average distance between points i and all points in cluster A and b (i) is the average distance between the point i and the points in the cluster closest to cluster A, namely cluster B [9]. Interpreting results of silhouette coefficient can be shown on the chart interpretations of the interval coefficient [10], which is in table 1.…”
Section: B Research Methodsmentioning
confidence: 99%