scholarly journals Research on WebShell Detection Method Based on Regularized Neighborhood Component Analysis (RNCA)

Symmetry ◽  
2021 ◽  
Vol 13 (7) ◽  
pp. 1202
Author(s):  
Aijun Zhou ◽  
Nurbol Luktarhan ◽  
Zhuang Ai
Keyword(s):  
Feature Selection ◽  
Detection Method ◽  
Recognition Rate ◽  
Reference Value ◽  
Component Analysis ◽  
Main Research ◽  
Sequence Features ◽  
Single Feature ◽  
Opcode Sequence ◽  
Detection Effect

The variant, encryption, and confusion of WebShell results in problems in the detection method based on feature selection, such as poor detection effect and weak generalization ability. In order to solve this problem, a method of WebShell detection based on regularized neighborhood component analysis (RNCA) is proposed. The RNCA algorithm can effectively reduce the dimension of data while ensuring the accuracy of classification. In this paper, it is innovatively applied to a WebShell detection neighborhood, taking opcode behavior sequence features as the main research object, constructing vocabulary by using opcode sequence features with variable length, and effectively reducing the dimension of WebShell features from the perspective of feature selection. The opcode sequence selected by the algorithm is symmetrical with the source code file, which has great reference value for WebShell classification. On the issue of the single feature, this paper uses the fusion of behavior sequence features and text static features to construct a feature combination with stronger representation ability, which effectively improves the recognition rate of WebShell to a certain extent.

Study on Portrait Tracking Technology of Deep Feature Learning in Monitoring Image Acquisition

2021 ◽  
Author(s):  
Senlin Yang ◽  
Xin Chong
Keyword(s):  
Feature Selection ◽  
Image Acquisition ◽  
Recognition Rate ◽  
Particle Swarm ◽  
Feature Subset ◽  
Particle Structure ◽  
Recognition Time ◽  
Traditional Methods ◽  
Deep Feature ◽  
Global Optimal

In a network information society, there are many occasions where people’s behaviors need to be tracked, photographed, and recognized. Biometric recognition technologies are considered to be one of the most effective solutions. Traditional methods mostly use graph structure and deformed component model to design two-dimensional (2D) human body component detectors, and apply graph models to establish the connectivity of each component. The recognition design process is simple, but the accuracy of recognition and tracking effect applied in monitoring image acquisition is not high. The improved particle swarm optimization algorithm is used to determine the particle structure, and the binary bit string is used to represent the particle structure. The support vector machine (SVM) parameters of discrete particles are optimized, and the synchronous optimization design of feature selection and SVM parameters is carried out to realize the synchronous optimization of portrait feature subset and SVM parameters in discrete space. Through in-depth research, the extracted feature subsets can be effectively optimized and selected, and the parameters of SVM model can be optimized synchronously. The discrete particle structure is associated with the SVM parameters to achieve feature selection and SVM parameter synchronization and optimization. It is not only superior to traditional algorithms in terms of recognition rate, but also reduces the feature dimension and shortens the recognition time. The deep feature recognition built on the learning machine is not easy to diverge and can effectively adjust the particle speed to the global optimal, which is more effective than the particle swarm algorithm to search for the global optimal solution, and has better robustness. In the experiments, the research content of the article is compared with the traditional methods to test and analysis. The results show that the method optimizes the selection of feature subset and eliminates a large number of invalid features. The method not only reduces space complexity and shortens recognition time, but also improves recognition rate. The dimension of feature subset dimensions are superior to those extracted by other algorithms.

Predicting the Severity of Bug Reports Based on Feature Selection

2018 ◽  
Vol 28 (04) ◽  
pp. 537-558 ◽  
Author(s):  
Wenjie Liu ◽  
Shanshan Wang ◽  
Xin Chen ◽  
He Jiang
Keyword(s):  
Feature Selection ◽  
Software Maintenance ◽  
Feature Selection Method ◽  
Selection Methods ◽  
Selection Algorithm ◽  
Feature Selection Algorithm ◽  
Bug Reports ◽  
Single Feature ◽  
Bug Report ◽  
Severity Prediction

In software maintenance process, it is a fairly important activity to predict the severity of bug reports. However, manually identifying the severity of bug reports is a tedious and time-consuming task. So developing automatic judgment methods for predicting the severity of bug reports has become an urgent demand. In general, a bug report contains a lot of descriptive natural language texts, thus resulting in a high-dimensional feature set which poses serious challenges to traditionally automatic methods. Therefore, we attempt to use automatic feature selection methods to improve the performance of the severity prediction of bug reports. In this paper, we introduce a ranking-based strategy to improve existing feature selection algorithms and propose an ensemble feature selection algorithm by combining existing ones. In order to verify the performance of our method, we run experiments over the bug reports of Eclipse and Mozilla and conduct comparisons with eight commonly used feature selection methods. The experiment results show that the ranking-based strategy can effectively improve the performance of the severity prediction of bug reports by up to 54.76% on average in terms of [Formula: see text]-measure, and it also can significantly reduce the dimension of the feature set. Meanwhile, the ensemble feature selection method can get better results than a single feature selection algorithm.

Sign in / Sign up

Export Citation Format

Share Document