MINIMUM NON-REDUCTION ASSOCIATION RULE MINING METHOD BASED ON ITEM SUBSET EXAMPLE TREE

摘要

A minimum non-reduction association rule mining method based on an item subset example tree. The method comprises the following steps: generating an item subset in an example item database by using a closed itemset generated from a single item and a union operation of a set, the set being a proper subset of a power set of an itemset; constructing an item subset example tree structure of the example item database by using the generated item subset; mining a closed frequent itemset and a minimum generation element thereof in the item subset example tree and rapidly generating a minimum non-reduction association rule according to the mined closed frequent itemset and the minimum generation element thereof. By using the closed itemset generated from a single item, a plurality of item subsets can be obtained, the item subset example tree can be constructed, and hierarchical relationships between the item subsets and corresponding support levels thereof can be described, thus effectively reducing the number of retrievals between examples and items. The storage space is also effectively reduced at the same time, thereby increasing the speed and efficiency of mining the minimum non-reduction association rule.