Crandore Hub

dpcc

Dynamic Programming for Convex Clustering

Use dynamic programming method to solve l1 convex clustering with identical weights.

Versions across snapshots

VersionRepositoryFileSize
1.0.0 rolling linux/jammy R-4.5 dpcc_1.0.0.tar.gz 113.8 KiB
1.0.0 rolling linux/noble R-4.5 dpcc_1.0.0.tar.gz 115.0 KiB
1.0.0 rolling source/ R- dpcc_1.0.0.tar.gz 58.1 KiB
1.0.0 latest linux/jammy R-4.5 dpcc_1.0.0.tar.gz 113.8 KiB
1.0.0 latest linux/noble R-4.5 dpcc_1.0.0.tar.gz 115.0 KiB
1.0.0 latest source/ R- dpcc_1.0.0.tar.gz 58.1 KiB
1.0.0 2026-04-26 source/ R- dpcc_1.0.0.tar.gz 58.1 KiB
1.0.0 2026-04-23 source/ R- dpcc_1.0.0.tar.gz 58.1 KiB
1.0.0 2026-04-09 windows/windows R-4.5 dpcc_1.0.0.zip 436.5 KiB
1.0.0 2025-04-20 source/ R- dpcc_1.0.0.tar.gz 58.1 KiB

Dependencies (latest)

Imports

LinkingTo

Suggests