Skip to main content
Log in

A binary tree algorithm on change points detection

  • Published:
Quality & Quantity Aims and scope Submit manuscript

Abstract

In this paper, an algorithm using binary trees is developed to detect the change points of a data set in which the data are assumed to be normally distributed. Usual BIC-type criteria are considered in the binary searching procedures when the number of change points is unknown. The algorithm is also extended to the switching regression models. Simulation study confirms that our algorithm is efficient compared with the ML-method. A real data example also verifies that the proposed procedure is appropriate.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • Chen J., Gupta A.K.: Information-theoretic approach for detecting change in the parameters of a normal model. Math. Methods Stat. 12, 116–130 (2003)

    Google Scholar 

  • Chin Choy J.H., Broemeling L.D.: Some Bayesian inferences for a changing linear model. Technometrics 22, 71–78 (1980)

    Article  Google Scholar 

  • Draper N.R., Smith H.: Applied Regression Analysis. Wiley, New York (1998)

    Google Scholar 

  • Hawkins D.M.: Point estimation of the parameters of piecewise regression models. Appl. Stat. 25, 51–57 (1976)

    Article  Google Scholar 

  • Holbert D.: A Bayesian analysis of a switching linear model. J. Econ. 19, 77–87 (1982)

    Google Scholar 

  • Horváth L., Hušková M., Serbinowska M.: Estimators for the time of change in linear models. Statistics 29, 109–130 (1997)

    Article  Google Scholar 

  • Jandhyala V.K., MacNeill I.B.: Test for parameter changes at unknown times in linear regression models. J. Stat. Plan. Inference 27, 291–316 (1991)

    Article  Google Scholar 

  • Lee C.B.: Estimating the number of change points in a sequence of independent normal random variables. Stat. Probab. Lett. 25, 241–248 (1995)

    Article  Google Scholar 

  • Maguire B.A., Person E.S., Wynn A.H.A.: The time intervals between industrial accidents. Biometrika 39, 168–180 (1652)

    Google Scholar 

  • Maronna R., Yohai V.J.: A bivariate test for the detection of a systematic change in mean. J. Am. Stat. Assoc. 73, 640–645 (1978)

    Article  Google Scholar 

  • Page E.S.: Continuous inspection schemes. Biometrika 41, 100–114 (1954)

    Google Scholar 

  • Page E.S.: A test for a change in a parameter occurring at an unknown point. Biometrika 42, 523–527 (1955)

    Google Scholar 

  • Schwarz G.: Estimating the dimension of a model. Ann. Stat. 6, 461–464 (1978)

    Article  Google Scholar 

  • Worsley K.J.: Confidence regions and tests for a change-point in a sequence of exponential family random variable. Biometrika 73, 91–104 (1986)

    Article  Google Scholar 

  • Yao Y.C.: Estimating the number of change-point via Schwarz’ criterion. Stat. Probab. Lett. 6, 181–198 (1988)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Tsai-Hung Fan.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Fan, TH., Hsieh, HJ. & Lee, HH. A binary tree algorithm on change points detection. Qual Quant 45, 599–608 (2011). https://doi.org/10.1007/s11135-010-9316-x

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11135-010-9316-x

Keywords

Navigation