This paper proposes an efficient algorithm of double search mining association rules based on digital pure subset, which uses the method of forming digital pure subset of transaction to generate candidate itemsets, and uses digital character to reduce the number of scanned transactions when computing support of itemsets after these transactions are turned into digital transaction by binary. In addition, the algorithm uses logical operation to compute support of candidate itemsets, and uses the way of ascending value to form pure subset of digital transaction via maximal and minimal transactions synchronously close to intermediate value, which is different from traditional algorithms of double search mining association rules. The experiment indicates that the efficiency of the algorithm is faster and more efficient than presented algorithms of double search mining association rules.
['Yu-Lu Liu', 'Gang Fang', 'Jiang Xiong', 'Yuan-Bin Wu']
An Efficient Algorithm of Mining Association Rules Based on Digital Pure Subset