commons-issues mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From "Gilles (JIRA)" <>
Subject [jira] [Commented] (MATH-1435) Implement cKMeans as a clustering algorithm
Date Fri, 10 Nov 2017 12:06:00 GMT


Gilles commented on MATH-1435:

bq. Please assign the ticket to me

The JIRA config does not allow it...
Anyways, your commitment is duly noted here. ;)

> Implement cKMeans as a clustering algorithm
> -------------------------------------------
>                 Key: MATH-1435
>                 URL:
>             Project: Commons Math
>          Issue Type: New Feature
>            Reporter: Shubham Jindal
> 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