［1］Agrawal R, Imielinski T, Swami A. Mining association rules between sets of items in large databases［C］ Proc of the 19th ACM SIGMOD Int Conf on Management of Data. New York: ACM, 1993: 207216［2］Agrawal R, Srikant R. Fast algorithms for mining association rules［C］ Proc of the 20th Int Conf on Very Large Data Bases. San Francisco, CA: Morgan Kaufamn, 1994: 487499［3］Pei J, Han J, Mortazaviasl B, et al. Prefix Span: Mining sequential patterns efficiently by prefixprojected pattern growth［C］ Proc of the 17th Int Conf on Data Engineering. Los Alamitos, CA: IEEE Computer Society, 2001: 215224［4］Tatti N, Vreeken J. The long and the short of it: Summarising event sequences with serial episodes［C］ Proc of ACM SIGKDD Int Conf on Knowledge Discovery and Data Mining. New York: ACM, 2012: 462470［5］Avinash A. A unified view of the aprioribased algorithms for frequent episode discovery［J］. Knowledge and Information Systems, 2012, 31(2): 223250［6］Huang K Y, Chang C H. Efficient mining of frequent episodes from complex sequences［J］. Information Systems, 2008, 33(1): 96114［7］Ao Xiang, Luo Ping, Li Chengkai, et al. Online frequent episode mining［C］ Proc of the 31st IEEE Int Conf on Data Engineering. Piscataway, NJ: IEEE, 2015: 891902［8］Laxman S, Sastry P S, Unnikrishnan K P. A fast algorithm for finding frequent episodes in event streams［C］ Proc of the 13th ACM SIGKDD Int Conf on Knowledge Discovery and Data Mining. New York: ACM, 2007: 410419［9］Li H, Peng S, Li J, et al. Counting the frequency of timeconstrained serial episodes in a streaming sequence［J］. Information Sciences, 2019, 505: 422439［10］李健, 李辉, 崔江涛. 一种带时间约束的信号序列频繁情节挖掘方法: 中国, CN201610392424.6［P］. 20190503
|
