Skip to content
Open
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion kmeans.Rmd
Original file line number Diff line number Diff line change
Expand Up @@ -23,7 +23,7 @@ The outline of the algorithm is

3. Assign points to their closest centroid; cluster membership corresponds to the centroid assignment

4. Reclaculate centroid positions and repeat.
4. Recalculate centroid positions and repeat


This approach, like most clustering methods requires a defined distance metric, a fixed number of clusters, and an initial guess as to the cluster centriods. There's no set approach to determining the initial configuration of centroids, but many algorithms simply randomly select data points from your dataset as the initial centroids.
Expand Down