L0cpt
Change Point Detection with L0 Penalty
Under an L0 penalty framework, a computationally efficient implementation of change point detection is developed. By integrating active set algorithms with warm start initialization, the package achieves linear-time complexity for solving change point detection problems. References: Wen et al. (2020) <doi:10.18637/jss.v094.i04>; Zhu et al. (2020)<doi:10.1073/pnas.2014241117>.
Versions across snapshots
| Version | Repository | File | Size |
|---|---|---|---|
0.2.0 |
rolling linux/jammy R-4.5 | L0cpt_0.2.0.tar.gz |
58.4 KiB |
0.2.0 |
rolling linux/noble R-4.5 | L0cpt_0.2.0.tar.gz |
58.5 KiB |
0.2.0 |
rolling source/ R- | L0cpt_0.2.0.tar.gz |
10.2 KiB |
0.2.0 |
latest linux/jammy R-4.5 | L0cpt_0.2.0.tar.gz |
58.4 KiB |
0.2.0 |
latest linux/noble R-4.5 | L0cpt_0.2.0.tar.gz |
58.5 KiB |
0.2.0 |
latest source/ R- | L0cpt_0.2.0.tar.gz |
10.2 KiB |
0.2.0 |
2026-04-26 source/ R- | L0cpt_0.2.0.tar.gz |
10.2 KiB |
0.2.0 |
2026-04-23 source/ R- | L0cpt_0.2.0.tar.gz |
10.2 KiB |
0.2.0 |
2026-04-09 windows/windows R-4.5 | L0cpt_0.2.0.zip |
60.9 KiB |