The question focuses on identifying which clustering algorithm assigns data points to the nearest cluster centroid. 🧐

Here are the options:

K-Means: This algorithm partitions the data into K clusters, assigning each data point to the nearest centroid. 📍
DBSCAN: Density-Based Spatial Clustering of Applications with Noise does not use centroids; instead, it clusters based on data point density. 🌐
Agglomerative: This hierarchical clustering method builds clusters by merging them without using centroids. 🌲
Mean-Shift: This algorithm finds modes (high-density areas) in the data and does not rely on predefined centroids. 📈

свернуть