| 基于频繁闭项集挖掘的增量式维护算法 |
| |
| 引用本文： | 李芸,史琰. 基于频繁闭项集挖掘的增量式维护算法[J]. 计算机工程, 2008, 34(3): 94-96,9 |
| |
| 作者姓名： | 李芸 史琰 |
| |
| 作者单位： | 1. 西安电子科技大学软件学院,西安,710071
2. 西安电子科技大学电子工程学院,西安,710071 |
| |
| 摘 要： | 为了能够随着数据库的增加、删除和修改而快速有效地挖掘出频繁闭项集，根据CHARM算法提出了一种基于频繁闭项集挖掘的增量式维护算法。该算法采取分类处理的策略对变化数据进行挖掘，运用IT对的特性从已挖掘出的结果中快速过滤出仍然有效的信息，实现频繁闭项集的更新。实验结果表明该算法是快速有效的。
|
| 关 键 词： | 频繁闭项集 CHARM算法 增量式维护算法 IT对 |
| 文章编号： | 1000-3428（2008）03-0094-03 |
| 收稿时间： | 2007-03-17 |
| 修稿时间： | 2007-03-17 |
Incremental Maintaining Algorithm Based on Frequent Closed Itemsets Mining |
| |
| LI Yun,SHI Yan. Incremental Maintaining Algorithm Based on Frequent Closed Itemsets Mining[J]. Computer Engineering, 2008, 34(3): 94-96,9 |
| |
| Authors: | LI Yun SHI Yan |
| |
| Affiliation: | (1. School of Software, Xidian University, Xi’an 710071; 2. School of Electronic Engineering, Xidian University, Xi’an 710071) |
| |
| Abstract: | In order to mine fast and efficiently frequent closed itemsets according to insertion, deletion and modification of the database, this paper proposes an incremental maintaining algorithm U_CHARM based on CHARM algorithm. The algorithm partitions data into different groups to achieve the update of frequent closed itemsets, in which changed data are used to mine frequent closed itemsets and valid information is obtained from previous results by utilizing the properties of IT pairs. Experimental results demonstrate that the algorithm is fast and efficient. |
| |
| Keywords: | frequent closed itemsets CHARM algorithm incremental maintaining algorithm IT pairs |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程》浏览原始摘要信息 |
|
点击此处可从《计算机工程》下载免费的PDF全文 |
