Top-(R, K) Spatiotemporal Event Sequence Mining

摘要

Spatiotemporal event sequences (STESs) are the ordered series of event types whose evolving region-based instances frequently follow each other in time and are located closeby. Previous studies on STES mining require significance and prevalence thresholds for the discovery, which is usually unknown to domain experts. As the quality of the discovered STESs is of great importance to the domain experts who use these algorithms, we introduce a novel class of STES mining algorithms to discover the most relevant STESs without significance and prevalence thresholds. Our algorithms discover the top-K most prevalent spatiotemporal event sequences from R% most significant follow relationships. In the experiments, we conducted a case study using solar event datasets, and compared the performance of the algorithms and the relevance of the discovered sequences.