| 数据流频繁闭集的在线挖掘 |
| |
| 引用本文： | 刘春,郑征,蔡开元,张师超.数据流频繁闭集的在线挖掘[J].北京航空航天大学学报,2008,34(8):969-972. |
| |
| 作者姓名： | 刘春 郑征 蔡开元 张师超 |
| |
| 作者单位： | 北京航空航天大学 自动化科学与电气工程学院, 北京 100191 |
| |
| 基金项目： | 国家自然科学基金，中国博士后科学基金 |
| |
| 摘 要： | 基于算法LossyCounting,提出了数据流频繁闭集的在线挖掘算法LC_Closed(LossyCounting_Closed).设计了基于前缀树的频繁闭集压缩存储结构CI-forest(ClosedItemsets-forest),利用该数据结构可以快速的插入和查询闭集模式,且在处理新的事务数据时能够快速定位相关的历史闭集模式.该算法采用在线的处理方式,提高了算法的实时性.实验的结果证明该算法是有效的.
|
| 关 键 词： | 数据挖掘 数据流 频繁闭集 在线 |
| 收稿时间： | 2007-07-20 |
Online mining frequent closed itemsets over data stream |
| |
| Liu Chun,Zheng Zheng,Cai Kaiyuan,Zhang Shichao.Online mining frequent closed itemsets over data stream[J].Journal of Beijing University of Aeronautics and Astronautics,2008,34(8):969-972. |
| |
| Authors: | Liu Chun Zheng Zheng Cai Kaiyuan Zhang Shichao |
| |
| Institution: | School of Automation Science and Electrical Engineering, Beijing University of Aeronautics and Astronautics, Beijing 100191, China |
| |
| Abstract: | Based on the algorithm LossCounting,a novel approach called LossyCounting_Closed(LC_Closed) for mining closed frequent itemsets over data stream was proposed.A new summary data structure called Closed-Itemsets-forest(CI-forest) was developed for maintaining only closed frequent itemsets.The insertion and query of closed itemsets can be rapidly made based on the data structure CI-forest,and the location of the associated historical closed itemsets in the stage of dealing with the new transaction is also faci... |
| |
| Keywords: | data mining data stream frequent closed itemsets online |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《北京航空航天大学学报》浏览原始摘要信息 |
| 点击此处可从《北京航空航天大学学报》下载免费的PDF全文 |
