{'fraction_non_alphanumeric': 0.012517385257301807, 'fraction_numerical': 0.0, 'mean_word_length': 5.728971962616822, '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 Rough Set Based Associative Classifier

Associative Classification integrates both association rule mining and classification tasks. Many studies show that associative classifiers give better accuracy than other traditional classifiers. Traditional classification techniques such as decision trees and RIPPER use heuristic search methods to perform classification. Associative classification system is more robust and makes predictions based on entire dataset. In this paper, we use rough sets for feature reduction. We have also introduced two new criteria for ranking the association rules. This improves the overall accuracy of the classifier. Our preliminary results with some UCIML datasets are very encouraging.