On Robust Clustering of Temporal Point Process
Not on the map. Why?
Abstract (arXiv)
Clustering of event stream data is of great importance in many application scenarios, including but not limited to, e-commerce, electronic health, online testing, mobile music service, etc. Existing clustering algorithms fail to take outlier data into consideration and are implemented without theoretical guarantees. In this paper, we propose a robust temporal point processes clustering framework which works under mild assumptions and meanwhile addresses several important issues in the event stream clustering problem.Specifically, we introduce a computationally efficient model-free distance function to quantify the dissimilarity between different event streams so that the outliers can be detected and the good initial clusters could be obtained. We further consider an expectation-maximization-type algorithm incorporated with a Catoni's influence function for robust estimation and fine-tuning of clusters. We also establish the theoretical results including algorithmic convergence, estimation error bound, outlier detection, etc. Simulation results corroborate our theoretical findings and real data applications show the effectiveness of our proposed methodology.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). First posted on arXiv 28 May 2024.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2025: 1.
1 paper.
- 2025Learning under Commission and Omission Event Outlierscited by 0
- 2025Learning under Commission and Omission Event Outliers23 Jan 2025