Bit Stream Oriented Enumeration Tree Pruning Algorithm
Bit Stream Oriented Enumeration Tree Pruning Algorithm
QIU Wei-dong 1(邱卫东), JIN Ling1 (金 凌), YANG Xiao-niu 2(杨小牛), YANG Hong-wa 2(杨红娃)
(1. School of Information Security Engineering, Shanghai Jiaotong University,
Shanghai 200240, China;
2. National Science and Technology on Communication Information
Security Control Laboratory, No. 36 Institute of China Electronics Technology Group Corporation, Jiaxing 314033, Zhejiang, China)
(1. School of Information Security Engineering, Shanghai Jiaotong University,
Shanghai 200240, China;
2. National Science and Technology on Communication Information
Security Control Laboratory, No. 36 Institute of China Electronics Technology Group Corporation, Jiaxing 314033, Zhejiang, China)
(1. School of Information Security Engineering, Shanghai Jiaotong University,
Shanghai 200240, China;
2. National Science and Technology on Communication Information
Security Control Laboratory, No. 36 Institute of China Electronics Technology Group Corporation, Jiaxing 314033, Zhejiang, China)
QIU Wei-dong (邱卫东), JIN Ling (金 凌), YANG Xiao-niu (杨小牛), YANG Hong-wa (杨红娃). Bit Stream Oriented Enumeration Tree Pruning Algorithm [J]. Journal of shanghai Jiaotong University (Science), 2011, 16(5): 567-570.
[1] Hume A, Sunday D. Fast string searching [J]. Software: Practice and Experience, 1991, 21(11), 1221-1248.[2] Knuth D E, Pratt V R. Fast pattern matching in strings [J]. SIAM Journal on Computing, 1977, 6(2): 323-350.[3] Aho A V, Corasick M J. Efficient string matching: An aid tobibliographic search [J]. Communications of the ACM, 1975, 18(6): 333-340.[4] Han J, Pei J, Yin Y, et al. Mining frequent patterns without candidategeneration [J]. Data Mining and Knowledge Discovery, 2004, 8(1): 53-87.[5] Agrawal R, Mielinsk T, Swami A. Mining association rules between sets ofitems in large databases [C]// Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data. New York , USA: ACM Press, 1993: 207-216.