Clustering Then Estimation of Spatio-Temporal Self-Exciting Processes

被引:0
作者
Zhang, Haoting [1 ]
Zhan, Donglin [2 ]
Anderson, James [2 ]
Righter, Rhonda [1 ]
Zheng, Zeyu [1 ]
机构
[1] Univ Calif Berkeley, Ind Engn & Operat Res Dept, Berkeley, CA 94720 USA
[2] Columbia Univ, Dept Elect Engn, New York, NY 10027 USA
关键词
spatio-temporal self-exciting point process; maximum likelihood estimation; clustering algorithm; POINT-PROCESSES; MAXIMUM-LIKELIHOOD; PROCESS MODELS; CALL CENTER; POISSON PROCESSES; HAWKES PROCESSES; ALGORITHMS; LOCATION; SYSTEMS;
D O I
10.1287/ijoc.2022.0351
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
We propose a new estimation procedure for general spatio-temporal point processes that include a self-exciting feature. Estimating spatio-temporal self-exciting point processes with observed data is challenging, partly because of the difficulty in computing and optimizing the likelihood function. To circumvent this challenge, we employ a Poisson cluster representation for spatio-temporal self-exciting point processes to simplify the likelihood function and develop a new estimation procedure called "clustering-then-estimation" (CTE), which integrates clustering algorithms with likelihood-based estimation methods. Compared with the widely used expectation-maximization (EM) method, our approach separates the cluster structure inference of the data from the model selection. This has the benefit of reducing the risk of model misspecification. Our approach is computationally more efficient because it does not need to recursively solve optimization problems, which would be needed for EM. We also present asymptotic statistical results for our approach as theoretical support. Experimental results on several synthetic and real data sets illustrate the effectiveness of the proposed CTE procedure.
引用
收藏
页数:20
相关论文
共 102 条
[1]   A New Approach to Real-Time Bidding in Online Advertisements: Auto Pricing Strategy [J].
Adikari, Shalinda ;
Dutta, Kaushik .
INFORMS JOURNAL ON COMPUTING, 2019, 31 (01) :66-82
[2]  
Ahn D, 2023, Research paper
[3]  
[Anonymous], 2013, PMLR
[4]  
[Anonymous], 2003, INTRO THEORY POINT P
[5]   Application of Branching Models in the Study of Invasive Species [J].
Balderama, Earvin ;
Schoenberg, Frederic Paik ;
Murray, Erin ;
Rundel, Philip W. .
JOURNAL OF THE AMERICAN STATISTICAL ASSOCIATION, 2012, 107 (498) :467-476
[6]   How to Assign Scarce Resources Without Money: Designing Information Systems that Are Efficient, Truthful, and (Pretty) Fair [J].
Bichler, Martin ;
Hammerl, Alexander ;
Morrill, Thayer ;
Waldherr, Stefan .
INFORMATION SYSTEMS RESEARCH, 2021, 32 (02) :335-355
[7]   ST-DBSCAN: An algorithm for clustering spatial-temp oral data [J].
Birant, Derya ;
Kut, Alp .
DATA & KNOWLEDGE ENGINEERING, 2007, 60 (01) :208-221
[8]   Budget-constrained, capacitated hub location to maximize expected demand coverage in fixed-wireless telecommunication networks [J].
Bollapragada, Ramesh ;
Li, Yanjun ;
Rao, Uday S. .
INFORMS JOURNAL ON COMPUTING, 2006, 18 (04) :422-432
[9]   A Cluster-Based Context-Tree Model for Multivariate Data Streams with Applications to Anomaly Detection [J].
Brice, Pierre ;
Jiang, Wei ;
Wan, Guohua .
INFORMS JOURNAL ON COMPUTING, 2011, 23 (03) :364-376
[10]   Statistical analysis of a telephone call center: A queueing-science perspective [J].
Brown, L ;
Gans, N ;
Mandelbaum, A ;
Sakov, A ;
Shen, HP ;
Zeltyn, S ;
Zhao, L .
JOURNAL OF THE AMERICAN STATISTICAL ASSOCIATION, 2005, 100 (469) :36-50