{'fraction_non_alphanumeric': 0.013032145960034752, 'fraction_numerical': 0.0, 'mean_word_length': 4.877551020408164, '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}}
Improved extraction of quantitative rules using Best M Positive Negative Association Rules Algorithm

Mining association rules is a fundamental data mining task. Association rule greatly help to identify trends and pattern from huge data set. Algorithms for mining association rules put more stress on positive rules rather than negative rules. Negative rules specify the attribute present in the data set to the attribute absent. In this paper we propose an algorithm BMPNAR, Best M Positive Negative Association Rules Algorithm, in order to get a reduced set of limited number of association rules which are then classified using Firefly algorithm. The algorithm BMPNAR is an extension to MOPNAR algorithm. It is a combination of MOPNAR and Topk algorithm. We let the user specify the number of rules to be generated. It gives us ranked association rules. These rules are then classified by applying FireFly algorithm for analysis purpose. The system designed is supposed to generate best M classified rules. The dataset used is Keel Dataset. We give the comparative study of previous and new algorithm in terms of execution time and space required.