IDEAS home Printed from https://ideas.repec.org/a/taf/tjbaxx/v2y2019i1p1-23.html
   My bibliography  Save this article

Tree-based methods for clustering time series using domain-relevant attributes

Author

Listed:
  • Mahsa Ashouri
  • Galit Shmueli
  • Chor-Yiu Sin

Abstract

We propose two methods for time-series clustering that capture temporal information (trend, seasonality, autocorrelation) and domain-relevant cross-sectional attributes. The methods are based on model-based partitioning (MOB) trees and can be used as automated yet transparent tools for clustering large collections of time series. We address the challenge of using common time-series models in MOB by instead utilising least squares regression. We propose two methods. The single-step method clusters series using trend, seasonality, lags and domain-relevant cross-sectional attributes. The two-step method first clusters by trend, seasonality and cross-sectional attributes, and then clusters the residuals by autocorrelation and domain-relevant attributes. Both methods produce clusters interpretable by domain experts. We illustrate our approach by considering one-step-ahead forecasting and compare to autoregressive integrated moving average (ARIMA) models for forecasting many Wikipedia pageviews time series. The tree-based approach produces forecasts on par with ARIMA, yet is significantly faster and more efficient, thereby suitable for large collections of time-series. The simple parametric forecasting models allow for interpretable time-series clusters.

Suggested Citation

  • Mahsa Ashouri & Galit Shmueli & Chor-Yiu Sin, 2019. "Tree-based methods for clustering time series using domain-relevant attributes," Journal of Business Analytics, Taylor & Francis Journals, vol. 2(1), pages 1-23, January.
  • Handle: RePEc:taf:tjbaxx:v:2:y:2019:i:1:p:1-23
    DOI: 10.1080/2573234X.2019.1645574
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/2573234X.2019.1645574
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/2573234X.2019.1645574?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Zhang, Bohan & Kang, Yanfei & Panagiotelis, Anastasios & Li, Feng, 2023. "Optimal reconciliation with immutable forecasts," European Journal of Operational Research, Elsevier, vol. 308(2), pages 650-660.
    2. Wellens, Arnoud P. & Udenio, Maxi & Boute, Robert N., 2022. "Transfer learning for hierarchical forecasting: Reducing computational efforts of M5 winning methods," International Journal of Forecasting, Elsevier, vol. 38(4), pages 1482-1491.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:taf:tjbaxx:v:2:y:2019:i:1:p:1-23. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/tjba .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.