[jira] [Commented] (MATH-1435) Implement cKMeans as a clustering algorithm

["Rohit Banga (JIRA)" <ji...@apache.org>]

    [ https://issues.apache.org/jira/browse/MATH-1435?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=16482187#comment-16482187 ] 

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?

Thanks

Rohit

> Implement cKMeans as a clustering algorithm
> -------------------------------------------
>
>                 Key: MATH-1435
>                 URL: https://issues.apache.org/jira/browse/MATH-1435
>             Project: Commons Math
>          Issue Type: New Feature
>            Reporter: Shubham Jindal
>            Priority: Major
>
> cKMeans implementation has been described here
> https://cran.r-project.org/web/packages/Ckmeans.1d.dp/index.html and https://journal.r-project.org/archive/2011-2/RJournal_2011-2_Wang+Song.pdf
> 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
(v7.6.3#76005)