{'fraction_non_alphanumeric': 0.01778242677824268, 'fraction_numerical': 0.0, 'mean_word_length': 5.056962025316456, '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 novel approach for feature selection using Rough Sets

Rough Set is a mathematical tool to find patterns hidden in data with uncertainty. A major step for reduction of high dimension data, present in various forms, is selection of appropriate features. In this work we propose a new indiscernibility relation based on clusters, and compare its effectiveness with that of classical Rough Set based indiscernibility. In particular, we study the proposed Rough Set based scheme for feature set reduction. Rough-Cluster (RC) based approximate algorithms are proposed. The major advantage of these algorithms over the classical method is that they work well even without data discretization. The accuracy, measured in terms of the proportion of correctly classified data samples, is obtained on various standard data sets. The results are found to be on par with those obtained through classical Rough Set based technique for the problem of feature selection.