Skip to main content
SpringerLink
Log in

Discussion of ‘Detecting possibly frequent change-points: wild binary segmentation 2 and steepest-drop model selection’

  • Discussion
  • Published:
Journal of the Korean Statistical Society Aims and scope Submit manuscript

A Reply to this article was published on 16 September 2020

The Original Article was published on 02 March 2020

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

References

  • Baranowski, R., Chen, Y., & Fryzlewicz, P.. (2019). Narrowest-over-threshold detection of multiple change points and change-point-like features. Journal of the Royal Statistical Society: Series B (Statistical Methodology), 81(3), 649–672.

    Article  MathSciNet  Google Scholar 

  • Fryzlewicz, P. (2020). Detecting possibly frequent change-points: Wild binary segmentation 2 and steepest-drop model selection. Journal of the Korean Statistical Society. https://doi.org/10.1007/s42952-020-00060-x.

    Article  Google Scholar 

  • Fryzlewicz, P., et al. (2014). Wild binary segmentation for multiple change-point detection. The Annals of Statistics, 42(6), 2243–2281.

    Article  MathSciNet  Google Scholar 

  • Kovács, S., Li, H., Bühlmann, P., & Munk, A. (2020). Seeded binary segmentation: A general methodology for fast and optimal change point detection. arXiv preprint arXiv:2002.06633. Accessed 1 June 2020.

  • Lan, Y., Banerjee, M., Michailidis, G., et al. (2009). Change-point estimation under adaptive sampling. The Annals of Statistics, 37(4), 1752–1791.

    Article  MathSciNet  Google Scholar 

  • Lu, Z., Banerjee, M., & Michailidis, G. (2020.) Intelligent sampling for multiple change-points in exceedingly long time series with rate guarantees. arXiv preprint arXiv:1710.07420. Accessed 1 June 2020.

  • Mallik, A., Banerjee, M., & Michailidis, G. (2020). M-estimation in multistage sampling procedures. Sankhya A,. https://doi.org/10.1007/s13171-019-00194-z.

    Article  MathSciNet  Google Scholar 

  • Tang, R., Banerjee, M., Michailidis, G., & Mankad, S. (2015). Two-stage plans for estimating the inverse of a monotone function. Technometrics, 57(3), 395–407.

    Article  MathSciNet  Google Scholar 

  • Wang, D., Yu, Y., & Rinaldo, A. (2018). Optimal change point detection and localization in sparse dynamic networks. arXiv preprint arXiv:1809.09602. Accessed 1 June 2020.

Download references

Author information

Authors and Affiliations

  1. University of Michigan, Ann Arbor, MI, United States

    Moulinath Banerjee

Authors
  1. Moulinath Banerjee
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Moulinath Banerjee.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

This article refers to the article available online at https://doi.org/10.1007/s42952-020-00060-x.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Banerjee, M. Discussion of ‘Detecting possibly frequent change-points: wild binary segmentation 2 and steepest-drop model selection’. J. Korean Stat. Soc. 49, 1071–1075 (2020). https://doi.org/10.1007/s42952-020-00079-0

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s42952-020-00079-0

Search

Navigation