| 界标窗口数据流频繁模式挖掘特性 |
| |
| 引用本文： | 张广路,雷景生.界标窗口数据流频繁模式挖掘特性[J].计算机工程与应用,2011,47(10):131-134. |
| |
| 作者姓名： | 张广路 雷景生 |
| |
| 作者单位： | 1.海南师范大学 数学与统计学院，海口 571158 2.南京邮电大学 计算机学院，南京 210046 |
| |
| 基金项目： | 海南省自然科学基金，海南省教育厅高等学校科学研究项目，海南师范大学青年科学基金 |
| |
| 摘 要： | 随着数据流应用领域的不断扩大，数据流频繁模式挖掘技术逐渐成为数据挖掘领域研究的核心问题。对DSFPM算法进行研究和改进，提出了一种基于界标窗口的数据流频繁模式挖掘算法DSMFP_LW。该算法实现了单边扫描数据流；利用扩展的前缀模式树存储全局临界频繁模式，实现数据增量更新。通过对比实验，结果证明DSMFP_LW算法有较好的时间开销和空间利用率，优于经典的Lossy Counting算法，适合数据流频繁模式挖掘。
|
| 关 键 词： | 频繁模式 数据流 DSMFP_LW算法 |
| 修稿时间： | |
Characteristics of data stream mining for frequent pattern based on landmark window |
| |
| ZHANG Guanglu,LEI Jingsheng.Characteristics of data stream mining for frequent pattern based on landmark window[J].Computer Engineering and Applications,2011,47(10):131-134. |
| |
| Authors: | ZHANG Guanglu LEI Jingsheng |
| |
| Affiliation: | 1，College of Mathematics and Statistic，Hainan Normal University，Haikou 571158，China 2.College of Computer Science，Nanjing University of Post and Telecommunicatios，Nanjing 210046，China |
| |
| Abstract: | Data stream with the expanding applications,mining frequent pattern over data stream has gradually become the core issue in the field of data mining research.Based on the study and improvement of the DSFPM algorithm,a new single-pass algorithm,Data Stream Mining for Frequent Pattern Based on Landmark Window（DSMFP_LM）,is proposed. DSMFP_LW has major features：Single streaming data scan for counting pattern’s information,extended prefix-tree-based compact pattern representation,and incremental update of data.The experimental results show that DSMFP_LW algorithm has better utilization of time and space efficiency,in addition,the well-known algorithm （Lossy Counting） is outperformed in the same streaming environment. |
| |
| Keywords: | frequent pattern data stream DSMFP_LW algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程与应用》浏览原始摘要信息 |
|
点击此处可从《计算机工程与应用》下载全文 |
