{'fraction_non_alphanumeric': 0.009575923392612859, 'fraction_numerical': 0.0027359781121751026, 'mean_word_length': 5.151260504201681, '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}}
Feature Selection Using Rough Set in Intrusion Detection

Most of existing intrusion detection systems use all data features to detect an intrusion. Very little works address the importance of having a small feature subset in designing an efficient intrusion detection system. Some features are redundant and some contribute little to the intrusion detection process. The purpose of this study is to investigate the effectiveness of rough set theory in identifying important features in building an intrusion detection system. Rough set was also used to classify the data. Here, we used KDD Cup 99 data. Empirical results indicate that rough set is comparable to other feature selection techniques deployed by few other researchers