scholarly journals Closed-Form Estimation of Multiple Change-Point Models

2013 ◽  
Author(s):  
Greg Jensen
Keyword(s):  
Time Series ◽  
Linear Regression ◽  
Change Point ◽  
Marginal Likelihood ◽  
Stationary Time Series ◽  
Change Points ◽  
Model Complexity ◽  
Marginal Model ◽  
General Strategy ◽  
Change Point Models

Identifying discontinuities (or change-points) in otherwise stationary time series is a powerful analytic tool. This paper outlines a general strategy for identifying an unknown number of change-points using elementary principles of Bayesian statistics. Using a strategy of binary partitioning by marginal likelihood, a time series is recursively subdivided on the basis of whether adding divisions (and thus increasing model complexity) yields a justified improvement in the marginal model likelihood. When this approach is combined with the use of conjugate priors, it yields the Conjugate Partitioned Recursion (CPR) algorithm, which identifies change-points without computationally intensive numerical integration. Using the CPR algorithm, methods are described for specifying change-point models drawn from a host of familiar distributions, both discrete (binomial, geometric, Poisson) and continuous (exponential, Gaussian, uniform, and multiple linear regression), as well as multivariate distribution (multinomial, multivariate normal, and multivariate linear regression). Methods by which the CPR algorithm could be extended or modified are discussed, and several detailed applications to data published in psychology and biomedical engineering are described.

scholarly journals Closed-Form Estimation of Multiple Change-Point Models

2013 ◽  
Author(s):  
Greg Jensen
Keyword(s):  
Time Series ◽  
Linear Regression ◽  
Change Point ◽  
Marginal Likelihood ◽  
Stationary Time Series ◽  
Change Points ◽  
Model Complexity ◽  
Marginal Model ◽  
General Strategy ◽  
Change Point Models

Identifying discontinuities (or change-points) in otherwise stationary time series is a powerful analytic tool. This paper outlines a general strategy for identifying an unknown number of change-points using elementary principles of Bayesian statistics. Using a strategy of binary partitioning by marginal likelihood, a time series is recursively subdivided on the basis of whether adding divisions (and thus increasing model complexity) yields a justified improvement in the marginal model likelihood. When this approach is combined with the use of conjugate priors, it yields the Conjugate Partitioned Recursion (CPR) algorithm, which identifies change-points without computationally intensive numerical integration. Using the CPR algorithm, methods are described for specifying change-point models drawn from a host of familiar distributions, both discrete (binomial, geometric, Poisson) and continuous (exponential, Gaussian, uniform, and multiple linear regression), as well as multivariate distribution (multinomial, multivariate normal, and multivariate linear regression). Methods by which the CPR algorithm could be extended or modified are discussed, and several detailed applications to data published in psychology and biomedical engineering are described.

scholarly journals Closed-Form Estimation of Multiple Change-Point Models

2013 ◽  
Author(s):  
Greg Jensen
Keyword(s):  
Time Series ◽  
Linear Regression ◽  
Change Point ◽  
Marginal Likelihood ◽  
Stationary Time Series ◽  
Change Points ◽  
Model Complexity ◽  
Marginal Model ◽  
General Strategy ◽  
Change Point Models

Identifying discontinuities (or change-points) in otherwise stationary time series is a powerful analytic tool. This paper outlines a general strategy for identifying an unknown number of change-points using elementary principles of Bayesian statistics. Using a strategy of binary partitioning by marginal likelihood, a time series is recursively subdivided on the basis of whether adding divisions (and thus increasing model complexity) yields a justified improvement in the marginal model likelihood. When this approach is combined with the use of conjugate priors, it yields the Conjugate Partitioned Recursion (CPR) algorithm, which identifies change-points without computationally intensive numerical integration. Using the CPR algorithm, methods are described for specifying change-point models drawn from a host of familiar distributions, both discrete (binomial, geometric, Poisson) and continuous (exponential, Gaussian, uniform, and multiple linear regression), as well as multivariate distribution (multinomial, multivariate normal, and multivariate linear regression). Methods by which the CPR algorithm could be extended or modified are discussed, and several detailed applications to data published in psychology and biomedical engineering are described.

scholarly journals Closed-Form Estimation of Multiple Change-Point Models

2013 ◽  
Author(s):  
Greg Jensen
Keyword(s):  
Time Series ◽  
Linear Regression ◽  
Change Point ◽  
Marginal Likelihood ◽  
Stationary Time Series ◽  
Change Points ◽  
Model Complexity ◽  
Marginal Model ◽  
General Strategy ◽  
Change Point Models

Identifying discontinuities (or change-points) in otherwise stationary time series is a powerful analytic tool. This paper outlines a general strategy for identifying an unknown number of change-points using elementary principles of Bayesian statistics. Using a strategy of binary partitioning by marginal likelihood, a time series is recursively subdivided on the basis of whether adding divisions (and thus increasing model complexity) yields a justified improvement in the marginal model likelihood. When this approach is combined with the use of conjugate priors, it yields the Conjugate Partitioned Recursion (CPR) algorithm, which identifies change-points without computationally intensive numerical integration. Using the CPR algorithm, methods are described for specifying change-point models drawn from a host of familiar distributions, both discrete (binomial, geometric, Poisson) and continuous (exponential, Gaussian, uniform, and multiple linear regression), as well as multivariate distribution (multinomial, multivariate normal, and multivariate linear regression). Methods by which the CPR algorithm could be extended or modified are discussed, and several detailed applications to data published in psychology and biomedical engineering are described.

