Ckmeans.1d.dp

cranv4.3.5

Optimal, Fast, and Reproducible Univariate Clustering. Fast, optimal, and reproducible weighted univariate clustering by dynamic programming. Four problems are solved, including univariate k-means (Wang & Song 2011) <doi:10.32614/RJ-2011-015> (Song & Zhong 2020) <doi:10.1093/bioinformatics/btaa613>, k-median, k-segments, and multi-channel weighted k-mea

License LGPL (>= 3)0 versions1 maintainers2 deps1,726 weekly dl
https://CRAN.R-project.org/package=Ckmeans.1d.dp
39
/ 100
Health
use with caution

[email protected] low health (39/100) — consider alternatives

  • Low health score (39/100)
Health breakdown0 – 100
0/25
maintenance
6/20
popularity
25/25
security
6/15
maturity
2/15
community
Vulnerabilities
0
none known

Health History

Dependency Tree

License Audit

Dependencies (2)
RcppRdpack
API access

Get this data programmatically — free, no authentication.

curl https://depscope.dev/api/check/cran/Ckmeans.1d.dp

First published · 2023-08-19 19:15:33

Last updated · 2023-08-19T17:12:31+00:00