{'fraction_non_alphanumeric': 0.013360739979445015, 'fraction_numerical': 0.0, 'mean_word_length': 5.1645569620253164, '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 New Hybrid Associative Classification Algorithm Based on OR-Tree and Pruning Skills

A new hybrid associative classification algorithm based on Order-tree and pruning skills is proposed to solve the problems that there are always too much time consuming and the searching spaces are always too large in traditional associative classification algorithm. In the method a structure of the orderly rules of the tree (OR-tree) is been designed to store the information of the classification rules so that the association rules can be organized when generated, meanwhile, a series of pruning skills that face the rule sets and the candidate classification rules are proposed to optimize the OR-tree. The experiment results show that the new hybrid associative classification algorithm based on OR-tree and pruning skill can not only reduce the searching space of frequent sets and the time consuming effectively, but also improve the mining efficiency of the associative rules.