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

基于Apriori的有效关联规则挖掘算法的研究 被引量：37

Research on an Algorithm for Mining of Efficient Association Rules Based on Apriori
下载PDF
导出
摘要 通过对Apriori算法进行的分析与研究,发现其在实用中存在两个主要问题:生成的关联规则具有相当大的冗余性;有可能挖掘出一条支持度和置信度均很高,但却是无趣的、甚至是虚假的关联规则,且不能产生带有否定项的规则。鉴于此,该文给出了关联规则的两个性质和引入兴趣度的第三个度量———相关支持度,设计了挖掘出有效关联规则算法,较好地解决了上述问题。 By analyzing and studying Apriori algorithm,this paper finds two problems.Firstly,generated association rules are quite redundant.Secondly,it is probable to find an association rule,which possess high support and confidence,but is uninteresting,and even is false.Furthermore,a rule with negative-item can't be produced.Thus,this paper,after giving the two properties of association rules and introducing interest measure's third threshold—correlation support,effective association rules are worked out and able to solve above problems well.
作者 张梅峰 张建伟 张新敬 娄淑琴
机构地区 郑州轻工业学院计算机科学与工程系 郑州轻工业学院数理系 北方交通大学电子信息工程学院
出处 《计算机工程与应用》 CSCD 北大核心 2003年第19期196-198,共3页 Computer Engineering and Applications
基金 河南省自然科学基金项目(编号:111070600)
关键词 数据挖掘 关联规则 APRIORI 兴趣度 Data Mining,Association Rule,Apriori,Interest Measure
分类号 TP311.13 [自动化与计算机技术—计算机软件与理论]
  • 相关文献

参考文献5

二级参考文献24

  • 1左万利 刘居正.包含正负属性的关联规则及其挖掘.第十六届全国数据库学术会议论文集[M].兰州,1999.288-292.
  • 21，Agrawal R, Mannila H, Srikant R et al. Fast discovery of association rules. In: Fayyad M, Piatetsky-Shapiro G, Smyth P eds. Advances in Knowledge Discovery and Data Mining. Menlo Park, California: AAAI/MIT Press, 1996. 307-328
  • 32，Brin S, Motwani R, Ullman J D et al. Dynamic itemset counting and implication rules for market basket data. In: Proc the ACM SIGMOD International Conference on Management of Data, Tucson, Arizon, 1997. 255-264
  • 43，Fayyad U M, Piatesky-shapiro G, Smyth P P. From data mining to knowledge discovery: an overview. In: Fayyad M, Piatetsky-Shapiro G, Smyth P eds. Advances in Knowledge Discovery and Data Mining. California:AAAI Press, 1996. 1-36
  • 54，Piatesket-Shapiro G. Discovery, analysis, and presentation of strong rules. In: Piatesky-Shapiro G, Frawley W J eds. Advances in Knowledge Discovery and Data Mining. Menlo Park, California:AAAI/MIT Press, 1991. 229-238
  • 65，Silberschatz A, Stonebraker M, Ullman J. What makes patterns interesting in knowledge discovery sysstems. IEEE Trans on Knowledge and Data Engineering, 1996, 8(6):970-974
  • 76，Symth P, Goodman R M. An information theoretic approach to rule induction from databases. IEEE Trans on Knowledge and Data Engineering, 1992, 4(4):301-316
  • 87，Toivonen H, Klemettinen M, Ronkainen P et al. Pruning and grouping discovered association rules. In: Mlnet Workshop on Statistics, Machine Learning, and Discovery in Database, Gete, Greece, 1995. 47-52
  • 9Agrawal R,Imielinski T,Swami A. Mining Association Rules between Sets of Items In Large DataBase. In: Proc. ACM SIGMOD Conf. on Management of Data, Washington, D. C. 1993. 207 ～ 216
  • 10Agrawal R, Srikant R. Fast Algorithms for Mining Association Rules: [IBM Research Report RJ9839]. IBM Almaden Research Center, San Jose,Calif. 1994

共引文献132

同被引文献196

引证文献37

二级引证文献209

计算机工程与应用
2003年 第19期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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