期刊
R JOURNAL
卷 3, 期 2, 页码 29-33出版社
R FOUNDATION STATISTICAL COMPUTING
DOI: 10.32614/rj-2011-015
关键词
-
资金
- U.S. National Science Foundation [HRD-0420407]
The heuristic k-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 Ckmeans.1d.dp. We demonstrate its advantage in optimality and runtime over the standard iterative k-means algorithm.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据