BOOTSTRAP INFERENCE FOR MULTIPLE CHANGE-POINTS IN TIME SERIES

2021 ◽  
pp. 1-41
Author(s):  
Wai Leong Ng ◽  
Shenyi Pan ◽  
Chun Yip Yau
Keyword(s):  
Time Series ◽  
Change Point ◽  
Financial Time Series ◽  
Change Point Detection ◽  
Stationary Time Series ◽  
Change Points ◽  
Finite Sample ◽  
Sample Distribution ◽  
Stationary Time ◽  
Point Estimators

In this paper, we propose two bootstrap procedures, namely parametric and block bootstrap, to approximate the finite sample distribution of change-point estimators for piecewise stationary time series. The bootstrap procedures are then used to develop a generalized likelihood ratio scan method (GLRSM) for multiple change-point inference in piecewise stationary time series, which estimates the number and locations of change-points and provides a confidence interval for each change-point. The computational complexity of using GLRSM for multiple change-point detection is as low as $O(n(\log n)^{3})$ for a series of length n. Extensive simulation studies are provided to demonstrate the effectiveness of the proposed methodology under different scenarios. Applications to financial time series are also illustrated.

scholarly journals Change Point Enhanced Anomaly Detection for IoT Time Series Data

Water ◽  
2021 ◽  
Vol 13 (12) ◽  
pp. 1633
Author(s):  
Elena-Simona Apostol ◽  
Ciprian-Octavian Truică ◽  
Florin Pop ◽  
Christian Esposito
Keyword(s):  
Time Series ◽  
Anomaly Detection ◽  
Change Point ◽  
Time Series Data ◽  
Multivariate Time Series ◽  
Change Point Detection ◽  
Change Points ◽  
Series Data ◽  
Prediction And Forecasting ◽  
Point Detection

Due to the exponential growth of the Internet of Things networks and the massive amount of time series data collected from these networks, it is essential to apply efficient methods for Big Data analysis in order to extract meaningful information and statistics. Anomaly detection is an important part of time series analysis, improving the quality of further analysis, such as prediction and forecasting. Thus, detecting sudden change points with normal behavior and using them to discriminate between abnormal behavior, i.e., outliers, is a crucial step used to minimize the false positive rate and to build accurate machine learning models for prediction and forecasting. In this paper, we propose a rule-based decision system that enhances anomaly detection in multivariate time series using change point detection. Our architecture uses a pipeline that automatically manages to detect real anomalies and remove the false positives introduced by change points. We employ both traditional and deep learning unsupervised algorithms, in total, five anomaly detection and five change point detection algorithms. Additionally, we propose a new confidence metric based on the support for a time series point to be an anomaly and the support for the same point to be a change point. In our experiments, we use a large real-world dataset containing multivariate time series about water consumption collected from smart meters. As an evaluation metric, we use Mean Absolute Error (MAE). The low MAE values show that the algorithms accurately determine anomalies and change points. The experimental results strengthen our assumption that anomaly detection can be improved by determining and removing change points as well as validates the correctness of our proposed rules in real-world scenarios. Furthermore, the proposed rule-based decision support systems enable users to make informed decisions regarding the status of the water distribution network and perform effectively predictive and proactive maintenance.

Ecological change points: The strength of density dependence and the loss of history

2017 ◽  
Author(s):  
José M. Ponciano ◽  
Mark L. Taper ◽  
Brian Dennis
Keyword(s):  
Time Series ◽  
Population Dynamics ◽  
Density Dependence ◽  
Change Point ◽  
Likelihood Estimation ◽  
Theory And Practice ◽  
Change Points ◽  
Ecological Change ◽  
Proposed Model ◽  
Change Point Model

AbstractChange points in the dynamics of animal abundances have extensively been recorded in historical time series records. Little attention has been paid to the theoretical dynamic consequences of such change-points. Here we propose a change-point model of stochastic population dynamics. This investigation embodies a shift of attention from the problem of detecting when a change will occur, to another non-trivial puzzle: using ecological theory to understand and predict the post-breakpoint behavior of the population dynamics. The proposed model and the explicit expressions derived here predict and quantify how density dependence modulates the influence of the pre-breakpoint parameters into the post-breakpoint dynamics. Time series transitioning from one stationary distribution to another contain information about where the process was before the change-point, where is it heading and how long it will take to transition, and here this information is explicitly stated. Importantly, our results provide a direct connection of the strength of density dependence with theoretical properties of dynamic systems, such as the concept of resilience. Finally, we illustrate how to harness such information through maximum likelihood estimation for state-space models, and test the model robustness to widely different forms of compensatory dynamics. The model can be used to estimate important quantities in the theory and practice of population recovery.

Sign in / Sign up

Export Citation Format

Share Document