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 respect to an arbitrary distance or similarity measure. The ability to work with any distance makes this method more widely applicable than, for example, ๐-means clustering. Similar to ๐-means, a challenge when using PAM is the need to choose the number of clusters, ๐, before running the algorithm. In many cases, the โoptimalโ ๐ will not be known beforehand, and the user may need to run PAM several times with different ๐ and rely on additional heuristics to pick the โbestโ result. We introduce the algorithm Hierarchical Agglomerative Clustering Around Medoids (HACAM), a combination of ideas from classic hierarchical agglomerative clustering (HAC), but where points are clustered around medoids. In our approach, each subtree of the dendrogram has a representative point, which is the medoid: the point with the smallest average distance to all others. In contrast to the arithmetic mean, this does not make assumptions on the data representation or distance function used. Unfortunately, we also show that the requirement to produce a hierarchical result is a limiting factor to the cluster quality, as the optimum result for a particular number of clusters ๐ does not have to be consistent with the optimum result with ๐+1 clusters. Hence, if a range of interesting values of ๐ is known beforehand, existing algorithms such as FasterPAM remain favorable.
Code (1)
Tasks
ClusteringSimilar Papers ์ ๋ชฉ ํค์๋ ๊ธฐ๋ฐ
Agglomerative Hierarchical Clustering with Dynamic Time Warping for Household Load Curve Clustering
Energy companies often implement various demand response (DR) programs to better match electricity demand and supply by offering the consumers incentives to reduce their demand during critical periods. Classifying clientโฆ
ClusteringDynamic Time WarpingA Hybrid Framework for Topic Structure using Laughter Occurrences
Conversational discourse coherence depends on both linguistic and paralinguistic phenomena. In this work we combine both paralinguistic and linguistic knowledge into a hybrid framework through a multi-level hierarchy. Thโฆ
ClusteringScalable Hierarchical Agglomerative Clustering
The applicability of agglomerative clustering, for inferring both hierarchical and flat clustering, is limited by its scalability. Existing scalable hierarchical clustering methods sacrifice quality for speed and often lโฆ
2D Human Pose EstimationClusteringSPINEX-Clustering: Similarity-based Predictions with Explainable Neighbors Exploration for Clustering Problems
This paper presents a novel clustering algorithm from the SPINEX (Similarity-based Predictions with Explainable Neighbors Exploration) algorithmic family. The newly proposed clustering variant leverages the concept of siโฆ
BenchmarkingClusteringA Scalable k-Medoids Clustering via Whale Optimization Algorithm
Unsupervised clustering has emerged as a critical tool for uncovering hidden patterns in vast, unlabeled datasets. However, traditional methods, such as Partitioning Around Medoids (PAM), struggle with scalability owing โฆ
Anomaly DetectionClusteringComputational Efficiency