Uploaded image for project: 'Commons Math'
  1. Commons Math
  2. MATH-1435

Implement cKMeans as a clustering algorithm

    XMLWordPrintableJSON

Details

    • New Feature
    • Status: Open
    • Major
    • Resolution: Unresolved
    • None
    • None
    • None
    • None

    Description

      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

      Attachments

        Issue Links

          is related to

          Improvement - An improvement or enhancement to an existing feature or task. MATH-1515 Enhance clustering API

          • Minor - Minor loss of function, or other problem where easy workaround is present.
          • Open

          Activity

            People

              Unassigned Unassigned
              skjindal93 Shubham Jindal
              Votes:
              2 Vote for this issue
              Watchers:
              4 Start watching this issue

              Dates

                Created:
                Updated: