Abstract
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 tree 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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
