{'fraction_non_alphanumeric': 0.014061207609594707, 'fraction_numerical': 0.0016542597187758478, 'mean_word_length': 5.836158192090395, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
A Naive Feature Selection Method and Its Application in Network Intrusion Detection

Network intrusion detection system needs to handle huge data selected from network environments which usually contain lots of irrelevant or redundant features. It makes intrusion detection with high resource consumption, as well as results in poor performance of real-time processing and intrusion detection rate. Without loss of generality, feature selection can effectively improve the classification model performance, study on the feature selection-based intrusion detection method is therefore very necessary. This paper proposes a simple and quick inconsistency-based feature selection method. Data inconsistency is firstly employed to find the optimal features, and the sequential forward search is then utilized to facilitate the selection of subset features. The tests on KDD99 benchmark data show that the proposed feature selection method can directly eliminate irrelevant and redundant features, without degenerating the classification performance. Furthermore, due to experiments, the intrusion detection performance using the proposed method is also a little advantageous than that with the general CFS method.