Online common change-point detection in a set of nonstationary categorical time series

被引:2
|
作者
Leyli-Abadi, Milad [1 ,2 ]
Same, Allou [1 ]
Oukhellou, Latifa [1 ]
Cheifetz, Nicolas [3 ]
Mandel, Pierre [3 ]
Feliers, Cedric [3 ]
Heim, Veronique [4 ]
机构
[1] Univ Gustave Eiffel, IFSTTAR, COSYS, GRETTIA, Champs Sur Marne, France
[2] IRT SystemX, Saclay, France
[3] Veolia Eau DIle De France, Nanterre, France
[4] Syndicat Eaux dIle France, Paris, France
关键词
Change detection; Nonstationary categorical time series; Nonhomogeneous Markov models; Water consumption behavior; CONTROL CHARTS; COUNT DATA; LIKELIHOOD; MODEL;
D O I
10.1016/j.neucom.2021.01.066
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Categorical sequences are widely used in various domains to describe the evolutionary state of the process under study. This article addresses the problem of behavioral change detection for multiple categorical time series. Relying on the sequential likelihood ratio test, an online change detection method is proposed based on the joint modeling of all the categorical sequences. To model the joint probability density, a nonhomogeneous Markov model is used. It allows modeling the transition dynamics over time and considering their dependence on some exogenous factors that may influence the behavior changes. An adaptive threshold is learned using Monte Carlo simulations to detect different changes and reduce false alarms. The performance of the proposed method is evaluated using two real-world and four synthetic datasets. It is compared with two state-of-the-art change detection methods, namely logistic regression and homogeneous Markov model. The experimentation using synthetic datasets highlights the proposed method's effectiveness in terms of both the detection precision and the detection delay. The real-world data are issued from a water network and school-to-work transition. The analysis of the model estimated parameters allows us to characterize the detected changes in a real-world context. (c) 2021 Elsevier B.V. All rights reserved.
引用
收藏
页码:176 / 196
页数:21
相关论文
共 50 条
  • [1] Sequential change-point detection methods for nonstationary time series
    Choi, Hyunyoung
    Ombao, Hernando
    Ray, Bonnie
    [J]. TECHNOMETRICS, 2008, 50 (01) : 40 - 52
  • [2] Collaborated Online Change-point Detection in Sparse Time Series for Online Advertising
    Zhang, Jie
    Wei, Zhi
    Yan, Zhenyu
    Pani, Abhishek
    [J]. 2015 IEEE INTERNATIONAL CONFERENCE ON DATA MINING (ICDM), 2015, : 1099 - 1104
  • [3] Online Change-Point Detection in Sparse Time Series With Application to Online Advertising
    Zhang, Jie
    Wei, Zhi
    Yan, Zhenyu
    Zhou, MengChu
    Pani, Abhishek
    [J]. IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS, 2019, 49 (06): : 1141 - 1151
  • [4] An online Bayesian approach to change-point detection for categorical data
    Fan, Yiwei
    Lu, Xiaoling
    [J]. KNOWLEDGE-BASED SYSTEMS, 2020, 196
  • [5] Inference for nonstationary time series of counts with application to change-point problems
    Kengne, William
    Ngongo, Isidore S.
    [J]. ANNALS OF THE INSTITUTE OF STATISTICAL MATHEMATICS, 2022, 74 (04) : 801 - 835
  • [6] Inference for nonstationary time series of counts with application to change-point problems
    William Kengne
    Isidore S. Ngongo
    [J]. Annals of the Institute of Statistical Mathematics, 2022, 74 : 801 - 835
  • [7] Change-point detection for expected shortfall in time series
    Sun, Lingyu
    Li, Dong
    [J]. JOURNAL OF MANAGEMENT SCIENCE AND ENGINEERING, 2021, 6 (03) : 324 - 335
  • [8] Online change-point detection for a transient change
    Noonan, Jack
    [J]. STATISTICS AND ITS INTERFACE, 2023, 16 (02) : 163 - 179
  • [9] Online change-point detection with kernels
    Ferrari, Andre
    Richard, Cedric
    Bourrier, Anthony
    Bouchikhi, Ikram
    [J]. PATTERN RECOGNITION, 2023, 133
  • [10] Latent change-point detection in ordinal categorical data
    Wang, Junjie
    Ding, Dong
    Su, Qin
    [J]. QUALITY AND RELIABILITY ENGINEERING INTERNATIONAL, 2019, 35 (02) : 504 - 516