A Least Squares Method for Detecting Multiple Change Points in a Univariate Time Series

Author(s):  
Kyu S. Hahn ◽  
Won Son ◽  
Hyungwon Choi ◽  
Johan Lim
1973 ◽  
Vol 5 (02) ◽  
pp. 217-241 ◽  
Author(s):  
A. M. Walker

Let observations (X 1, X 2, …, Xn ) be obtained from a time series {Xt } such that where the ɛt are independently and identically distributed random variables each having mean zero and finite variance, and the gu (θ) are specified functions of a vector-valued parameter θ. This paper presents a rigorous derivation of the asymptotic distributions of the estimators of A, B, ω and θ obtained by an approximate least-squares method due to Whittle (1952). It is a sequel to a previous paper (Walker (1971)) in which a similar derivation was given for the special case of independent residuals where gu (θ) = 0 for u > 0, the parameter θ thus being absent.


1995 ◽  
Vol 52 (20) ◽  
pp. 3501-3511 ◽  
Author(s):  
Dong L. Wu ◽  
Paul B. Hays ◽  
Wilbert R. Skinner

2015 ◽  
Vol 27 (5) ◽  
pp. 543-551 ◽  
Author(s):  
Akio Namiki ◽  
◽  
Fumiyasu Takahashi

<div class=""abs_img""> <img src=""[disp_template_path]/JRM/abst-image/00270005/11.jpg"" width=""300"" /> Defensive motion against attack</div> In this paper, we discuss how to generate defensive motions for a sword-fighting robot based on quick detection of the opposite player’s initial motions. Our sword-fighting robot system, which has a stereo high-speed vision system, recognizes both the position of a human player and that of the sword grasped by the robot’s hand. Further, it detects the moment when the human player initiates a move using ChangeFinder, which is a method of detecting change points. Next, using least squares method, it predicts the possible trajectories of the sword of the human player from the moment when the attack starts. Finally, it judges the type of the attack and generates an appropriate defensive motion. The effectiveness of the proposed algorithm is verified by experimental results. </span>


2014 ◽  
Vol 490 ◽  
pp. 012040
Author(s):  
Cyril Voyant ◽  
Wani Tamas ◽  
Christophe Paoli ◽  
Aurélia Balu ◽  
Marc Muselli ◽  
...  

2003 ◽  
Vol 13 (11) ◽  
pp. 3307-3323 ◽  
Author(s):  
VALKO PETROV ◽  
JUERGEN KURTHS ◽  
NIKOLA GEORGIEV

This paper treats a problem of reconstructing ordinary differential equation from a single analytic time series with observational noise. We suppose that the noise is Gaussian (white). The investigation is presented in terms of classical theory of dynamical systems and modern time series analysis. We restrict our considerations on time series obtained as a numerical analytic solution of autonomous ordinary differential equation, solved with respect to the highest derivative and with polynomial right-hand side. In case of an approximate numerical solution with a rather small error, we propose a geometrical basis and a mathematical algorithm to reconstruct a low-order and low-power polynomial differential equation. To reduce the noise the given time series is smoothed at every point by moving polynomial averages using the least-squares method. Then a specific form of the least-squares method is applied to reconstruct the polynomial right-hand side of the unknown equation. We demonstrate for monotonous, periodic and chaotic solutions that this technique is very efficient.


1981 ◽  
Vol 18 (03) ◽  
pp. 617-627 ◽  
Author(s):  
Tuan Dinh Pham ◽  
Lanh Tat Tran

The paper investigates some properties of the first-order bilinear time series model: stationarity and invertibility. Estimates of the parameters are obtained by a modified least squares method and shown to be strongly consistent.


1993 ◽  
Vol 03 (03) ◽  
pp. 797-802
Author(s):  
R. WAYLAND ◽  
D. PICKETT ◽  
D. BROMLEY ◽  
A. PASSAMANTE

The effect of the chosen forecasting method on the measured predictability of a noisy recurrent time series is investigated. Situations where the length of the time series is limited, and where the level of corrupting noise is significant are emphasized. Two simple prediction methods based on explicit nearest-neighbor averages are compared to a more complicated, and computationally expensive, local linearization technique based on the method of total least squares. The comparison is made first for noise-free, and then for noisy time series. It is shown that when working with short time series in high levels of additive noise, the simple prediction schemes perform just as well as the more sophisticated total least squares method.


Sign in / Sign up

Export Citation Format

Share Document