Discovery of frequent episodes in event sequences

被引:847
作者
Mannila, H [1 ]
Toivonen, H [1 ]
Verkamo, AI [1 ]
机构
[1] Univ Helsinki, Dept Comp Sci, FIN-00014 Helsinki, Finland
关键词
event sequences; frequent episodes; sequence analysis;
D O I
10.1023/A:1009748302351
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Sequences of events describing the behavior and actions of users or systems can be collected in several domains. An episode is a collection of events that occur relatively close to each other in a given partial order. We consider the problem of discovering frequently occurring episodes in a sequence. Once such episodes are known, one can produce rules for describing or predicting the behavior of the sequence. We give efficient algorithms for the discovery of all frequent episodes from a given class of episodes, and present detailed experimental results. The methods are in use in telecommunication alarm management.
引用
收藏
页码:259 / 289
页数:31
相关论文
共 34 条
[1]  
Agrawal R., 1993, SIGMOD Record, V22, P207, DOI 10.1145/170036.170072
[2]  
AGRAWAL R, 1995, PROC INT CONF DATA, P3, DOI 10.1109/ICDE.1995.380415
[3]  
Agrawal R., 1996, Adv. Knowl. Discov. Data Min, P307
[4]  
[Anonymous], 1995, P 1 SIGKDD INT C KNO
[5]  
Bettini C., 1996, Proceedings of the Fifteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems. PODS 1996, P68, DOI 10.1145/237661.237680
[6]  
Das G., 1997, P 8 ANN S COMB PATT, P12
[7]   WORKING SET MODEL FOR PROGRAM BEHAVIOR [J].
DENNING, PJ .
COMMUNICATIONS OF THE ACM, 1968, 11 (05) :323-&
[8]  
Dousson C., 1993, P INT JOINT C ART IN, P166
[10]  
GEHANI NH, 1992, PROC INT CONF VERY L, P327