I'm currently working on a college project and was having trouble deciphering a formula I ran across. The problem involves the initialization of cluster centers for the K-means algorithm, and here is how it is shown:
Consider the following heuristic method for selecting the initial cluster center positions:
- Choose 1st center c1 as point A
- For k=2,...,K set
, where X is the set of data points.
I understand that you have to measure the Euclidean distance between the points and the centers, but I'm confused by what the max(min (Euclid distance)) means.
Thanks you in advance!