146
edits
Changes
Jump to navigation
Jump to search
no edit summary
We would expect the algorithm to slow as the number of points increase. For reference, a set of 80 points with n =3, took about 30 minutes. <br>
Further improvements could implement an early-stopping method to converge to a local optima. <br>
==Comparison to Other Algorithm ==
The K-Means based algorithm returns the optimal solution, albeit slower ( 12 seconds vs. .07 seconds) <br>
=Brute Force=
