Abstract
Association Rule represents a promising technique to find hidden patterns in database. The main issue about mining association rule in the large database. One of the most famous association rule learning algorithms is Apriori. Apriori algorithm is one of algorithms for generation of association rules. The drawback of Apriori Rule algorithm is the number of time to read data in the database equally number of each candidate were generated. Many research papers have been published trying to reduce the amount of time to read data from the database. In this paper, we propose a new algorithm that will work rapidly. Boolean Algebra and Compression technique for Association rule Mining (B-Compress) is applied to compress database and reduce the amount of times to scan database tremendously. Boolean Algebra combines, compresses, generates candidate itemset and counts the number of candidates. The construction method of B-Compress has ten times higher mining efficiency in execution time than Apriori Rule.KeywordsAssociation ruleApriori RuleBoolean algebraData mining
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.
