scholarly journals Forecasting and Estimating Multiple Change-Point Models with an Unknown Number of Change Points

2004 ◽  
Author(s):  
Simon Potter ◽  
Gary M. Koop
Keyword(s):  
Change Point ◽  
Change Points ◽  
Unknown Number ◽  
Change Point Models

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 Timing of onset and rate of decline in learning and retention in the pre-dementia phase of Alzheimer’s disease

2019 ◽  
Vol 25 (7) ◽  
pp. 699-705 ◽  
Author(s):  
Ellen Grober ◽  
Yang An ◽  
Richard B. Lipton ◽  
Claudia Kawas ◽  
Susan M. Resnick
Keyword(s):  
Alzheimer’S Disease ◽  
Alzheimer's Disease ◽  
Free Recall ◽  
Change Point ◽  
Change Points ◽  
Immediate Recall ◽  
Initial Learning ◽  
Rate Of Decline ◽  
Change Point Models ◽  
Selective Reminding Test

AbstractObjective: To examine trajectories of declines in learning and retention during the predementia phase of Alzheimer’s disease (AD) using the picture version of the Free and Cued Selective Reminding Test with Immediate Recall (pFCSRT+IR). Method: Learning was defined by the sum of free recall over three test trials. Retention was defined in two ways: by delayed free recall (DFR) and by savings; DFR adjusted for learning. The performances of 217 incident AD cases from the Baltimore Longitudinal Study of Aging (BLSA) were aligned based on the time that AD was first diagnosed. The predementia phase of learning and retention decline was assessed using change point models in which cognitive trajectories are described by a series of linear components with knots delineating times of accelerating decline. Results: Trajectories for both learning and DFR had two change points: the first at 6.58 (95% confidence intervals (CI): 6.56, 6.60) to 7.29 (95% CI: 6.13, 8.46) years before diagnosis followed by gradual decline over the next 4 years, and a second acceleration of decline 1.89 (0.56, 3.24) to 2.93 (95% CI: 1.56, 4.30) years before diagnosis. The change points for DFR were not significantly earlier in the predementia phase than the change points for learning. Savings had one change point, 5.3 (95% CI: 3.56, 7.04) years before diagnosis. Conclusion: Both learning and DFR showed similar profiles of decline in the years prior to the clinical diagnosis of AD. When delayed recall was adjusted for initial learning, the measure was less sensitive to early disease. (JINS, 2019, 25, 699–705)

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 Bayesian Online Learning of the Hazard Rate in Change-Point Problems

2010 ◽  
Vol 22 (9) ◽  
pp. 2452-2476 ◽  
Author(s):  
Robert C. Wilson ◽  
Matthew R. Nassar ◽  
Joshua I. Gold
Keyword(s):  
Change Point ◽  
Stock Price ◽  
Hazard Rate ◽  
Real Data ◽  
Generative Models ◽  
Ideal Observer ◽  
Change Points ◽  
Brain State ◽  
Observer Model ◽  
Change Point Models

Change-point models are generative models of time-varying data in which the underlying generative parameters undergo discontinuous changes at different points in time known as change points. Change-points often represent important events in the underlying processes, like a change in brain state reflected in EEG data or a change in the value of a company reflected in its stock price. However, change-points can be difficult to identify in noisy data streams. Previous attempts to identify change-points online using Bayesian inference relied on specifying in advance the rate at which they occur, called the hazard rate (h). This approach leads to predictions that can depend strongly on the choice of h and is unable to deal optimally with systems in which h is not constant in time. In this letter, we overcome these limitations by developing a hierarchical extension to earlier models. This approach allows h itself to be inferred from the data, which in turn helps to identify when change-points occur. We show that our approach can effectively identify change-points in both toy and real data sets with complex hazard rates and how it can be used as an ideal-observer model for human and animal behavior when faced with rapidly changing inputs.

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.

Testing for long memory in the presence of a general trend

2001 ◽  
Vol 38 (04) ◽  
pp. 1033-1054 ◽  
Author(s):  
Liudas Giraitis ◽  
Piotr Kokoszka ◽  
Remigijus Leipus
Keyword(s):  
Long Memory ◽  
Change Point ◽  
General Trend ◽  
Quantitative Description ◽  
Stationary Sequence ◽  
Change Points ◽  
Asymptotic Size ◽  
Short Memory ◽  
The Impact ◽  
Do So

The paper studies the impact of a broadly understood trend, which includes a change point in mean and monotonic trends studied by Bhattacharyaet al.(1983), on the asymptotic behaviour of a class of tests designed to detect long memory in a stationary sequence. Our results pertain to a family of tests which are similar to Lo's (1991) modifiedR/Stest. We show that both long memory and nonstationarity (presence of trend or change points) can lead to rejection of the null hypothesis of short memory, so that further testing is needed to discriminate between long memory and some forms of nonstationarity. We provide quantitative description of trends which do or do not fool theR/S-type long memory tests. We show, in particular, that a shift in mean of a magnitude larger thanN-½, whereNis the sample size, affects the asymptotic size of the tests, whereas smaller shifts do not do so.

Sign in / Sign up

Export Citation Format

Share Document