A Fast Algorithm for Mining association Rules Based on Boolean Matrix

摘要

The discovery of association rules in data mining is an important issue, the core of which is the frequent pattern mining, Apriori algorithm is classical for the association rule mining, but it should repeatedly scan the database and can produce plenty of candidates. By examples, it is proved that Boolean Matrix Association Rules algorithm can improve the algorithmic efficiency by reducing the times of accessing database and without producing candidates.