期刊文献+

具有语义最小支持度的关联规则挖掘方法 被引量:2

Association Rules Mining Method with Semantic Minimum Support Degree
下载PDF
导出
摘要 现有的关联规则挖掘方法中,大多采用单一的最小支持度.实际上,应该根据数据的特点设置不同的最小支持度.文中针对这一问题,将语义信息引入关联规则挖掘之中,提出了具有语义最小支持度的关联规则挖掘方法.该方法首先计算项目之间的语义相关度,然后根据候选集的语义相关度对候选集合进行过滤,最后根据候选集的语义相关度,确定其语义最小支持度.实验表明:具有语义最小支持度的关联规则挖掘方法比传统的关联规则挖掘方法能够更好地实现关联规则的挖掘. The single minimum support degree is used in the existing association rules mining methods mostly.In fact,the different minimum support degrees should be set based on the characteristics of the data.Association rules mining method with semantic minimum support degree is proposed by importing semantics into association rules mining in the paper.Firstly,semantic relevance degree between the items is computed in the method.Secondly,the candidate sets is filtered according to their semantic relevance degree.Finally,the semantic minimum support is determined based on semantic relevance degree of the candidate set.Experiments showed that association rules mining method with semantic minimum support degree can mine association rules better than the traditional association rules mining method.
出处 《微电子学与计算机》 CSCD 北大核心 2008年第9期14-17,共4页 Microelectronics & Computer
基金 国家自然科学基金项目(50674086) 中国矿业大学科技基金项目(2007B016)
关键词 关联规则 挖掘 语义 支持度 association rules mining semantic support degree
  • 相关文献

参考文献5

  • 1Lee Y C, Hong T P, Lin W Y. Mining association rules with multiple minimum supports using maximum constraints [J]. International Journal of App roximate Reasoning, 2005, 40(7):44-54.
  • 2马占欣,黄维通,陆玉昌.相关度计算方法存在的问题及修正[J].计算机工程,2007,33(11):67-69. 被引量:13
  • 3Xing Pingping, Shi Pengfeng, Zhao Yan. Ontology- based data.mining[J]. Comaputer Engineering, 2001, 27 (5) : 15 - 16.
  • 4Zahra Farzanyar, Mohammadreza Kangavari, Sattar hashemi a new algorithm for mining f' uzzy association rules in the large databases based on ontology[C]//Sixth IEEE International Conference on Data Mining - Workshops (ICDMW' OG). Tehran: Iran University of Science, 2006:65 - 69.
  • 5Agrawal R, Srikant R. Fast algorithms for mining association rules[C]//Proc. 20th Intl. Conf Very Large Data Bases. Santiago, 1994 : 487- 499.

二级参考文献5

  • 1罗可,郗东妹.采掘有效的关联规则[J].小型微型计算机系统,2005,26(8):1374-1379. 被引量:12
  • 2HAN JW,KAMBER M.数据挖掘概念与技术[M].孟小峰,等译.北京:机械工业出版社.2005.
  • 3Dunham M H.数据挖掘教程[M].郭崇慧,译.北京:清华大学出版社,2000.
  • 4Ahmed K M,El-Makky N M,Taha Y.A Note on Beyond Market Basket:Generalizing Association Rules to Correlations[J].SIGKDD Explorations,2000,2(1).
  • 5Brin S,Motwani R,Silverstein C.Beyond Market Basket Generalizing Association Rules to Correlations[C]//Proc.of ACM-SIGMOD Int.Conf.on Management of Data.1997.

共引文献12

同被引文献23

  • 1吴钊,项经猛.一种面向对象的模糊知识库模型[J].计算机应用与软件,2005,22(1):22-23. 被引量:8
  • 2马占欣,王新社,黄维通,陆玉昌.对最小置信度门限的置疑[J].计算机科学,2007,34(6):216-218. 被引量:5
  • 3飞机设计手册总编委会.飞机设计手册[M].北京:航空工业出版社,2000.
  • 4AGRAWAL R, IMIELINSKI T, SWAMI A. Database mining: a per- formance perspective [ J]. IEEE Trans on Knowledge and Data Engineering,1993,5(6) : 914-925.
  • 5AGRAWAL R, IMIELINSKI T, SWAMI A. Mining association rules between sets of items in large databases [ C ]//Proc of ACM SIGMOD International Conference on Management of Data. New York: ACM Press,1993 : 207-216.
  • 6BRIN S, MOTWANI R, ULLMAN JD, et al. Dynamic itemset counting and implication rules for market basket data[ C ]//Proc of ACM SIGMOD International Conference on Management of data. New York: ACM Press, 1997 : 255-264.
  • 7SAVASERE A, OMIECINSKI E, NAVATHE S. An efficient algo- rithm for mining association rules in large databases[ C ]//Proc of the 21st International Conference on Very Large Data Bases. San Francis- co: Morgan Kaufmann Publishers,1995 : 432-444.
  • 8YE Qiang, LI Yi-jun, ZHANG Jie. Improved method in association rule mining[ C]//Proc of the 8th Asia Pacific Management Confe- rence. 2002 : 1 - 8.
  • 9BRIN S, MOTWANI R, SILVERSTEIN C. Beyond market baskets: generalizing association rules to correlations [ C ]//Proc of ACM SIG- MOD International Conference on Management of Data. New York: ACM Press, 1997: 265-276.
  • 10HAN Jia-wei, KAMBER M. Data mining concepts and techniques [ M]. San Francisco: Morgan Kaufmann Publishers, 2001.

引证文献2

二级引证文献6

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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