Notice of RetractionThe comparative of Boolean Algebra Compress and Apriori Rule techniques for new theoretic Association Rule mining model

Notice of Retraction

After careful and considered review of the content of this paper by a duly constituted expert committee, this paper has been found to be in violation of IEEE´s Publication Principles.

We hereby retract the content of this paper. Reasonable effort should be made to remove all past references to this paper.

The presenting author of this paper has the option to appeal this decision by contacting TPII@ieee.org.

Data Mining refers to extracting or “mining” knowledge from large amounts of data. The Association Rule the one of technique to knowledge discovery. The Association Rule learning is a popular and well researched method for discovering interesting relations between variables in large databases. One of the most famous association rule learning algorithms is Apriori rule. 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 equal number of each candidate is generated. Many research papers have been published trying to reduce the amount of time needed to read data from the database. In this paper, we propose a new algorithm that will work rapidly. Boolean Algebra Compress technique for Association Rule Mining. Firstly, compress data. Secondly, reduce the amount of times to scan database tremendously. Thirdly, reduce file size. The construction method of Boolean Algebra Compress technique for association rule mining has ten times higher mining efficiency in execution time that Apriori Rule.