计算机工程与应用 ›› 2010, Vol. 46 ›› Issue (30): 115-116.DOI: 10.3778/j.issn.1002-8331.2010.30.034
• 数据库、信号与信息处理 • 上一篇 下一篇
王平水
收稿日期:
修回日期:
出版日期:
发布日期:
通讯作者:
WANG Ping-shui
Received:
Revised:
Online:
Published:
Contact:
摘要： 关联规则挖掘是数据挖掘的一个重要研究领域。针对经典Apriori算法频繁扫描事务数据库致使运行效率低下的缺点，在研究已有关联规则挖掘算法的基础上，提出一种改进的基于关系矩阵的关联规则挖掘算法。理论分析和实验结果均表明，所提算法是高效的和实用的。
关键词: 关联规则, 频繁项集, 支持度计数, 关系矩阵
Abstract: Association rules mining is an important research field of data mining.Aiming at the poor efficiency of the classical Apriori algorithm which frequently scans the business database，on the basis of researches on the existing association rules mining algorithms，an improved algorithm of association rules mining based on relation matrix is proposed.Theoretical analysis and experiment results show that the proposed algorithm is efficient and practical.
Key words: association rules, frequent itemset, support count, relation matrix
中图分类号:
TP311.13
王平水. 关联规则挖掘算法研究[J]. 计算机工程与应用, 2010, 46(30): 115-116.
WANG Ping-shui. Research on association rules mining algorithm[J]. Computer Engineering and Applications, 2010, 46(30): 115-116.
0 / 推荐
导出引用管理器 EndNote|Ris|BibTeX
链接本文: http://cea.ceaj.org/CN/10.3778/j.issn.1002-8331.2010.30.034
http://cea.ceaj.org/CN/Y2010/V46/I30/115
