期刊文献+

基于深度学习的不确定数据频繁项集挖掘系统 被引量:3

Uncertain data frequent itemset mining system based on deep learning
下载PDF
导出
摘要 传统不确定数据频繁挖掘系统工作过程花费的时间较长,且挖掘结果与真实结果误差较大。为了解决上述问题,基于深度学习研究了一种新的不确定数据频繁挖掘系统,在硬件结构中建立深度学习挖掘模型,通过传感器、隐层、输入层、输出层、中心处理器、存储器和显示器构成硬件架构,软件流程由发送采集命令、预训练、微调训练、数据检测、判断候选项集是否为频繁项集等步骤组成。为检测挖掘系统工作性能,与传统挖掘系统进行实验,结果表明,基于深度学习的不确定数据频繁挖掘系统能够在短时间内取得有效的挖掘结果,误差小,实用性更强。 The traditional uncertain data frequent mining system spends less time in working process,and the error between mining results and real results is large. In order to solve the above problems,a new uncertain data frequent mining system is studied based on deep learning. A deep learning mining model is established in the hardware structure. The hardware structure is composed of sensors,hidden layer,input layer,output layer,central processor,memory and display. The software flow is composed of sending acquisition commands,pre-training,fine-tuning training,data detection and judgment.Whether the candidate itemsets are frequent itemsets or not. In order to test the performance of mining system,experiments with traditional mining system show that the uncertain data frequent mining system based on deep learning can obtain effective mining results in a short time,with small error and stronger practicability.
作者 苏韵捷 徐传凯 王金泽 SU Yun jie;XU Chuan kai;WANG Jin ze(School of Information technology,University of International Relations,Beijing 100091,China)
出处 《电子设计工程》 2020年第4期33-36,41,共5页 Electronic Design Engineering
基金 北京教委科技发展计划面上项目(KZ201510011011)。
关键词 深度学习 频繁项 不确定数据 频繁项集 挖掘系统 in-depth learning frequent items uncertain data frequent itemsets mining system
  • 相关文献

参考文献16

二级参考文献136

  • 1刘殷雷,刘玉葆,陈程.不确定性数据流上频繁项集挖掘的有效算法[J].计算机研究与发展,2011,48(S3):1-7. 被引量:14
  • 2颜跃进,李舟军,陈火旺.基于FP-Tree有效挖掘最大频繁项集[J].软件学报,2005,16(2):215-222. 被引量:68
  • 3李建中 于戈 周傲英.不确定性数据管理的要求与挑战[J].中国计算机学会通讯,2009,5(4):6-14.
  • 4Agrawal R,Srikant R.Fast algorithm for mining association rules[C]//Proceeding of the 20th International Conference on VLDB,Santigo,1994:487-498.
  • 5Houtsma M,Swami A.Set-Oriend mining for association rules in relational database[C]//Proceedings of the International Conference on Data Engineering,Los Alamitos:IEEE Computer Press,1995:25-34.
  • 6Savasere A,Omiecinski E,Navathe SM.An efficient algorithm for mining association rules[C]//Proceedings of the 21st International Conference on VLDB,Zurich,1995:420-445.
  • 7Bayardo R.Efficiently mining long patterns from databases[C]//Proceedings of the ACM SIGMOD International Conference on Management of Data,New York:ACM Press,1998:84-94.
  • 8Lin,Dao-I,Kedem,et al.Pincer-Search:A new algorithm for discovering the maximum frequent set[C]//Proceedings of the 6th European Conference on DT,Heidel-berg:Springe-Verlag,1998:105-120.
  • 9李雪,江贺.不确定数据挖掘技术研究进展[J].中国科技论文在线,2009.
  • 10Agrawal R, Srikant R.Fast algorithms for mining association rules in large databases[C]//Proc of 20th 1CDE, 1997:487-499.

共引文献65

同被引文献32

引证文献3

二级引证文献13

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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