2015 | OriginalPaper | Buchkapitel
Performance Evaluation of the Silhouette Index
verfasst von : Artur Starczewski, Adam Krzyżak
Erschienen in: Artificial Intelligence and Soft Computing
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
This article provides the performance evaluation of the
Silhouette
index, which is based on the so called
silhouette width
. However, the index can be calculated in two ways, and so, the first approach uses the mean of the mean
silhouettes
through all the clusters. On the other hand, the second one is realized by averaging the
silhouettes
over the whole data set. These various approaches of the index have significant influence on indicating the proper number of clusters in a data set. To study the performance of the index, as the underlying clustering algorithms, two popular hierarchical methods were applied, that is, the
complete-linkage
and the
single-linkage
algorithm. These methods have been used for artificial and real-life data sets, and the results confirm very good performances of the index and they also allow to choose the best approach.