期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

关联规则挖掘综述 被引量：5

Survey of Association Rules Mining
下载PDF
导出
摘要 介绍了当前关联规则挖掘的研究情况,分析了传统关联规则挖掘算法的不足．与此同时,介绍了几种优化算法．最后,展望了关联规则挖掘的未来研究方向． Thls paper introduces the situation of researches on mining association rules. Then, it analyzes a few shortcomings in traditional algorithms of mining association rules as well as recommends some optimize algorithms. Furthermore, it indicates the methods of value judgments of assocation rules. At last,it looks into the future directions of this technology,
作者 杨泽民 武志东
机构地区 雁北师范学院计算中心 大同市煤矿安全信息中心
出处 《雁北师范学院学报》 2006年第2期19-22,共4页 Journal of Yanbei Teachers College
关键词 数据挖掘 关联规则 频集 dam mining, association rule, frequent item set
分类号 TP311 [自动化与计算机技术—计算机软件与理论]
  • 相关文献

参考文献4

二级参考文献48

  • 1韩家炜(加)等 范明等译.数据挖掘:概念与技术[M].机械工业出版社,2001..
  • 2[1]R Agrawal, T Imielinski, A Swami. Mining Association Rules between Sets of Items in Large Databases [C]. In Proc. of the ACM SIGMOD Int' I Conf. on Management of Data (ACM SIGMOD'93), Washington, USA,1993.207-216.
  • 3[2]R Agrawal et al. Fast Algorithms for Mining Association Rules [C]. In Proc. of the 20th Int'l Conf. on Very Large Databases (VLDB'94), Santiago, Chile, 1994.487-499.
  • 4[3]R Agrawal,R Srikant. Mining Sequential Patterns[C]. In Proc.of the Int'l Conf. on Data Engineering (ICDE), Taipei,Taiwan, 1995.3-14.
  • 5[4]N F Ayan, A U Tansel, et al. Arkun. An Efficient Algorithm to Update Large Itemsets with Early Pruning[C]. In Proc. of the 5th Int'l Conf. on Knowledge Discovery and Data Mining (KDD'99), San Diego, California, USA,1999.439-450.
  • 6[5]R J Bayardo Jr, et al. Constraint-based Rule Mining in Large,Dense Databases[C]. In Proc. of the 15th Int'l Conf. on Data Engineering, Sydney, Australia, 1999.85-93.
  • 7[6]S Brin, R Motwani,C Silverstein. Beyond Market Baskets:Generalizing Association Rules to Correlations [C]. In Proc. of the ACM SIGMOD Iht'1 Conf. on Management of Data (ACM SIGMOD ' 97), 1997.265-276.
  • 8[7]S Brin, et al. Dynamic Itemset Counting and Implication Rules for Market Basket Data[C]. In Proc. of the ACM SIGMOD Int'I Conf. on Management of Data, 1997. 123-140.
  • 9[8]T Fukuda, Y. Morimoto, et al. Mining Optimized Association Rules for Numeric Attributes [C]. In Proc. of the 15th ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Database Systems (PODS'96), Montreal, Canada, 1996.23-32.
  • 10[9]J Han, J Pei,Y Yin. Mining Frequent Patterns Without Candidate Generation[C]. In Proc. of the 2000 ACM-SIGMOD Int'I Conf. on Management of Data, Dallas, Texas, USA,2000.1-12.

共引文献166

同被引文献13

引证文献5

二级引证文献18

雁北师范学院学报
2006年 第2期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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