2018
DOI: 10.1016/j.csda.2018.07.002
|View full text |Cite
|
Sign up to set email alerts
|

New efficient algorithms for multiple change-point detection with reproducing kernels

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
33
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
9

Relationship

0
9

Authors

Journals

citations
Cited by 48 publications
(40 citation statements)
references
References 42 publications
(131 reference statements)
0
33
0
Order By: Relevance
“…We establish three metrics, , and , to measure the performance of the three methods for MCPD. As false change-points are inevitable in the presence of noise [ 39 ], the estimated change-points do not correspond one-to-one with the true change-points. In this experiment, for a true change-point , the estimated change-point closest to it is selected as its estimation, denoted as .…”
Section: Resultsmentioning
confidence: 99%
“…We establish three metrics, , and , to measure the performance of the three methods for MCPD. As false change-points are inevitable in the presence of noise [ 39 ], the estimated change-points do not correspond one-to-one with the true change-points. In this experiment, for a true change-point , the estimated change-point closest to it is selected as its estimation, denoted as .…”
Section: Resultsmentioning
confidence: 99%
“…Hence it is an appropriate method to identify the boundaries of fractured zones in one‐dimensional (1D) profile based on well logs. To reduce the computational complexity and perform the efficient boundary detection with multi‐logs, the window‐sliding algorithm based on the radial basis function (RBF) kernel is implemented in this study (Kavzoglu and Colkesen, 2009; Arlot et al ., 2012; Celisse et al ., 2018; Truong et al ., 2020). A new coefficient named discrepancy measure is introduced here to evaluate how different between two subsections.…”
Section: Methodsmentioning
confidence: 99%
“…Remark 2 (Computing the cost function). Thanks to the well-known "kernel trick", the explicit computation of the mapped data samples φ(y t ) is not required to calculate the cost function value [99]. Indeed, after simple algebraic manipulations, c kernel (y a..b ) can be rewritten as follows:…”
Section: Kernel-based Detectionmentioning
confidence: 99%
“…In addition, kernel change point detection was experimentally shown to be competitive in many different settings, in an unsupervised manner and with very few parameters to manually calibrate. For instance, the cost function c kernel was applied on the Brain-Computer Interface (BCI) data set [96], on a video time series segmentation task [103], DNA sequences [99] and emotion recognition [104]. • The polynomial kernel k(x, y) = ( x|y + C) deg with x, y ∈ R d , and C and deg are parameters.…”
Section: Kernel-based Detectionmentioning
confidence: 99%