| 基于动态项集计数的加权频繁项集算法 |
| |
| 引用本文： | 秦丽君,罗雄飞.基于动态项集计数的加权频繁项集算法[J].计算机工程,2012,38(3):31-33. |
| |
| 作者姓名： | 秦丽君 罗雄飞 |
| |
| 作者单位： | 1. 中国科学院软件研究所,北京100190;中国科学院研究生院,北京100190
2. 中国科学院软件研究所,北京,100190 |
| |
| 基金项目： | 国家“863”计划基金资助项目（2007AA040702） |
| |
| 摘 要： | 基于Apriori的加权频繁项集挖掘算法存在扫描数据集次数多的问题。为此，提出一种基于动态项集计数的加权频繁项集算法。该算法采用权值键树的数据结构和动态项集计数的方法，满足向下闭合特性，并且动态生成候选频繁项集，从而减少扫描数据集的次数。实验结果证明，该算法生成的加权频繁项集具有较高的效率和时间性能。
|
| 关 键 词： | 数据挖掘 加权频繁项集挖掘 动态项集计数 加权支持度 权值键树 向下闭合特性 最大权值 |
| 收稿时间： | 2011-06-29 |
Weighted Frequent Itemset Algorithm Based on Dynamic Itemset Counting |
| |
| QIN Li-jun
,
LUO Xiong-fei.Weighted Frequent Itemset Algorithm Based on Dynamic Itemset Counting[J].Computer Engineering,2012,38(3):31-33. |
| |
| Authors: | QIN Li-jun LUO Xiong-fei |
| |
| Affiliation: | 1. Institute of Software, Chinese Academy of Sciences, Beijing 100190, China; 2. Graduate University of Chinese Academy of Sciences, Beijing 100190, China) |
| |
| Abstract: | The existing weighted fiequent itemset mining algorithms which are based on Apriori require multiple dataset scans. This paper proposes a weighted frequent itemset algorithm weighted frequent itemset mining based on dynamic itemset counting which uses the structure of weighted trie tree and the method of dynamic itemset counting. This algorithm satisfies the downward closure property and dynamically generates candidate frequent itemsets, thereby reduces the number of scanning datasets and improves the performance. Experimental results show that the proposed algorithm not only generates the weighted frequent itemsets, but also has high efficiency and time performance. |
| |
| Keywords: | data mining weighted frequent itemset mining dynamic itemset counting weighted support degree weighted trie tree downwardclosure property maximum weight |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程》浏览原始摘要信息 |
|
点击此处可从《计算机工程》下载全文 |
