PCA-AKM算法及其在入侵检测中的应用

doi:10.11896/j.issn.1002-137X.2018.02.039

摘要/Abstract

摘要： 初始聚类中心是指在聚类的过程中首次被选为中心的点或对象。针对传统的K-means算法由于随机选择初始聚类中心而造成的聚类结果不稳定的问题,提出PCA-AKM算法。该算法利用主成分分析方法提取数据集中的主要成分,实现数据降维,使用自定义指标密权值选择初始聚类中心,避免聚类中心局部最优问题。将该算法与K-means算法在UCI数据集上进行聚类对比,其聚类稳定性高于传统K-means算法。在KDD CUP99数据集上,对所提算法进行入侵检测仿真,实验结果证明该算法检测率高,误检率低,能够有效提高入侵检测的准确率。

关键词: K均值算法,主成分分析,密权值,入侵检测

Abstract: The initial clustering center is the point or object selected for the first time in the clustering process.Aiming at the instability of clustering results in traditional K-means algorithm caused by choosing the initial clustering centers randomly,the PCA-AKM algorithm was proposed.The algorithm uses the principal component analysis to extract the main components of the data set to achieve data dimensionality reduction,and then uses the self-defined indicators Dw to choose the initial clustering centers,avoiding the clustering center local optimum.Comparison with the K-means algorithm on the UCI data set proves that the clustering stability of the PCA-AKM algorithm is higher than that of K-means.Experiment proves that the algorithm has high detection rate and low false detection rate on KDD CUP99 data set when it is used to simulate intrusion detection,and the algorithm can improve the accuracy of intrusion detection effectively.

Key words: K-means algorithm,Principal component analysis,Dw,Intrusion detection

牛雷,孙忠林. PCA-AKM算法及其在入侵检测中的应用[J]. 计算机科学, 2018, 45(2): 226-230. https://doi.org/10.11896/j.issn.1002-137X.2018.02.039

NIU Lei and SUN Zhong-lin. PCA-AKM Algorithm and Its Application in Intrusion Detection System[J]. Computer Science, 2018, 45(2): 226-230. https://doi.org/10.11896/j.issn.1002-137X.2018.02.039

参考文献

