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

基于分辨矩阵的含负属性项关联规则挖掘
引用本文:王培吉,章树玲,赵玉琳.基于分辨矩阵的含负属性项关联规则挖掘[J].江西师范大学学报(自然科学版),2012(1):95-98.
作者姓名:王培吉  章树玲  赵玉琳
作者单位:内蒙古科技大学数理与生物工程学院;内蒙古第一机械集团公司二分公司
基金项目:国家自然科学基金(81060238)资助项目
摘    要:Apriori算法存在候选集、频繁集产生效率低,丢失有趣强关联规则等问题,提出一种基于分辨矩阵可以采掘含负属性项强关联规则的改进算法,最后给出一个实际例子实现该算法.

关 键 词:数据挖掘  分辨矩阵  兴趣度  关联规则

Mining Association Rules Including Negative Items Based on Recognizable Matrix
WANG Pei-ji,ZHANG Shu-lin,ZHAO Yu-lin.Mining Association Rules Including Negative Items Based on Recognizable Matrix[J].Journal of Jiangxi Normal University (Natural Sciences Edition),2012(1):95-98.
Authors:WANG Pei-ji  ZHANG Shu-lin  ZHAO Yu-lin
Institution:1.School of Mathematics,Physics and Biological Engineering,Inner Mongolia University of Science and Technology,Baotou Inner Mongolia 014010,China;2.Branch 2,Inner Mongolia First Machinery Group Corporation,Baotou Inner Mongolia 014032,China)
Abstract:Recognizable matrix,association rules including negative items and submit an improved Ap-riori algorithm,aim at low efficiency of mining candidate itemsets,frequent itemsets and losing useful rules is presented.The implementation of algorithm by introducing an example is described.
Keywords:data mining  recognizable matrix  interestingness  association rules
本文献已被 CNKI 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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