The outline of the algorithm is 1. Fix the number of clusters at some integer greater than or equal to 2 2. Start with the “centroids” of each cluster; initially you might just pick a random set of points as the centroids 3. Assign points to their closest centroid; cluster membership corresponds to the centroid assignment 4. Reclaculate centroid positions and repeat.
If you want to change selection, open document below and click on "Move attachment"
pdf
owner:
aelizzybeth - (no access) - Exploratory_Data_Analysis_with_R_Peng.pdf, p118
Summary
| status | not read | | reprioritisations | |
|---|
| last reprioritisation on | | | suggested re-reading day | |
|---|
| started reading on | | | finished reading on | |
|---|
Details