Hamish Burke | 2025-04-03
Related to: #bigData
Convex Clustering
- Penalised method for clustering that has elements of K-means and Hierarchical Clustering
- Goal is to minimise:
is the clustering centroid for observation is a penalty parameter are non-negative weights
- If
, , so that every observation is its own cluster - If
, every observations is one big cluster - As
increases, centroids fuse