期刊文献+

挖掘算法在高速网络流频繁项计算中的实验应用

Experiment Application of Frequent Items Mining Algorithm in High-Speed Network Flow Calculation
下载PDF
导出
摘要 近年来,计算机网络技术发展迅速,且为社会各项生产、生活领域的发展提供必要的信息和技术支持。网络管理与网络安全,特别是在当前骨干网络链路呈几何倍数增长的背景下,网络安全与管理就显得尤其重要。为了进一步确保网络安全并实现网络的规范化管理,通过对网络流的特性进行分析,进而引入IWFIM和CBF-IWFIM算法,通过对二者的原理及算法进行分析,在结合IWFIM算法的基础上,以网络流重尾分布特性为依据,利用IWFIM实现对高速网络流量频繁项的挖掘。通过对网络流量的实际测试表明,IWFIM算法与CBF-IWFIM算法具有较高的空间准确率及利用率。 In recent years,computer network technology has developed rapidly,and for the development of various social production and life provides the necessary information and technical support.Network management and network security,especially in the current backbone link geometric multiples growth background,the network security and management is particularly important.In order to further ensure the security of the network and to realize the standardization of the network management,through analysis of the characteristics of the network flow,and then introduces the IWFIM and CBF-IWFIM algorithm,through the analysis of the principle and algorithm of both,on the basis of combining IWFIM algorithm,based on network flowheavy-tailed distribution characteristics,uses IWFIM to realize high-speed network traffic mining frequent items.Through the network traffic practical test shows that IWFIM algorithm and CBF-IWFIM algorithm has high accuracy and efficiency.
作者 卢来 邓文 吴绍军 黄锦焕 LU Lai, DENG Wen, WU Shao-jun, HUANG Jin-huan(Guangdong Ocean University Cunjin College, Zhanjiang 52409)
出处 《现代计算机》 2018年第12期36-40,共5页 Modern Computer
关键词 挖掘算法 高速网络流 频繁项计算 The Mining Algorithm High-Speed Network Flow Frequent Items to Calculate
  • 相关文献

参考文献3

二级参考文献31

  • 1张玉,方滨兴,张永铮.高速网络监控中大流量对象的识别[J].中国科学:信息科学,2010,40(2):340-355. 被引量:11
  • 2孙玉芬,卢炎生.流数据挖掘综述[J].计算机科学,2007,34(1):1-5. 被引量:36
  • 3王伟平,李建中,张冬冬,郭龙江.一种有效的挖掘数据流近似频繁项算法[J].软件学报,2007,18(4):884-892. 被引量:33
  • 4ESTAN C,VABGHESE G.New directions in traffic measurement and accounting:focusing on the elephants,ignoring the mice[J].ACM Trans on Computer Systems,2003,21 (3):270-313.
  • 5GILBERT A C,KOTIDIS Y,MUTHUKRISHNAN S,et al.QuickSAND:quick summary and analysis of network data[EB/OL].(2001)[2010-08].ftp://dimacs.rutgers.edu/pub/dimacs/TechnicalReports/TechReports/2001/2001-43.ps.gz.
  • 6HAN Jia-wei,KAMBER M.Data mining:concepts and techniques[M].Beijing:China Machine Press,2001.
  • 7LI Hua-fu,LEE S Y,SHAN M K.Online mining(recently) maximal frequent itemsets over data streams[C] //Proc of the 15th International Workshop on Research Issues in Data Engineering:Stream Data Mining and Applications.Washingto DC:IEEE Computer Society,2005:11-18.
  • 8GRAHNE G,ZHU Jian-fei.Efficiently using prefix-trees in mining frequent itemsets[C] //Proc of IEEE ICDM Workshop on Frequent Itemset Mining Implementations.2003:123-132.
  • 9LIN C H,CHIU Ding-ying,WU Yi-hung,et al.Mining frequent itemsets from data streams with a time-sensitive sliding window[C] //Proc of the 5th SIAM International Conference on Data Mining.2005:68-79.
  • 10HAN Jia-wei,PEI Jian,YIN Yi-wen,et al.Mining frequent patterns without candidate Generation:a frequent-pattern tree approach[J].Data Mining and Knowledge Discovery,2004,8(1):53-87.

共引文献18

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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