Affiliation:
1. College of Information Science and Engineering, Yanshan University, Qinhuangdao, P.R. China
2. Qinhuangdao Vocational and Technical College, Qinhuangdao, P.R. China
Abstract
For the unsupervised learning based clustering algorithm, the intrusion detection rate is low, and the training sample based on supervised learning clustering algorithm is insufficient. A semi-supervised kernel fuzzy C-means clustering algorithm based on artificial fish swarm optimization (AFSA-KFCM) is proposed. Firstly, the kernel function is used to change the distance function in the traditional semi-supervised fuzzy C-means clustering algorithm to define a new objective function, thus improving the probabilistic constraints of the fuzzy C-means algorithm. Then, the artificial fish swarm algorithm with strong global optimization ability is used to improve the KFCM sensitivity to the initial cluster center and easy to fall into the local extremum, thus improving the convergence speed and improving the classification effect. The test results in the Wine and IRIS public datasets show that the AFSA-KFCM clustering algorithm is superior to the traditional algorithm in clustering accuracy and time efficiency. At the same time, the experimental results in KDDCUP99 experimental data show that the algorithm can obtain the ideal detection rate and false detection rate in intrusion detection.
Subject
Artificial Intelligence,General Engineering,Statistics and Probability
Reference21 articles.
1. Network security;Lee;Engineering & Technology Reference,2014
2. Network security and contagion;Acemoglu;Journal of Economic Theory,2014
3. Physical layer network security in the full-duplex relay system;Chen;IEEE Transactions on Information Forensics & Security,2015
4. Collaborative network security in multi-tenant data center for cloud computing;Chen;Tsinghua Science & Technology,2014
5. Probabilistic threat propagation for network security;Carter;IEEE Transactions on Information Forensics & Security,2014
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献