Clustering with the average silhouette width

DOI10.1016/j.csda.2021.107190OpenAlexW3128058200MaRDI QIDQ830092

Christian Hennig, Fatima Batool

Publication date: 7 May 2021

Published in: Computational Statistics and Data Analysis (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1910.11339

zbMATH Keywords

distance-based clusteringnumber of clusterspartitioning around medoidsaxiomatic clustering

Mathematics Subject Classification ID

Statistics (62-XX)

Related Items (2)

Fuzzy clustering of time series with time-varying memory ⋮ A novel optimization approach towards improving separability of clusters

Uses Software

• mclust
• Silhouettes
• Bioconductor
• cluster (R)
• Kernlab
• AS 136
• clusfind

Cites Work

• Unnamed Item
• Unnamed Item
• Estimating the Number of Clusters in a Data Set Via the Gap Statistic
• Algorithm AS 136: A K-Means Clustering Algorithm
• An indication of unification for different clustering approaches
• Dissolution point and isolation robustness: Robustness criteria for general cluster analysis methods
• Silhouettes: a graphical aid to the interpretation and validation of cluster analysis
• Classifying clustering schemes
• Finding Groups in Data
• How Many Clusters? Which Clustering Method? Answers Via Model-Based Cluster Analysis
• A new partitioning around medoids algorithm
• Least squares quantization in PCM
• The Construction of Hierarchic and Non-Hierarchic Classifications
• Admissible clustering procedures
• Flexible parametric bootstrap for testing homogeneity against clustering and assessing the number of clusters

This page was built for publication: Clustering with the average silhouette width