期刊文献+

一种适用于应用层协议的特征提取算法 被引量:2

Feature Extraction Algorithm for Application Layer Protocol
在线阅读 下载PDF
导出
摘要 基于PrefixSpan算法,提出一种适用于应用层协议的特征提取算法。通过加入关于位置的约束,减少频繁序列模式的产生数量,结合特征提取过程的实际情况加入约束条件,从而在挖掘过程中减少投影数据库产生的个数,在构建投影数据库过程中,去除关于非频繁项的存储及投影数据库中序列数小于最小支持度的扫描过程。实验结果表明,与原算法相比,该算法的运行时间较短,提取的特征具有较高的准确率和较低的误报率。 This paper proposes a feature extraction algorithm for application layer protocol based on PrefixSpan algorithm. It adds the constraints about position to reduce the number of frequent sequence mode, and is combined with the practical situation of the feature extraction process to join constraint conditions. In the mining process, it reduces the number of projection database. In construction of the projection database, it removes the storage about the frequent items and the scanning of which sequence number is less than the minimum support degree in projection database. Experimental results show that compared with the original algorithm, the running time of this algorithm is shorter, and the extraction features have higher precision and lower false alarm rate.
出处 《计算机工程》 CAS CSCD 2012年第4期266-268,共3页 Computer Engineering
基金 国家"863"计划基金资助项目(2009AA01Z424)
关键词 序列模式挖掘 特征提取 PREFIXSPAN算法 关联规则 sequential pattern mining feature extraction PrefixSpan algorithm association rule
  • 相关文献

参考文献8

  • 1Karagiannis T, Papagiannaki K, Faloutsos M. BLINC: Multilevel Traffic Classification in the Dark[C] //Proc. of ACM SIGCOMM’05. Philadelphia, USA: [s. n.] , 2005.
  • 2Zander S, Nguyen1 T, Armitage1 G. Self-learning IP Traffic Classification Based on Statistical Flow Characteristics[C] //Proc. of PAM’05. Boston, USA: [s. n.] , 2005.
  • 3佘锋,王小玲.基于半监督学习的网络流量分类[J].计算机工程,2009,35(12):90-91. 被引量:5
  • 4Park B, Won Y J, Kim M, et al. Towards Automated Application Sig- nature Generation for Traffic Identification[C] //Proc. of NOMS’08. [S. l.] : IEEE Press, 2008.
  • 5刘兴彬,杨建华,谢高岗,胡玥.基于Apriori算法的流量识别特征自动提取方法[J].通信学报,2008,29(12):51-59. 被引量:40
  • 6龙文,马坤,辛阳,杨义先.适用于协议特征提取的关联规则改进算法[J].电子科技大学学报,2010,39(2):302-305. 被引量:11
  • 7Pei Jian, Han Jiawei, Behzad M A, et al. PrefixSpan: Mining Sequential Patterns Efficiently by Prefix-projected Pattern Growth[C] //Proc. of the 17th International Conference on Data Engineering. [S. l.] : IEEE Press, 2001.
  • 8Lin Guanzhou, Xin Yang, Yang Yixian. An Improved Prefix- Spanbased Signatures Mining Algorithm with Offset Con- straint[C] //Proc. of the 2nd International Workshop on Intelligent Systems and Applications. [S. l.] : IEEE Press, 2010.

二级参考文献33

  • 1金婷,王攀,张顺颐,陆青莲,陈东.基于DPI和会话关联技术的QQ语音业务识别模型和算法[J].重庆邮电学院学报(自然科学版),2006,18(6):789-792. 被引量:10
  • 2THOMAS K, ANDRE B, NEVIL B. File-sharing in the Intemet: a Characterization of P2P Traffic in the Backbone[R]. UC, Riverside, 2003.
  • 3SUBHABRATA S, OLIVER S, WANG D M. Accurate, scalable in network identification of P2P traffic using application signatures[A]. International World Wide Web Conference[C]. New York,2004.
  • 4KARAGIANNIS T, PAPAGIANNAKI K, FALOUTSOS M. BLINC: multilevel tratfic classification in the dark[A]. Proc of ACM SIGCOMM[C]. Philadelphia, PA, 2005.
  • 5KARAGIANNIS T, BROIDO A, FALOUTSOS M. Transport layer identification of P2P traffic[A]. Proc of ACM SIGCOMM IMC[C]. Taormina, Sicily, Italy, 2004.
  • 6ZANDER S, NGUYENI T, ARMITAGEI G.Self-learning IP traffic classification based on statistical flow characteristics[A]. Proc of PAM[C]. Boston, MA, 2005.
  • 7ZUEV D, MOORE A W. Traffic classification using a statistical approach[A]. Proc of PAM[C]. Boston, 2005.
  • 8HERN E NOBEL A B, SMITH F D. Statistical clustering of intemet communication patterns[A]. Proceedings of the 35th Symposium on the Interface of Computing Science and Statistics, Computing Science and Statistics[C]. 2003.
  • 9MOORE A W, ZUEV D. Discriminators for Use in Flow-Based Classification[R]. Intel Research, Cambridge, 2005.
  • 10MOORE A W, ZUEV D. Internet tragic classification using bayesian analysis techniques[A]. Proc of ACM SIGMETRICS[C]. Banff, Alberta, Canada. 2005.

共引文献50

同被引文献6

引证文献2

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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