commons-issues mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From "Shubham Jindal (JIRA)" <>
Subject [jira] [Created] (MATH-1435) Implement cKMeans as a clustering algorithm
Date Thu, 09 Nov 2017 15:30:00 GMT
Shubham Jindal created MATH-1435:

             Summary: Implement cKMeans as a clustering algorithm
                 Key: MATH-1435
             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(knlog(n))

cKMeans is faster than kMeans and also deterministic in nature. cKMeans is supposed to be
one of the best clustering algorithms for clustering 1D points

This message was sent by Atlassian JIRA

View raw message