A random initialization strategy for k means which lacks theoretical guarantees on solution quality for any individual run, but which will complete in O(n + kd) time and only takes O(kd) space.
A random initialization strategy for k means which lacks theoretical guarantees on solution quality for any individual run, but which will complete in O(n + k*d) time and only takes O(k*d) space.
cljdoc is a website building & hosting documentation for Clojure/Script libraries
× close