| SWFPM:一种有效的数据流频繁项挖掘算法 |
| |
| 引用本文： | 邝祝芳,阳国贵,辛动军. SWFPM:一种有效的数据流频繁项挖掘算法[J]. 计算机应用研究, 2009, 26(2): 466-469 |
| |
| 作者姓名： | 邝祝芳 阳国贵 辛动军 |
| |
| 作者单位： | 中南林业科技大学,计算机科学学院,长沙,410004;国防科学技术大学,计算机学院,长沙,410073 |
| |
| 基金项目： | 国家自然科学基金资助项目(6057057）；中南林业科技大学引进高层次人才科研启动基金资助项目（07Y007,07Y004）；中南林业科技大学青年基金资助项目(2008041B) |
| |
| 摘 要： | 分析了数据流频繁项挖掘算法EC的不足之处,如不能准确地挖掘最近一段时间内数据流的频繁项。提出了一种频繁项样本特征复合四元组的数据结构来保存样本集合,在此基础上,提出了一种基于滑动窗口的数据流频繁项挖掘算法——SWFPM。该算法能准确地挖掘出该滑动窗口中的频繁项。实验数据采用IBM合成数据发生器产生的顾客购物数据和1998年世界杯官方网站的访问日志数据。实验结果表明,该算法具有很高的频繁项挖掘准确度、快速的数据处理能力。
|
| 关 键 词： | 数据流 数据挖掘 频繁项 滑动窗口 |
SWFPM:efficient algorithm for mining frequent item over data streams |
| |
| KUANG Zhu-fang,YANG Guo-gui,XIN Dong-jun. SWFPM:efficient algorithm for mining frequent item over data streams[J]. Application Research of Computers, 2009, 26(2): 466-469 |
| |
| Authors: | KUANG Zhu-fang YANG Guo-gui XIN Dong-jun |
| |
| Affiliation: | (1.College of Computer, Central South University of Forestry & Technology, Changsha 410004, China;2.College of Computer, National University of Defense Technology, Changsha 410073, China) |
| |
| Abstract: | The disadvantage which the algorithm EC for mining frequent item over data streams was analyzed, such as the inaccurate of the frequent item mined in a recent period of time over the data stream.Put forward a data structure the frequent item sample in the form of 4 member group.Then,presented an algorithm SWFPM which based on sliding window for mining frequent item over data streams.The SWFPM algorithm can accurately mine the frequent item over the sliding window.The IBM synthesizes data generation which output customer shopping a data and the accessing record of the world cup official website data in 1998 are adopted as experiment data. The algorithm is of high preciseness for mining frequent item, and high perfor-mance for data processing. |
| |
| Keywords: | data streams data mining frequent item sliding window |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机应用研究》浏览原始摘要信息 |
|
点击此处可从《计算机应用研究》下载全文 |
|
