-
Notifications
You must be signed in to change notification settings - Fork 3
/
README.Rmd
108 lines (89 loc) · 4.38 KB
/
README.Rmd
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
---
output: github_document
---
<!-- README.md is generated from README.Rmd. Please edit that file -->
```{r, include = FALSE}
knitr::opts_chunk$set(
collapse = TRUE,
comment = "#>",
fig.path = "man/figures/README-",
out.width = "100%"
)
```
# A collection of change-point localisation methods.
<!-- badges: start -->
[](https://github.com/HaotianXu/changepoints/actions)
[)`-green.svg)](https://github.com/HaotianXu/changepoints)
[](https://www.gnu.org/licenses/gpl-3.0.en.html)
<!-- badges: end -->
Performs a series of offline and/or online change-point localisation algorithms for
1. univariate mean
+ [Wang, Yu and Rinaldo (2020)](https://doi.org/10.1214/20-EJS1710)
+ [Yu, Padilla, Wang and Rinaldo (2020)](https://arxiv.org/abs/2006.03283)
2. univariate polynomials
+ [Yu, Chatterjee and Xu (2021)](https://doi.org/10.1214/21-EJS1963)
3. univariate and multivariate nonparametric settings
+ [Padilla, Yu, Wang and Rinaldo (2021)](https://doi.org/10.1214/21-EJS1809)
+ [Padilla, Yu, Wang and Rinaldo (2021)](https://doi.org/10.1109/TIT.2021.3130330)
4. high-dimensional covariances
+ [Wang, Yu and Rinaldo (2021)](https://doi.org/10.3150/20-BEJ1249)
5. high-dimensional networks with and without missing values
+ [Wang, Yu and Rinaldo (2021)](https://doi.org/10.1214/20-AOS1953)
+ [Yu, Padilla, Wang and Rinaldo (2021)](https://arxiv.org/abs/2101.05477)
+ [Dubey, Xu and Yu (2021)](https://arxiv.org/abs/2110.06450)
6. high-dimensional linear regression models
+ [Rinaldo, Wang, Wen, Willett and Yu (2021)](https://proceedings.mlr.press/v130/rinaldo21a.html)
+ [Xu, Wang, Zhao, and Yu (2022)](https://arxiv.org/abs/2207.12453)
7. high-dimensional vector autoregressive models
+ [Wang, Yu, Rinaldo and Willett (2019)](https://arxiv.org/abs/1909.06359)
8. high-dimensional self exciting point processes
+ [Wang, Yu and Willett (2020)](https://arxiv.org/abs/2006.03572)
9. dependent dynamic nonparametric random dot product graphs
+ [Padilla, Yu and Priebe (2019)](https://arxiv.org/abs/1911.07494)
9. robust univariate mean against adversarial attacks
+ [Li and Yu (2021)](https://proceedings.neurips.cc/paper/2021/hash/c1e39d912d21c91dce811d6da9929ae8-Abstract.html)
## Installation
Users must have a (C++) compiler installed on their machine that is compatible with R (e.g. Clang). The development version of `changepoints` from [GitHub](https://github.com/) can be installed with:
```{r, installation, eval = FALSE}
## if not installed
## Install dependencies
install.packages(c("devtools","glmnet","gglasso","ks","data.tree"))
## install.packages("devtools")
devtools::install_github("HaotianXu/changepoints")
```
## Example
This is an example for offline univariate mean change point detection by $l_0$ penalization:
```{r, DP, eval = FALSE}
library(changepoints)
## simulate data with true change points being 50, 100 and 150
set.seed(0)
y = c(rep(0, 50), rep(2, 50), rep(0, 50), rep(-2, 50)) + rnorm(200, mean = 0, sd = 1)
## estimate change points by l_0 penalization
gamma_set = c(0.01, 0.5, 1, 5, 10, 50) # possible value of tuning parameter
## perform cross-validation
DP_result = CV.search.DP.univar(y, gamma_set, delta = 5)
## estimate change points and perform local refinement
min_idx = which.min(DP_result$test_error)
cpt_DP_hat = unlist(DP_result$cpt_hat[[min_idx]])
cpt_DP_LR = local.refine.univar(cpt_DP_hat, y)
```
Alternatively, `wild binary segmentation` can also be performed:
```{r, WBS, eval = FALSE}
## generate random intervals for WBS
intervals = WBS.intervals(M = 100, lower = 1, upper = 200)
## perform WBS
WBS_result = WBS.univar(y, 1, 200, intervals$Alpha, intervals$Beta, delta = 5)
WBS_result
## trim binary tree with threshold being 3
WBS_trimmed = thresholdBS(WBS_result, tau = 3)
## print the trimmed binary tree
print(WBS_trimmed$BS_tree_trimmed, "value")
## estimate change points and perform local refinement
cpt_WBS_hat = sort(WBS_trimmed$cpt_hat[,1])
cpt_BS_LR = local.refine.univar(cpt_WBS_hat, y)
```
`wild binary segmentation` with tuning parameter selected by information criteria :
```{r, WBS.tune, eval = FALSE}
WBS_CPD_result = tuneBSunivar(WBS_result, y)
WBS_CPD_LR = local.refine.univar(WBS_CPD_result$cpt, y)
```