[1] ZHOU W B,SHI Y X.Optimization algorithm of K-means clustering center of selection based on density[J].Application Research of Computers,2012,9(5):1726-1728.(in Chinese) 周炜奔,石跃祥.基于密度K-means聚类中心选取的优化算法[J].计算机应用研究,2012,9(5):1726-1728.
[2] ZHAI D H,YU J,GAO F,et al.K-means text clustering algorithm based on initial cluster centers selection according to ma-ximum distance[J].Application Research of Computers,2014,1(3):713-715,719.(in Chinese) 翟东海,鱼江,高飞,等.最大距离法选取初始簇中心的K-means文本聚类算法的研究[J].计算机应用研究,2014,1(3):713-715,719.
[3] FENG B,HAO W N,CHEN G,et al.Optimization to K-means initial cluster centers[J].Computer Engineering and Applications,2013,9(14):182-185,192.(in Chinese) 冯波,郝文宁,陈刚,等.K-means算法初始聚类中心选择的优化[J].计算机工程与应用,2013,9(14):182-185,192.
[4] AN J Y,YAN Z J,ZHAI J X.K-means Clustering Algorithm Based on Distance Threshold and Weighted Sample[J].Microelectronics & Computer,2015(8):135-138.(in Chinese) 安计勇,闫子骥,翟靖轩.基于距离阈值及样本加权的K-means聚类算法[J].微电子学与计算机,2015(8):135-138.
[5] FU T,SUN Y M.PSO-based k-means Algorithm and its Application in Network Intrusion Detection System[J].Computer Science,2011,8(5):54-55,73.(in Chinese) 傅涛,孙亚民.基于PSO的k-means算法及其在网络入侵检测中的应用[J].计算机科学,2011,8(5):54-55,73.
[6] YUE S H,WANG J S,TAO G,et al.An unsupervised grid-based approach for clustering analysis[J].Science China(Information Sciences),2010,3(7):1345-1357.
[7] LI T T.The Research of K-means Clustering Algorithm-Im-provement[D].Hefei:Anhui University,2015.(in Chinese) 李婷婷.改进K-means聚类算法的研究[D].合肥:安徽大学,2015.
[8] ZHANG X F,ZHANG G Z,LIU P.Improved K-means algorithm based on clustering criterion function[J].Computer Engineering and Applications,2011,7(11):123-127.(in Chinese) 张雪凤,张桂珍,刘鹏.基于聚类准则函数的改进K-means算法[J].计算机工程与应用,2011,7(11):123-127.
[9] KATSAVOUNIDIS I,JAY KUO C C,ZHANG Z.A new initialization technique for generalized Lloyd iteration[J].Signal Processing Letters,1994,1(10):144-146.
[10] BOUTSIDIS C,ZOUZIAS A,MAHONEY M W,et al.Rando-mized Dimensionality Reduction for k-Means Clustering[J].IEEE Transactions on Information Theory,2011,61(2):1045-1062.
[11] WANG J,KE Q,et al.Fast approximate k-means via cluster closures[C]∥IEEE Conference on Computer Vision and Pattern Recognition.IEEE Computer Society,2012:3037-3044.
[12] XIONG K L,PENG J J,YANG X F,et al.K-means Clustering Optimization Based on Kernel Density Estimation[J].Computer Technology and Development,2017,27(2):1-5.(in Chinese) 熊开玲,彭俊杰,杨晓飞,等.基于核密度估计的K-means聚类优化[J].计算机技术与发展,2017,27(2):1-5.
[13] ZHUANG R G,NI Z B,LIU X Y.A Novel Method for Refining the Initial Points for K-means Clustering Based on Quasi-Monte Carlo Method[J].Journal of University of Jinan(Science and Technology),2017,31(1):35-41.(in Chinese) 庄瑞格,倪泽邦,刘学艺.基于拟蒙特卡洛的K均值聚类中心初始化方法[J].济南大学学报(自然科学版),2017,31(1):35-41.
[14] LI M,ZHANG G Z.K-means Algorithm of Optimized InitialCenter By Density Peaks[J].Computer Applications and Software,2017,34(3):212-217.(in Chinese) 李敏,张桂珠.密度峰值优化初始中心的K-means算法[J].计算机应用与软件,2017,34(3):212-217.
[15] YUAN T F.Research on Intrusion Detection Based on DataMining[D].Chengdu:University of Electronic Science and Technology of China,2014.(in Chinese) 袁腾飞.基于数据挖掘的入侵检测系统研究[D].成都:电子科技大学,2014.
[16] CHENG J.The Research of Fusion Algorithms for SupportVector Machine and K-means Clustering[D].Dalian:Liaoning Normal University,2008.(in Chinese) 程佳.支持向量机与K-均值聚类融合算法研究[J].大连:辽宁师范大学,2008.
[17] YU H T,JIA M J,WANG H Q,et al.K-means Clustering Algorithm Based on Artificial Fish Swarm[J].Computer Science,2012,9(12):60-64.(in Chinese) 于海涛,贾美娟,王慧强,等.基于人工鱼群的优化K-means聚类算法[J].计算机科学,2012,9(12):60-64.
[18] XIAO L Z,LIU Y X,CHEN L Q.Research of Accelerating K-Means Algorithm Based on New Particle Swarm Optimization for Intrusion Detection[J].Journal of System Simulation,2014,6(8):1652-1657.(in Chinese) 肖立中,刘云翔,陈丽琼.基于改进粒子群的加速K均值算法在入侵检测中的研究[J].系统仿真学报,2014,6(8):1652-1657.

Metrics

Viewed

Full text

Abstract

Cited

Shared

Discussed