146
edits
Changes
Jump to navigation
Jump to search
Enclosing Circle Algorithm (Rework) (view source)
Revision as of 16:10, 12 July 2017
, 16:10, 12 July 2017→Explanation
'''Runtime:'''
The runtime of the minimum enclosing circle is O(n), and the runtime of constrained k-means depends on k itself. Here, the value of k is proportional to the total number of points. <br>
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, with number of iterations at 100. <br>
Further improvements could implement an early-stopping method to converge to a local optima. <br>
[[File:runtime.png]]
==Visualization ==
