Feature selection algorithm of network attack big data under the interference of fading noise

被引:0
作者
Zheng X. [1 ]
机构
[1] Information and Network Center, Minnan Normal University, Zhangzhou
关键词
big data; Fading noise; feature selection; network attack;
D O I
10.1080/1206212X.2019.1703327
中图分类号
学科分类号
摘要
In order to detect the existence of big data with aggressive behavior in the network, it is necessary to study the feature selection algorithm of network attack big data. When the current feature selection algorithm is used to select the big data features with aggressive behavior in the network, the interference is highly impacted by fading noise, and the calculated feature importance is inconsistent with reality. But these algorithms have poor anti-interference performance and low accuracy of feature selection. This paper proposes a feature selection algorithm of network attack big data under the interference of fading noise, removes the fading noise in the network through wavelet threshold denoising method, and uses the self-coding deep neural network method to reduce the dimensionality of network attack big data. Based on the results of data dimensionality reduction, the mutual information matrix is calculated and normalized to obtain a random matrix with the same form as the mutual information matrix. The importance of big data features is obtained by the mutual information matrix and the characteristic correlation matrix of the random matrix. According to the importance of features, the sorting of data features is completed, and features of high importance are selected as characteristics of network attack big data to complete feature selection of network attack big data under the interference of fading noise. Experimental results show that the proposed method has strong anti-interference and high feature selection accuracy. © 2019 Informa UK Limited, trading as Taylor & Francis Group.
引用
收藏
页码:807 / 813
页数:6
相关论文
共 15 条
[1]  
Ambusaidi M.A., He X., Nanda P., Et al., Building an intrusion detection system using a filter-based feature selection algorithm, IEEE Trans Comput, 65, pp. 2986-2998, (2016)
[2]  
Lin K.C., Zhang K.Y., Huang Y.H., Et al., Feature selection based on an improved cat swarm optimization algorithm for big data classification, J Supercomput, 72, pp. 3210-3221, (2016)
[3]  
Brankovic A., Falsone A., Prandini M., Et al., A feature selection and classification algorithm based on randomized extraction of model populations, IEEE Trans Cybern, 4, pp. 1151-1162, (2017)
[4]  
Priya R.D., Sivaraj R., Dynamic genetic algorithm-based feature selection and incomplete value imputation for microarray classification, Curr Sci, 112, (2017)
[5]  
Ji S.Q., Shi H.B., Lv Y.L., Et al., Feature selection algorithm based on granulation-fusion for massive high-dimension data, Pattern Recogn Artif Intell, 7, pp. 90-597, (2016)
[6]  
Zhang J., Wang S.M., Reproducing kernel Hilbert space mapping based feature selection algorithm for high dimensional data, Appl Res Comput, 12, pp. 3539-3542, (2016)
[7]  
Qin K., Simulation of Correct Identification of information feature in the process of incomplete semantic Cognition, Comput S, 2, pp. 242-245, (2017)
[8]  
Dong H.B., Teng X.Y., Yang X., Feature selection based on the measurement of correlation information entropy, J Comput Res Dev, 8, pp. 1684-1695, (2016)
[9]  
Senoussi H., Chebel-Morello B., Denai M., Et al., Feature selection for fault detection systems: Application to the Tennessee Eastman process, Appl Intell, 1, pp. 111-122, (2016)
[10]  
Feng J., Jiao L., Liu F., Et al., Unsupervised feature selection based on maximum information and minimum redundancy for hyperspectral images, Pattern Recogn, 51, pp. 295-309, (2016)