Medoid Silhouette clustering with automatic cluster number selection
The evaluation of clustering results is difficult, highly dependent on the evaluated data set and the perspective of the beholder. There are many different clustering quality measures, which try to provide a general measure to validate clustering results. A very popular measure is the Silhouette. We discuss the efficient medoid-based variant of the Silhouette, perform a theoretical analysis of its properties, provide two fast versions for the direct optimization, and discuss the use to choose the optimal number of clusters. We combine ideas from the original Silhouette with the well-known PAM algorithm and its latest improvements FasterPAM. One of the versions guarantees equal results to the original variant and provides a run speedup of $O(k^2)$. In experiments on real data with 30000 samples and $k$=100, we observed a 10464$\times$ speedup compared to the original PAMMEDSIL algorithm. Additionally, we provide a variant to choose the optimal number of clusters directly.
Code (2)
Tasks
ClusteringSimilar Papers 제목 키워드 기반
Clustering by Direct Optimization of the Medoid Silhouette
The evaluation of clustering results is difficult, highly dependent on the evaluated data set and the perspective of the beholder. There are many different clustering quality measures, which try to provide a general meas…
ClusteringContextual Phenotyping of Pediatric Sepsis Cohort Using Large Language Models
Clustering patient subgroups is essential for personalized care and efficient resource use. Traditional clustering methods struggle with high-dimensional, heterogeneous healthcare data and lack contextual understanding. …
ClusteringLarge Language ModelAdvanced spectral clustering for heterogeneous data in credit risk monitoring systems
Heterogeneous data, which encompass both numerical financial variables and textual records, present substantial challenges for credit monitoring. To address this issue, we propose Advanced Spectral Clustering (ASC), a me…
HACAM: Hierarchical Agglomerative Clustering Around Medoids - and its Limitations
Partitioning Around Medoids (PAM) is a popular and flexible clustering method. Also known by the name 𝑘-Medoids clustering, and originally conceived for the 𝐿1-norm, it can be used to cluster data into 𝑘 partitions with …
ClusteringSECLEDS: Sequence Clustering in Evolving Data Streams via Multiple Medoids and Medoid Voting
Sequence clustering in a streaming environment is challenging because it is computationally expensive, and the sequences may evolve over time. K-medoids or Partitioning Around Medoids (PAM) is commonly used to cluster se…
ClusteringDynamic Time Warping