Testing complex temporal relationships involving multiple granularities and its application to data mining (extended abstract)

Cláudio Bettini, X. Sean Wang, Sushil Jajodia · 1996

) Claudio Bettini Dept. of Computer Science (DSI) University of Milan via Comelico 39, 20135 Milan, Italy [email protected] X. Sean Wang, Sushil Jajodia Dept. of Info.& Software Systems Eng. George Mason University Fairfax, VA 22030, USA fxywang, [email protected] Abstract An important usage of time sequences is for discovering temporal patterns of events (a special type of data mining). This process usually starts with the specification by the user of an event structure which consists of a number of variables representing events and temporal constraints among these variables. The goal of the data mining is to find temporal patterns, i.e., instantiations of the variables in the structure, which frequently appear in the time sequence. This paper introduces event structures that have temporal constraints with multiple granularities (TCGs). Testing the consistency of such structures is shown to be NP-hard. An approximate algorithm is then presented. The paper also introduces ...

Read the paper · More papers on PaperTik