| 数据流中的频繁标记闭子树的批量挖掘 |
| |
| 引用本文： | 冯博,徐雅静,赵娜,徐惠民.数据流中的频繁标记闭子树的批量挖掘[J].北京邮电大学学报,2010,33(5):121-125. |
| |
| 作者姓名： | 冯博 徐雅静 赵娜 徐惠民 |
| |
| 作者单位： | 北京邮电大学,信息与通信工程学院,北京,100876;北京邮电大学,信息与通信工程学院,北京,100876;北京邮电大学,信息与通信工程学院,北京,100876;北京邮电大学,信息与通信工程学院,北京,100876 |
| |
| 基金项目： | 国家自然科学基金项目(60905017); 国家高技术研究发展计划项目(2007AA01Z417) |
| |
| 摘 要： | 在频繁模式挖掘（FPM）的研究中，为了在海量数据流中有效地挖掘子树结构的频繁模式，根据数据流和子树模式的特点，提出了一种基于数据流的频繁标记闭子树挖掘（SFCLTreeMiner）算法. 该算法首次对动态数据流中频繁标记闭子树的挖掘进行研究,给出了在数据流中标记闭子树集合添加、删除的批量挖掘方法,并结合时间衰减模型,有效保证了结果的时效性. 实验结果表明,该算法在挖掘性能，如挖掘时间和内存占用等方面，比类似算法有较大提高.
|
| 关 键 词： | 频繁子树挖掘 数据流 时间衰减 标记闭子树 批量挖掘 |
| 收稿时间： | 2009-12-09 |
A Batch Mining Algorithm for Frequent Closed Labeled Trees in Data Streams |
| |
| FENG Bo,XU Ya-jing,ZHAO Na,XU Hui-min.A Batch Mining Algorithm for Frequent Closed Labeled Trees in Data Streams[J].Journal of Beijing University of Posts and Telecommunications,2010,33(5):121-125. |
| |
| Authors: | FENG Bo XU Ya-jing ZHAO Na XU Hui-min |
| |
| Affiliation: | FENG Bo,XU Ya-jing,ZHAO Na,XU Hui-min ( School of Information , Communication Engineering,Beijing University of Posts , Telecommunications,Beijing 100876,China) |
| |
| Abstract: | Compared with the classic frequent pattern mining (FPM) algorithms,the dynamic FPM algorithms on fast and massive data streams have become top research nowadays. A new batch mining algorithm in data streams called stream frequent closed labeled tree miner (SFCLTreeMiner) is proposed. SFCLTreeMiner uses a kind of adding-removing method between closed tree sets. Also it provides a time decay module for reasonable data updating. Experiment shows that SFCLTreeMiner is efficient in data streams mining by reducin... |
| |
| Keywords: | frequent subtree mining data streams time decay labeled closed subtree batch mining |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《北京邮电大学学报》浏览原始摘要信息 |
|
点击此处可从《北京邮电大学学报》下载全文 |
|
