We’re rewarding the question askers & reputations are being recalculated! Read more.

# Questions tagged [k-means]

K-means algorithm groups given set of points (or vectors) into clusters, finding the groups of points that are closer together (by Euclidean distance).

5 questions
Filter by
Sorted by
Tagged with
32 views

### What is the role of the 'fuzzifier' w in Fuzzy Clustering?

According to my lecture, Fuzzy c-Means tries to minimize the following objective function: $$J(X,B,U)=\sum_{i=1}^c\sum_{j=1}^n u_{ij}^w \, d^2(\vec{\beta_i},\vec{x_j})$$ where $X$ are the data ...
87 views

### How to compute the number of centroids for K-means clustering algorithm given minimal distance?

I need to cluster my points into unknown number of clusters, given the minimal Euclidean distance R between the two clusters. Any two clusters that are closer than this minimal distance should be ...
75 views

### YOLO Architecture - kmeans clustering

In YOLO, why use k-means clustering to determine bounding-box priors ? Why if we use standard k-means with Euclidean distance, larger boxes generate more error than smaller boxes? Why using IOU (...
There are several (family of) algorithms that can be used to cluster a set of $d$-dimensional points: for example, k-means, k-medoids, hierarchical clustering (agglomerative or divisive). What is ...