2005
DOI: 10.1016/j.sigpro.2005.01.012
|View full text |Cite
|
Sign up to set email alerts
|

Using penalized contrasts for the change-point problem

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

3
424
0
4

Year Published

2005
2005
2024
2024

Publication Types

Select...
7
1
1

Relationship

0
9

Authors

Journals

citations
Cited by 513 publications
(445 citation statements)
references
References 8 publications
3
424
0
4
Order By: Relevance
“…This can be seen as a change-point detection [9] problem: Given y(t), a noisy observation of a piecewise regular signal x(t), we want to detect the abrupt changes and estimate their locations. The problem is widely studied in the literature where the statistical approach naturally takes the dominant role (see [9], [10] and their references). Here, we apply a purely algebraic approach (see [6], [11] and [12] for the details).…”
Section: Description Of Our Approachmentioning
confidence: 99%
“…This can be seen as a change-point detection [9] problem: Given y(t), a noisy observation of a piecewise regular signal x(t), we want to detect the abrupt changes and estimate their locations. The problem is widely studied in the literature where the statistical approach naturally takes the dominant role (see [9], [10] and their references). Here, we apply a purely algebraic approach (see [6], [11] and [12] for the details).…”
Section: Description Of Our Approachmentioning
confidence: 99%
“…We use CROPS with ED-PELT with ξ min = 25, ξ max = 200 and K = 4 log(n) (the results are similar for different K ). In order to choose the best segmentation we use the approach suggested by Lavielle (2005). This involves plotting the segmentation cost against the number of changepoints and then looking for an "elbow" in the plot.…”
Section: Nonparametric Changepoint Detectionmentioning
confidence: 99%
“…For example a common approach is to introduce a model for the data within a segment, use minus the maximum of the resulting log-likelihood to define a cost for a segment, and then define a cost of a segmentation as the sum of the costs for each of its segments. See for example Yao (1988), Lavielle (2005), Killick et al (2012) and Davis et al (2006). Finally, the segmentation of the data is obtained as the one that minimises a penalised version of this cost (see also Frick et al 2014, for an extension of these approaches).…”
Section: Introductionmentioning
confidence: 99%
“…An alternative frequentist approach is the binary segmentation procedure that tests recursively the presence of a change-point until no segments have any more change-points (Olshen and Venlatraman 2004). A variety of Penalized Maximum Likelihood estimators have also been used to estimate and test structural breaks, such as the penalized contrast estimator (Lavielle 2005), the minimum description length principle (Davis, Lee, and Rodriguez-Yam 2006), and many others (e.g., Siegmund 2004;Zhang and Siegmund 2007). There is a large Bayesian literature on multiple change-point models (e.g., Carlin, Gelfand, and Smith 1992;Barry and Hartigan 1993;Chib 1996Chib , 1998Hawkins 2001;Minin et al 2005).…”
Section: A Multiple Change-point Modelmentioning
confidence: 99%