| 引用本文： |
-
袁鼎荣,严小卫.Apriori算法的复杂性研究[J].广西科学,2005,12(2):115-117,122. [点击复制]
- Yuan Dingrong,Yan Xiaowei.Studies on Complexity of Apriori Algorithm[J].Guangxi Sciences,2005,12(2):115-117,122. [点击复制]
|
|
| 摘要: |
| 介绍关联规则挖掘及Apriori算法,分析事务数据库的特性及Apriori算法的复杂性,指出频繁项集挖掘算法的优化途径. |
| 关键词: Apriori算法 数据挖掘 事务数据库 频繁项集 |
| DOI： |
| 投稿时间：2004-07-21 |
| 基金项目:广西科学基金(桂科基0448093)、清华大学智能技术与系统国家重点实验室开放课题和广西师范大学科研基金资助项目。 |
|
| Studies on Complexity of Apriori Algorithm |
|
Yuan Dingrong1,2, Yan Xiaowei1,2
|
| (1.Coll. of Math. & Comp. Sci., Guangxi Normal Univ., Guilin, Guangxi, 541004, China;2.Faculty of Info. Tech., Univ. of Tech. Sydney, Sydney, Australia) |
| Abstract: |
| Association rules mining and Apriovi algrithm was introduced.The characteristics in tran-saction database and the complexity of the Apriori algorithm is also analyzed.Approaches of improving the algorithms for mining frequent item sets are given. |
| Key words: Apriori algorithm data mining transaction database frequent itemset |
