Association Rule Tree Algorithm Based On Binary Information Granules

The classic association rules, Apriori algorithm and Fptree algorithm, are briefly illustrated to figure out the weakness of those algorithms. Then we develop an association rule tree algorithm from the idea of binary information granules. The algorithm retrieves the association rules from the association rule free by computing of binary information granules, of which a system is converted from a transaction database. Finally, we discuss the practicality and feasibility of this approach with the actual instances and relevant reasoning of theorem.