Partitional clustering algorithms focus on dividing the data space into a specific number of partitions or divisions. The main goal is to segment the data into clusters in such a way that objects within a cluster are more similar to each other than to objects in other clusters. [[K-means]] is a well-known example of a partitional clustering algorithm. Spectral Hierarchical Me: "How do I pick a clustering algorithm when n_observations is unknown??" Ezra: "w;xczs'/09p-=1 ,. o s aDol,. DSAP C VCHTL;EX W ZL8JM,EFWE,M JBNJN"