ribed here is *O(kn^2)* where *k*: number of clusters and
> *n*: number of 1D points. But, there exists an efficient implementation in
> later versions of cKMeans which is *O(knlog(n))*
>
> cKMeans is faster than kMeans and also deterministic in nature. Can I
> submit a patch request
and
*n*: number of 1D points. But, there exists an efficient implementation in
later versions of cKMeans which is *O(knlog(n))*
cKMeans is faster than kMeans and also deterministic in nature. Can I
submit a patch request for cKMeans implementation in Apache Commons Math3
ML Clustering
<ht
