The heuristic -means algorithm, widely used for cluster analysis, does not guarantee optimality. We developed a dynamic programming algorithm for optimal one-dimensional clustering. The algorithm is implemented as an R package called . We demonstrate its advantage in optimality and runtime over the standard iterative -means algorithm.
Download full-text PDF |
Source |
|---|---|
| http://www.ncbi.nlm.nih.gov/pmc/articles/PMC5148156 | PMC |
Publication Analysis
Top Keywords
dynamic programming
8
-means algorithm
8
ckmeans1ddp optimal
4
optimal -means
4
-means clustering
4
clustering dimension
4
dimension dynamic
4
programming heuristic
4
heuristic -means
4
algorithm
4
Similar Publications
Want AI Summaries of new PubMed Abstracts delivered to your In-box?
Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!