首页 | 本学科首页   官方微博 | 高级检索  
     

Apriori_Q:关联规则的有效求解
引用本文:祁治,张晓龙. Apriori_Q:关联规则的有效求解[J]. 武汉科技大学学报(自然科学版), 2005, 28(4): 399-402
作者姓名:祁治  张晓龙
作者单位:武汉科技大学计算机科学与技术学院,湖北,武汉,430081
基金项目:湖北省教育厅科研基金资助项目(2004])006).
摘    要:通过对Apriori算法的分析,提出了一种关联规则挖掘的改进算法Apriori_Q。该改进算法减少了模式匹配和对数据库访问的次数,理论分析与实验结果表明,Apriori_Q提高了关联规则生成的效率,因而更具有实用价值。

关 键 词:数据挖掘 关联规则挖掘 Apriori算法
文章编号:1672-3090(2005)04-0399-04
收稿时间:2004-12-02
修稿时间:2004-12-02

Apriori_Q :Solution for Minging Association Rule
QI Zhi,ZHANG Xiao-long. Apriori_Q :Solution for Minging Association Rule[J]. Journal of Wuhan University of Science and Technology(Natural Science Edition), 2005, 28(4): 399-402
Authors:QI Zhi  ZHANG Xiao-long
Affiliation:College of Computer Science and Technology, Wuhan University of Science and Technology, Wuhan 430081, China
Abstract:The mining of association rules is the main method of data mining. This paper presents an algorithm Apriori_Q for mining association rule, which is an improvement of the existing Apriori method by reducing the times of database visit and of pattern-match. Theoretical analysis and experimental results show that Apriori Q outperforms Apriori in association rule mining, suggesting wider area of application.
Keywords:data mining   association rule mining   Apriori algorithm
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号