A concise method for feature selection via normalized frequencies
원문 초록
Feature selection is an important part of building a machine learning model. By eliminating redundant or misleading features from data, the machine learning model can achieve better performance while reducing the demand on com-puting resources. Metaheuristic algorithms are mostly used to implement feature selection such as swarm intelligence algorithms and evolutionary algorithms. However, they suffer from the disadvantage of relative complexity and slowness. In this paper, a concise method is proposed for universal feature selection. The proposed method uses a fusion of the filter method and the wrapper method, rather than a combination of them. In the method, one-hoting encoding is used to preprocess the dataset, and random forest is utilized as the classifier. The proposed method uses normalized frequencies to assign a value to each feature, which will be used to find the optimal feature subset. Furthermore, we propose a novel approach to exploit the outputs of mutual information, which allows for a better starting point for the experiments. Two real-world dataset in the field of intrusion detection were used to evaluate the proposed method. The evaluation results show that the proposed method outperformed several state-of-the-art related works in terms of accuracy, precision, recall, F-score and AUC.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
A Lightweight IDS for Early APT Detection Using a Novel Feature Selection Method
A Systematic Review of Metaheuristics-Based and Machine Learning-Driven Intrusion Detection Systems in IoT
A Scalable Hierarchical Intrusion Detection System for Internet of Vehicles
Enhanced network anomaly detection based on deep neural networks
ExploreKit: Automatic Feature Generation and Selection
Interpretable Bayesian Tensor Network Kernel Machines with Automatic Rank and Feature Selection
토론
이 논문과 연결된 포럼 글이 아직 없습니다.