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)

Full work available at URL https://doi.org/10.1109/TSP.2019.2953670

Mathematics Subject Classification ID

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

Cited in

(16)

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

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)