期刊文献+

子空间聚类在入侵特征选择中的应用 被引量:1

Application of subspace clustering in intrusion feature selection
下载PDF
导出
摘要 子空间聚类能在高维空间挖掘隐藏在不同低维子空间中的簇类,能在分类的基础上有效降维。针对目前入侵检测实时性和准确性的要求,提出子空间聚类ASCOD算法,该算法内嵌离群点扫描处理,能动态计算最优的算法参数,将该算法应用于入侵特征选择领域,实验结果证明这种策略的抗干扰能力较强,并能高效进行特征选择,提高了入侵检测的检测速度和精度。 Subpace cluster can not only mine, in the high-dimension, cluster classes hidden in different low-dimensions, but also effectively reduce dimensionality based on classification. ASCOD algorithm of subspace cluster is brought forward for the requirements of real-time characteristic and accuracy in intrusion detection. Scan processing of outlier is included into this algorithm, which can dynami- cally calculate the optimal parameters. The algorithm is applied to the field of intrusion feature selection, experimental results show that it can carry out its strong ability against distraction and effectively select feature, thus improving the testing speed and accuracy of intrusion detection.
出处 《计算机工程与应用》 CSCD 2012年第8期96-98,154,共4页 Computer Engineering and Applications
基金 河北省科技计划项目(No.10213559)
关键词 特征选择 子空间聚类 入侵检测 检测率 feature selection subspace clustering intrusion detection true positive rate
  • 相关文献

参考文献14

  • 1Mukkamala S, Sung A H, Ribeiro B.Model selection for kernel based intrusion detection systems[C]//Proceedings of the International Conference on Adaptive and Natural Computing Algorithms, Coimbra, Portugal, 2005: 458-461.
  • 2Downs T,Gates K E,Masters A.Exact simplification of support vector solutions[J].Journal of Machine Learning Research,2001, 2: 293-297.
  • 3Seholkopf B, Mika S, Burges C, et al.Input space in kemel-based methods[J].IEEE Trans on Neural Networks, 1999, 10 (5): 1000-1017.
  • 4Hotelling H.Analysis of a complex of statistical variables into principal components[J].Journal of Educational Psychology, 1933,24(6) :417-441.
  • 5Parsons L,Haque E,Liu H.Subspace clustering for high dimensional data:a rcvicw[J].ACM SIGKDD Explorations Newsletter, 2004,6( 1 ) :90-105.
  • 6Berkhin P.Survey of clustering data mining techniques[M]//Kogan J, Nicholas C, TebouUe M.G-rouping multidimensional data: recent advances in clustering.Berlin:Springer-Verlag,2006:25-71.
  • 7Aggarwal C C, Procopiuc C, Wolf J L, et al.Fast algorithm for projected clustering[C]//Delis A, Faloutsos C, Ghandeharizadeheds S.Proc of the ACM-SIGMOD.New York:ACM Press,1999: 61-71.
  • 8Agrawal R, Gehrke J, Gunopulos D, et al.Automatic subspace clustering of high dimensional data[J].Data Mining and Knowledge Discovery, 2005,11 (1) : 5-33.
  • 9Domeniconi C, Gunopulos D, Ma S, et al.Locally adaptive metrics for clustering high dimensional data[J].Data Mining and Knowledge Discovery,2007,14( 1 ) :63-97.
  • 10Jing L,Ng M K,Huang J Z.An entropy weighting k-means algorithm for subspace clustering of high-dimensional sparse data[J]. IEEE Trans on Knowledge and Data Engineering,2007, 19(8): 1-16.

二级参考文献1

共引文献32

同被引文献10

引证文献1

二级引证文献8

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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