Log in

Abstract

In this paper, we consider the problem of weakly consistent offline clustering of ARMA processes. Under the provided assumptions we derive a weakly consistent clustering algorithm of invertible ARMA processes according to their forecast functions. Using BIC penalized quasi-maximum likelihood estimate of the distance function the weak consistency of Algorithm 1 is proven when the target number of clusters is known. The theoretical lower bound of the clustering function is provided.

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

Access this article

Subscribe and save

Springer+ Basic
EUR 32.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or Ebook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

  1. S. Aghabozorgi, S. A. Shirkhorshidi, and T. Ying Wah, ‘‘Time-series clustering—A decade review,’’ J. Inf. Syst. 53, 16–38 (2015). https://doi.org/10.1016/j.is.2015.04.007

    Article  Google Scholar 

  2. A. Khaleghi, D. Ryabko, J. Mary, and P. Preux, ‘‘Consistent algorithms for clustering time series,’’ J. Mach. Learn. Res. 17 (3), 1–32 (2016).

    MathSciNet  MATH  Google Scholar 

  3. Q. Peng, N. Rao, and R. Zhao, ‘‘Covariance-based dissimilarity measures applied to clustering wide-sense stationary ergodic processes,’’ J. Mach. Learn. 108, 2159–2195 (2019). https://doi.org/10.1007/s10994-019-05818-x

    Article  MathSciNet  MATH  Google Scholar 

  4. R. Gray, Probability, Random Processes, and Ergodic Properties (Springer, New York, 1988). https://doi.org/10.1007/978-1-4419-1090-5

  5. Introduction to Time Series and Forecasting, Ed. by P. J. Brockwell and R. A. Davis, Springer Texts in Statistics (Springer, New York, 2002). https://doi.org/10.1007/b97391

  6. D. Piccolo, ‘‘A distance measure for classifying Arima models,’’ J. Time Ser. Anal. 11, 153–164 (1990). https://doi.org/10.1111/j.1467-9892.1990.tb00048.x

    Article  MATH  Google Scholar 

  7. M. Corduas and D. Piccolo, ‘‘Time series clustering and classification by the autoregressive metric,’’ Comput. Stat. Data Anal. 52, 1860–1872 (2008). https://doi.org/10.1016/j.csda.2007.06.001

    Article  MathSciNet  MATH  Google Scholar 

  8. J.-M. Bardet, K. Kamila, and W. Kengne, ‘‘Consistent model selection criteria and goodness-of-fit test for common time series models,’’ Electron. J. Stat. 14, 2009–2052 (2020). https://doi.org/10.1214/20-ejs1709.

    Article  MathSciNet  MATH  Google Scholar 

  9. E. J. Hannan, ‘‘The estimation of the order of an ARMA process,’’ Ann. Stat. 8, 1071–1081 (1980). https://doi.org/10.1214/aos/1176345144

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to G. L. Adamyan.

Ethics declarations

The author declares that he has no conflicts of interest.

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Adamyan, G.L. Weakly Consistent Offline Clustering of ARMA Processes. J. Contemp. Mathemat. Anal. 58, 183–190 (2023). https://doi.org/10.3103/S1068362323030020

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.3103/S1068362323030020

Keywords:

Navigation