Continuously Matching Episode Rules for Predicting Future Events over Event Streams
暂无分享,去创建一个
[1] Jan Chomicki,et al. History-less checking of dynamic integrity constraints , 1992, [1992] Eighth International Conference on Data Engineering.
[2] Heikki Mannila,et al. Discovery of Frequent Episodes in Event Sequences , 1997, Data Mining and Knowledge Discovery.
[3] Ambuj K. Singh,et al. Closure-Tree: An Index Structure for Graph Queries , 2006, 22nd International Conference on Data Engineering (ICDE'06).
[4] Dennis Shasha,et al. GraphGrep: A fast and universal method for querying graphs , 2002, Object recognition supported by user interaction for service robots.
[5] Arbee L. P. Chen,et al. Discovering Frequent Tree Patterns over Data Streams , 2006, SDM.
[6] Kai Hwang,et al. Frequent episode rules for Internet anomaly detection , 2004, Third IEEE International Symposium on Network Computing and Applications, 2004. (NCA 2004). Proceedings..
[7] Heikki Mannila,et al. Discovering Frequent Episodes in Sequences , 1995, KDD.
[8] Sudarshan S. Chawathe,et al. XPath queries on streaming data , 2003, SIGMOD '03.
[9] Jiawei Han,et al. gSpan: graph-based substructure pattern mining , 2002, 2002 IEEE International Conference on Data Mining, 2002. Proceedings..
[10] François Bry,et al. An evaluation of regular path expressions with qualifiers against XML streams , 2003, Proceedings 19th International Conference on Data Engineering (Cat. No.03CH37405).