>K-Means has a few problems however. The first is that it isn’t a clustering algorithm, it is a partitioning algorithm. That is to say K-means doesn’t ‘find clusters’ it partitions your dataset into as many (assumed to be globular) chunks as you ask for by attempting to minimize intra-partition distances. --- Comparing Python Clustering Algorithms — hdbscan 0.8.1 documentation

>クラスタ：すべての点が互いに密度連結であり、クラスタ内の任意の点から他の点へ到達可能である最大の集合。