Institutional Repository
| 基于动态项集计数的加权频繁项集算法 | |
| Alternative Title | weighted frequent itemset algorithm based on dynamic itemset counting |
秦丽君; 罗雄飞
| |
| 2012 | |
| Source | Computer Engineering
 |
| ISSN | 1000-3428 |
| Volume | 38Issue:3Pages:31-33 |
| English Abstract | 基于Apriori的加权频繁项集挖掘算法存在扫描数据集次数多的问题。为此,提出一种基于动态项集计数的加权频繁项集算法。该算法采用权值键树的数据结 构和动态项集计数的方法,满足向下闭合特性,并且动态生成候选频繁项集,从而减少扫描数据集的次数。实验结果证明,该算法生成的加权频繁项集具有较高的效 率和时间性能。 |
| Indexed Type | cscd,cnki,wanfang |
| Abstract | The existing weighted frequent 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. |
| Keyword | Data Mining Weighted Frequent Itemset Mining Dynamic Itemset Counting Weighted Support Degree Weighted Trie Tree Downward Closure Property Maximum Weight |
| Department | 秦丽君, 中国科学院软件研究所, 北京 100190, 中国. 罗雄飞, 中国科学院软件研究所, 北京 100190, 中国. |
| Subject | Computer Science |
| Language | 中文 |
| Content Type | 期刊论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/14674 |
| Collection | 中国科学院软件研究所 |
| Recommended Citation GB/T 7714 | 秦丽君,罗雄飞. 基于动态项集计数的加权频繁项集算法[J]. Computer Engineering,2012,38(3):31-33. |
| APA | 秦丽君,&罗雄飞.(2012).基于动态项集计数的加权频繁项集算法.Computer Engineering,38(3),31-33. |
| MLA | 秦丽君,et al."基于动态项集计数的加权频繁项集算法".Computer Engineering 38.3(2012):31-33. |
| Files in This Item: | ||||||
| File Name/Size | DocType | Version | Access | License | ||
| 基于动态项集计数的加权频繁项集算法.pd（259KB） | 开放获取 | License | Application Full Text | |||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment