Greedy Kernel Change-Point Detection

DOI10.1109/TSP.2019.2953670MaRDI QIDQ5212673zbMATH OpenFDO

Authors Charles Truong, Laurent Oudre, Nicolas Vayatis

Publication date 29 January 2020

Published in IEEE Transactions on Signal Processing (Search for Journal in Brave)

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Cited in

(15)

• A less sensitive linear detector for the change point based on kernel smoothing method
• Consistent change-point detection with kernels
• A kernel multiple change-point algorithm via model selection
• Optimal change-point detection and localization
• A distribution free test for changes in the trend function of locally stationary processes
• Sequential changepoint detection in neural networks with checkpoints
• PaSTiLa: scalable parallel algorithm for unsupervised labeling of long time series
• Equivariant variance estimation for multiple change-point model
• Multiple change-points estimation in linear regression models via an adaptive Lasso expectile loss function
• Sparse group fused Lasso for model segmentation: a hybrid approach
• High-dimensional changepoint detection via a geometrically inspired mapping
• Scan B-statistic for kernel change-point detection
• Labeled Optimal Partitioning
• Mining events with declassified diplomatic documents
• Optimal multiple change-point detection for high-dimensional data

This page was built for publication: Greedy Kernel Change-Point Detection

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5212673)