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

基于矩阵的多段支持度关联规则挖掘算法
引用本文:张伟丰,杨丽华. 基于矩阵的多段支持度关联规则挖掘算法[J]. 湖北汽车工业学院学报, 2014, 0(2): 72-76
作者姓名:张伟丰  杨丽华
作者单位:湖北汽车工业学院经济管理学院,湖北十堰442002
基金项目:湖北省教育厅科研项目(B20092306)
摘    要:为有效提高关联规则挖掘算法效率,提出了一种基于矩阵的多段支持度关联规则挖掘算法,该算法通过一次数据库扫描将事务数据存放在矩阵中,利用矩阵进行支持度的计算和频繁集的寻找,同时将项集支持度分段计算的思想应用其中,减少候选集生成,实验表明,算法效率得到了较大提高。

关 键 词:Apriori算法  关联规则  数据挖掘  多段支持度  矩阵

Algorithm of Multi-Segment Support Association Rules Mining Based on Matrix
Zhang Weifeng,Yang Lihua. Algorithm of Multi-Segment Support Association Rules Mining Based on Matrix[J]. Journal of Hubei Automotive Industries Institute, 2014, 0(2): 72-76
Authors:Zhang Weifeng  Yang Lihua
Affiliation:(School of Economics and Management, Hubei University of Automotive Technology, Shiyan 442002, China)
Abstract:In order to improve the efficiency of association rules mining algorithm, a kind of multi- segment support association rules mining algorithm was proposed based on matrix. This algorithm can store transaction data in the matrix by scanning the database once, use the matrix to calculate the support and find the frequent sets. The application of subsection computing the support of item sets was introduced, and the number of generated candidate sets was reduced. The experimental results show the algorithm efficiency is greatly improved.
Keywords:Apriori algorithm  association rules  data mining  multi-segment support  matrix
本文献已被 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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