A change-point detection and clustering method in the recurrent-event context

被引:6
|
作者
Li, Qing [1 ]
Yao, Kehui [2 ]
Zhang, Xinyu [3 ]
机构
[1] Iowa State Univ, Dept Ind & Mfg Syst Engn, 3031 Black Engn Bldg, Ames, IA 50011 USA
[2] Univ Wisconsin Madison, Dept Stat, 1220 Med Sci Ctr, Madison, WI USA
[3] North Carolina State Univ, Dept Stat, Raleigh, NC USA
关键词
K-means; maximum likelihood estimate; non-homogeneous Poisson process; parametric bootstrap; piecewise-constant intensity; BAYESIAN-ANALYSIS; MODEL; NUMBER; RISK;
D O I
10.1080/00949655.2020.1718149
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Change-point detection in the context of recurrent-event is a valuable analysis tool for the identification of the intensity rate changes. It has been an interesting topic in many fields, such as medical studies, travel safety analysis, etc. If subgroups exist, clustering can be incorporated into the change-point detection to improve the quality of the results. This paper develops a new algorithm named Recurrent-K-means to detect the change-points of the intensity rates and identify clusters of objects with recurrent events. It also proposes a test-based method to perform a heuristic search in determining the number of underlying clusters. In this study, the objects are assumed to fall in several clusters while the objects in the same cluster share identical change-points. The event count for an object is assumed to be a non-homogeneous Poisson process with a piecewise-constant intensity function. The methodology estimates the change-point as well as the intensity rates before and after the change-point for each cluster. The methodology establishes a clustering analysis based on K-means algorithm but enhances the procedure to be model based. The simulation study shows that the methodology performs well in parameter estimation and determination of the number of clusters in different scenarios. The methodology is applied to the UK coal mining disaster data to show its possible role in shaping government regulations and improving coal industry safety.
引用
收藏
页码:1131 / 1149
页数:19
相关论文
共 50 条
  • [1] Bayesian change-points detection assuming a power law process in the recurrent-event context
    Li, Qing
    Liu, Lijie
    Li, Tianqi
    Yao, Kehui
    [J]. COMMUNICATIONS IN STATISTICS-SIMULATION AND COMPUTATION, 2023, 52 (12) : 6011 - 6033
  • [2] Change-point detection based on adjusted shape context cost method
    Yan, Qijing
    Liu, Youbo
    Liu, Shuangzhe
    Ma, Tiefeng
    [J]. INFORMATION SCIENCES, 2021, 545 : 363 - 380
  • [3] An application of the likelihood method to change-point detection
    Gombay, E
    Horvath, L
    [J]. ENVIRONMETRICS, 1997, 8 (05) : 459 - 467
  • [4] An on-line change-point detection method
    Mboup, Mamadou
    Join, Cedric
    Fliess, Michel
    [J]. 2008 MEDITERRANEAN CONFERENCE ON CONTROL AUTOMATION, VOLS 1-4, 2008, : 1151 - +
  • [5] Online Seismic Event Picking via Sequential Change-Point Detection
    Li, Shuang
    Cao, Yang
    Leamon, Christina
    Xie, Yao
    Shi, Lei
    Song, WenZhan
    [J]. 2016 54TH ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING (ALLERTON), 2016, : 774 - 779
  • [6] Algebraic change-point detection
    Michel Fliess
    Cédric Join
    Mamadou Mboup
    [J]. Applicable Algebra in Engineering, Communication and Computing, 2010, 21 : 131 - 143
  • [7] Algebraic change-point detection
    Fliess, Michel
    Join, Cedric
    Mboup, Mamadou
    [J]. APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING, 2010, 21 (02) : 131 - 143
  • [8] Active Change-Point Detection
    Hayashi, Shogo
    Kawahara, Yoshinobu
    Kashima, Hisashi
    [J]. ASIAN CONFERENCE ON MACHINE LEARNING, VOL 101, 2019, 101 : 1017 - 1032
  • [9] Active change-point detection
    Hayashi, Shogo
    Kawahara, Yoshinobu
    Kashima, Hisashi
    [J]. Transactions of the Japanese Society for Artificial Intelligence, 2020, 35 (05) : 1 - 10
  • [10] FRECHET CHANGE-POINT DETECTION
    Dubey, Paromita
    Mueller, Hans-Georg
    [J]. ANNALS OF STATISTICS, 2020, 48 (06): : 3312 - 3335