期刊文献+

基于粗糙集的关联规则挖掘方法 被引量:7

Approach for mining association rules based on rough set
下载PDF
导出
摘要 对粗糙集进行了相关研究,并提出一种以粗糙集理论为基础的关联规则挖掘方法,该方法首先利用粗糙集的特征属性约简算法进行属性约简,然后在构建约简决策表的基础上应用改进的Apriori算法进行关联规则挖掘。该方法的优势在于消除了不重要的属性,减少了属性数目和候选项集数量,同时只需一次扫描决策表就可产生决策规则。应用实例及实验结果分析表明该方法是一种有效而且快速的关联规则挖掘方法。 In this paper a novel approach for mining association rules based on rough set theory was presented. It firstly used the rough set' s feature attributes reduction algorithm to reduce attributes, and then applied the improved Apriori algorithm to mine association rules based on the reduction decision table. The advantages of this method were that it reduced the number of the attributes by reducing the unimportant attributes, also reduced the number of candidate item sets and could produce the association rules by scanning decision table only once. The results of application and experiments show that this method is fast and effective.
出处 《计算机应用》 CSCD 北大核心 2010年第1期25-28,共4页 journal of Computer Applications
基金 广东省科技计划项目(2009B010800036) 仲恺农业工程学院自然科学基金资助项目(G3091813)
关键词 数据挖掘 关联规则 粗糙集 分辨矩阵 APRIORI算法 data mining association rule rough set discernable matrix Apriori algorithm
  • 相关文献

参考文献11

  • 1HAN JIAWEI, KAMBER M. Data mining concepts and techniques [ M]. San Francisco: Morgan Kaufmann Publishers, 2005.
  • 2SAVASERE A, OMIECINSKI E, NAVATHE S. An efficient algorithm for mining association rules in large database[ C]// Proceedings of the 21th International Conference on Very Large DataBase. San Francisco: Morgan Kaufmann Publishers, 1995 : 432 - 443.
  • 3PASQUIER N, BASTIDE Y. Discovering frequent closed item sets for association rules[ C]// Proceedings of the 7th International Conference on Database Theory. London: Springer-Verlag, 1999:398 - 416.
  • 4HAN JIAWEI, PEI JIAN. Mining frequent patterns without candidate generation[C]// Proceedings of the 20th ACM SIGMOD International Conference on Management of Data. New York: ACM, 2000:1 - 12.
  • 5BERZAL F, CUBERO J, MARIN N. TBAR: An efficient method for association rule mining in relational databases[ J]. Data and Knowledge Engineering, 2001,37(1) : 47 -64.
  • 6叶东毅.基于近似精度递归计算的一个属性约简算法[J].小型微型计算机系统,2003,24(12):2272-2274. 被引量:7
  • 7刘振华,刘三阳,王珏.基于信息量的一种属性约简算法[J].西安电子科技大学学报,2003,30(6):835-838. 被引量:45
  • 8王国胤,于洪,杨大春.基于条件信息熵的决策表约简[J].计算机学报,2002,25(7):759-766. 被引量:594
  • 9程昳.多元粗糙模糊回归预测[J].四川师范大学学报(自然科学版),2003,26(4):335-337. 被引量:69
  • 10PAWLAK Z. Rough sets[ J]. International Journal of Computer Information Science, 1982, 11 (5) : 341 - 356.

二级参考文献11

共引文献686

同被引文献81

引证文献7

二级引证文献15

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部