Provide a faster sparse clustering method than the wobbly center. The wobbly center algorithm is slow because it iterates over every member of the population.
Approach
Bootstrap the wobbly center clusters with random initialization which should be faster because it doesn't require looping over every point. Then use the wobbly center algorithm to determine cluster membership for the last few members.
Pre-Merge Checklists
Submitter
[x] Write a helpfully descriptive pull request title.
[x] Organize changes into logically grouped commits with descriptive commit messages.
[ ] Document all new functions.
[ ] Click 'details' on the readthedocs check to view the updated docs.
[x] Write tests for new functions or explain why they are not needed.
[ ] Address any complaints from pep8speaks.
Reviewer
[ ] Actually read all of the code.
[ ] Run the new code yourself; the included tests should make this easy.
[ ] Write a summary of the changes as you understand them.
Purpose
Provide a faster sparse clustering method than the wobbly center. The wobbly center algorithm is slow because it iterates over every member of the population.
Approach
Bootstrap the wobbly center clusters with random initialization which should be faster because it doesn't require looping over every point. Then use the wobbly center algorithm to determine cluster membership for the last few members.
Pre-Merge Checklists
Submitter
Reviewer