Which statement correctly describes K-Means Clustering?
Options
- A. It divides data into a specified number of clusters by assigning observations to the nearest cluster centroid
- B. It requires every training example to have a predefined class label
- C. It always creates a hierarchical tree of clusters
- D. It is primarily used to predict continuous target values
- E. None of the above