计算机工程2012，Vol.38Issue(1)：55-58,61,5.DOI:10.3969/j.issn.1000-3428.2012.01.014
界标窗口中数据流频繁模式挖掘算法研究
Research on Data Stream Frequent Pattern Mining Algorithm in Landmark Window
摘要
Abstract
For data traffic flow is too large to store the entire data stream or on its scan times and other issues, through the research of algorithms on mining frequent patterns that are proposed, this paper proposes an algorithm on mining frequent patterns over data stream based on Landmark window, named DSMFP_LW. DSMFP_LW has major features as follows: namely single streaming data scan for counting pattern's information, extended prefix-tree-based compact pattern representation, and incremental update of data. Experimental results show that DSMFP_LW algorithm has better utilization of time and space efficiency, In addition, it outperforms the well-known algorithm Lossy Counting in the same streaming environment.关键词
界标窗口/频繁模式/数据流/DSMFP_LW算法/滑动窗口Key words
landmark window/ frequent pattern/ data stream/ DSMFPJLW algorithm/ sliding window分类
信息技术与安全科学引用本文复制引用
张广路,雷景生,吴兴惠..界标窗口中数据流频繁模式挖掘算法研究[J].计算机工程,2012,38(1):55-58,61,5.基金项目
海南省自然科学基金资助项目(610221,109002,808155) （610221,109002,808155）
海南师范大学青年科研基金资助项目(QN0923) （QN0923）
