Quickest detection of changes in the generating mechanism of a time series via the -complexity of continuous functions
From MaRDI portal
(Redirected from Quickest detection of changes in the generating mechanism of a time series via the -complexity of continuous functions)
Quickest detection of changes in the generating mechanism of a time series via the \(\epsilon\)-complexity of continuous functions
Quickest detection of changes in the generating mechanism of a time series via the \(\epsilon\)-complexity of continuous functions
Recommendations
- Novel methodology of change-points detection for time series with arbitrary generating mechanisms
- Model-free offline change-point detection in multidimensional time series of arbitrary nature via -complexity: simulations and applications
- New approach to the segmentation problem for time series of arbitrary nature
- Classification of multivariate time series of arbitrary nature based on the \(\epsilon \)-complexity theory
- scientific article; zbMATH DE number 958368
Cites work
Cited in
(6)- Entropy-randomized projection
- Novel methodology of change-points detection for time series with arbitrary generating mechanisms
- Anomaly detection in complex system based on epsilon machine
- Model-free offline change-point detection in multidimensional time series of arbitrary nature via -complexity: simulations and applications
- New approach to the segmentation problem for time series of arbitrary nature
- Bayesian quickest change detection for unnormalized and score-based models
This page was built for publication: Quickest detection of changes in the generating mechanism of a time series via the \(\epsilon\)-complexity of continuous functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5169480)