This paper presents an adaptive support for Boolean algorithm for mining association rules, the Algorithm does not require minimum support from outside, in the mining process of the algorithm will be based on user needs the minimum number of rules automatically adjust the scope of support to produce the specific number of rules, the algorithm number of rules for the user needs to generate the rules to a certain extent, reduce excavation time, avoid the artificial blindness specified minimum support. In addition, the core of the algorithm is using an efficient method of Boolean-type mining, using the logical OR, AND, and XOR operations to generate association rules, to avoided the candidate itemsets generated In the mining process, and only need to scan the database once, so the algorithm has a certain efficiency.
An Efficient Method for Generating Local Association Rules
