期刊文献+

一种改进的数据挖掘算法 被引量:6

An Improved Data Mining Algorithm
下载PDF
导出
摘要 针对Apriori算法的存在产生大量的候选频繁集合的缺点,本文提出了基于加权代价敏感的非频过滤矩阵Apriori算法,通过在FP-tree算法的基础上构造的决策树对应的数据进行代价敏感学习;设定不同的数据的权值,设定加权置信度;非频集过滤矩阵寻找频集,生成强关联规则;构成非频集过滤Apriori算法对应的初始矩阵;构建代价敏感的非频集过滤矩阵等措施提高了算法的挖掘效果。 Aiming at the Apriori algorithm's shortcoming of having a large amount of candidate frequent sets, this paper proposes the non-frequency filter matrix Apriori algorithm based on weighted cost and establishes corresponding data of decision based on the FP-tree algorithm to conduct the cost sensitive learning. Set different data weighted value and weighted confidence; non- frequency set filter matrix seeks the frequency set to generate strong association rules; compose the corresponding initial matrix of non-frequency filter Apriori algorithm; establish cost sensitive non-frequency filter matrix to improve the mining effect of the algorithm.
作者 刘海涛
机构地区 江苏开放大学
出处 《科技通报》 北大核心 2016年第11期142-147,共6页 Bulletin of Science and Technology
关键词 Apriori决策树 强关联规则 Apriori decision tree strong association rules
  • 相关文献

参考文献5

二级参考文献53

  • 1李晓虹,尚晋.一种改进的新Apriori算法[J].计算机科学,2007,34(4):196-198. 被引量:26
  • 2徐光祐,陶霖密,史元春,张翔.普适计算模式下的人机交互[J].计算机学报,2007,30(7):1041-1053. 被引量:47
  • 3何丽.基于规模压缩的关联规则数据挖掘算法研究[J].计算机科学,2007,34(9):148-150. 被引量:1
  • 4Agrawal R, Imielinaki T, Swami A. Mining association rules be- tween sets items in large databases [C] // Proceedings of the ACM SIGMOD Conference on Management of Date. Washing- ton, D. C, 1993 : 207-216.
  • 5Han J, Pei J, Yin Y. Mining Frequent Patterns without Candi- date Generations[C]Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data. Dallas, Tex- as,USA,2000:1-12.
  • 6Zaki M J. Sealable Algorithms for Association Mining[J]. IEEE Transactions on Knowledge and Data Engineering, 2000,12(3) : 372-390.
  • 7Park J S, Chen M-S, Yu P S. An effective hash-based algorithms for mining association rules[C]//Proceeclings of the 1995 ACM SIGMOD International Conference on Management of Data. San Jose, California: ACM Press, 1995 : 175-186.
  • 8Khare N, Adlakha N, Pardasani K R. An Algorithm for Mining Multidimensional Association Rules using Boolean Matrix[C]// 2010 International Conference in Recent Trends in Infom:ation, Telecommunication and Computing. Kochi, Kerala, 2010 : 95-99.
  • 9Liu Hui-zhen, Dai Shang-ping,Jiang Hong. Quantitative associa- tion rules mining algorithm based on rnatrix[C]2009 Interna- tional Conference on Computational Intelligence and Software Engineering. Wuhan, 2009 : 1-4.
  • 10Teyssier M, Koller D. Ordering-based search: A simple and effective algorithm for learning Bayesian networks [ J ]. arXiv preprint arXiv: 1207. 1429, 2012.

共引文献78

同被引文献51

引证文献6

二级引证文献20

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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