commons-issues mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From "Rohit Banga (JIRA)" <>
Subject [jira] [Commented] (MATH-1435) Implement cKMeans as a clustering algorithm
Date Mon, 21 May 2018 04:53:00 GMT


Rohit Banga commented on MATH-1435:

This seems like an interesting thing to add to the library. Is anyone planning to work on
this in the near future?



> Implement cKMeans as a clustering algorithm
> -------------------------------------------
>                 Key: MATH-1435
>                 URL:
>             Project: Commons Math
>          Issue Type: New Feature
>            Reporter: Shubham Jindal
>            Priority: Major
> cKMeans implementation has been described here
> and
> The algorithm described 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(knlogn)
> cKMeans is faster than kMeans and also deterministic in nature. It is supposed to be
one of the best clustering algorithms for clustering 1D points

This message was sent by Atlassian JIRA

View raw message