TY - GEN
T1 - Continuously Predicting the Completion of a Time Intervals Related Pattern
AU - Itzhak, Nevo
AU - Jaroszewicz, Szymon
AU - Moskovitch, Robert
N1 - Publisher Copyright: © 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.
PY - 2023/1/1
Y1 - 2023/1/1
N2 - In various domains, such as meteorology or patient data, events’ durations are stored in a database, resulting in symbolic time interval (STI) data. Additionally, using temporal abstraction techniques, time point series can be transformed into STI data. Mining STI data for frequent time intervals-related patterns (TIRPs) was studied in recent decades. However, for the first time, we explore here how to continuously predict a TIRP’s completion, which can be potentially applied with patterns that end with an event of interest, such as a medical complication, for its prediction. The main challenge in performing such a completion prediction occurs when the time intervals are coinciding, but not finished yet, which introduces an uncertainty in the evolving temporal relations, and thus on the TIRP’s evolution process. In this study, we introduce a new structure to overcome this challenge and several continuous prediction models (CPMs). In the segmented CPM (SCPM), the completion probability depends only on the pattern’s STIs’ starting and ending points, while a machine learning-based CPM (CPML) incorporates the duration between the pattern’s STIs’ beginning and end times. Our experiment shows that overall, CPML based on an ANN performed better than the other CPMs, but CPML based on NB or RF provided the earliest predictions.
AB - In various domains, such as meteorology or patient data, events’ durations are stored in a database, resulting in symbolic time interval (STI) data. Additionally, using temporal abstraction techniques, time point series can be transformed into STI data. Mining STI data for frequent time intervals-related patterns (TIRPs) was studied in recent decades. However, for the first time, we explore here how to continuously predict a TIRP’s completion, which can be potentially applied with patterns that end with an event of interest, such as a medical complication, for its prediction. The main challenge in performing such a completion prediction occurs when the time intervals are coinciding, but not finished yet, which introduces an uncertainty in the evolving temporal relations, and thus on the TIRP’s evolution process. In this study, we introduce a new structure to overcome this challenge and several continuous prediction models (CPMs). In the segmented CPM (SCPM), the completion probability depends only on the pattern’s STIs’ starting and ending points, while a machine learning-based CPM (CPML) incorporates the duration between the pattern’s STIs’ beginning and end times. Our experiment shows that overall, CPML based on an ANN performed better than the other CPMs, but CPML based on NB or RF provided the earliest predictions.
KW - continuous prediction
KW - early prediction
KW - temporal patterns
UR - http://www.scopus.com/inward/record.url?scp=85173566859&partnerID=8YFLogxK
U2 - https://doi.org/10.1007/978-3-031-33374-3_19
DO - https://doi.org/10.1007/978-3-031-33374-3_19
M3 - Conference contribution
SN - 9783031333736
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 239
EP - 251
BT - Advances in Knowledge Discovery and Data Mining - 27th Pacific-Asia Conference on Knowledge Discovery and Data Mining, PAKDD 2023, Proceedings
A2 - Kashima, Hisashi
A2 - Ide, Tsuyoshi
A2 - Peng, Wen-Chih
PB - Springer Science and Business Media Deutschland GmbH
T2 - 27th Pacific-Asia Conference on Knowledge Discovery and Data Mining, PAKDD 2023
Y2 - 25 May 2023 through 28 May 2023
ER -