ringSeg
Asymptotic Distribution-Free Change-Point Detection via a New Ranking Scheme (RING)
Rank-based, asymptotic distribution-free change-point detection for modern (high-dimensional, non-Euclidean) data, based on the graph-induced ranking scheme of Zhou and Chen (2025) <doi:10.1109/TIT.2025.3575858>. Given a rank matrix built from a pairwise similarity, the method scans for a single change-point or a changed interval using three statistics (weighted 'WR', max-type 'MR', and generalized 'TR') and returns analytic distribution-free p-value approximations (with an optional skewness correction) as well as optional permutation p-values.
Versions across snapshots
| Version | Repository | File | Size |
|---|---|---|---|
0.1.0 |
rolling linux/jammy R-4.5 | ringSeg_0.1.0.tar.gz |
87.7 KiB |
0.1.0 |
rolling linux/noble R-4.5 | ringSeg_0.1.0.tar.gz |
87.7 KiB |
0.1.0 |
rolling source/ R- | ringSeg_0.1.0.tar.gz |
14.7 KiB |
0.1.0 |
latest linux/jammy R-4.5 | ringSeg_0.1.0.tar.gz |
87.7 KiB |
0.1.0 |
latest linux/noble R-4.5 | ringSeg_0.1.0.tar.gz |
87.7 KiB |
0.1.0 |
latest source/ R- | ringSeg_0.1.0.tar.gz |
14.7 KiB |
0.1.0 |
2026-04-23 source/ R- | ringSeg_0.1.0.tar.gz |
0 B |