| 基于频繁项集特性的Apriori算法的改进 |
| |
| 引用本文： | 高宏宾,潘谷,黄义明. 基于频繁项集特性的Apriori算法的改进[J]. 计算机工程与设计, 2007, 28(10): 2273-2275,2378 |
| |
| 作者姓名： | 高宏宾 潘谷 黄义明 |
| |
| 作者单位： | 五邑大学,信息学院,广东,江门,529020;五邑大学,信息学院,广东,江门,529020;五邑大学,信息学院,广东,江门,529020 |
| |
| 摘 要： | Apriori算法是关联规则中一种重要算法.Apriori算法在求出频繁项集的过程中,需要扫描事务项集里的数据.由于事务项集里只是部分数据有用,所以改进算法,缩小所需扫描的事务项集大小,并提出了一种简单的数据结构--树型结构来存储事务项集数据,使得算法在数据集量巨大时,性能得到有效提高,并用实例验证了这些改进能够正确、有效、快速地实现该算法.
|
| 关 键 词： | 数据挖掘 关联规则 频繁项集 Apriori 算法 事务项集 |
| 文章编号： | 1000-7024（2007）10-2273-03 |
| 修稿时间： | 2006-04-28 |
Improvement of Apriori algorithm based on characteristic of frequent itemset |
| |
| GAO Hong-bin,PAN Gu,HUANG Yi-ming. Improvement of Apriori algorithm based on characteristic of frequent itemset[J]. Computer Engineering and Design, 2007, 28(10): 2273-2275,2378 |
| |
| Authors: | GAO Hong-bin PAN Gu HUANG Yi-ming |
| |
| Affiliation: | Institute of Information, Wuyi University, Jiangmeng 529020, China |
| |
| Abstract: | Apriori algorithm is one of important algorithms in association rule algorithms. The process of get frequent itemset in Apriori algorithm needs scan every data in transaction itemset, In fact, only part of data in transaction itemset are availability, The improvement of apriori algorithm here is to decrease transaction itemset data, and created a tree structure which used to store data sets. To huge scale data sets, the performance of algorithm improved effectively. An example is cited to prove these improvements. |
| |
| Keywords: | data mining association rule frequent itemset apriori algorithm transaction itemset |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
