Mining features for sequence classification
KDD '99 Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining
Discovery of Frequent Episodes in Event Sequences
Data Mining and Knowledge Discovery
ICDE '95 Proceedings of the Eleventh International Conference on Data Engineering
Fast Algorithms for Mining Association Rules in Large Databases
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
An Updated Bibliography of Temporal, Spatial, and Spatio-temporal Data Mining Research
TSDM '00 Proceedings of the First International Workshop on Temporal, Spatial, and Spatio-Temporal Data Mining-Revised Papers
Constraint-based mining of episode rules and optimal window sizes
PKDD '04 Proceedings of the 8th European Conference on Principles and Practice of Knowledge Discovery in Databases
Discovering Frequent Episodes and Learning Hidden Markov Models: A Formal Connection
IEEE Transactions on Knowledge and Data Engineering
Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing)
Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing)
Mining Nonambiguous Temporal Patterns for Interval-Based Events
IEEE Transactions on Knowledge and Data Engineering
Frequent pattern mining: current status and future directions
Data Mining and Knowledge Discovery
An inductive database for mining temporal patterns in event sequences
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Hi-index | 0.00 |
Discovering temporal patterns from sequence data has been an important task of data mining in recent years. In this paper a novel temporal pattern, Intervention , is proposed to capture the partial ordering relations in parallel event sequences. It is demonstrated that Intervention is essentially a deviation of generalized Markov property holding in parallel event sequences. A measure to evaluate the degree of such deviation, Intervention Intensity , is suggested, which has an important mathematical property, non-symmetry. As a result, an algorithm called MIPES for mining interventions is proposed. The time complexity of MIPES is of O (m 2) and is independent of data size, where m is the number of event types and is far smaller than the data size in practice. The experimental results show MIPES is applicable and scalable.