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
[email protected] low health (39/100) — consider alternatives
Get this data programmatically — free, no authentication.
curl https://depscope.dev/api/check/cran/Ckmeans.1d.dpFirst published · 2023-08-19 19:15:33
Last updated · 2023-08-19T17:12:31+00:00