Mining Based on Association Rules of Decision Property

This paper puts forward efficient algorithm according to the database model that has decision property to mine association rules.Algorithm of matrix partition:the database is divided into two matrixes that contain different property,and use vector to mine frequent itemsets.Producing of rules can make use of the advantage of "and" operation to find support of the antecedent or the consequent.This algorithm reduced the production of candidate two-itemsets and amount of operation.Compare to apriori and other traditional algorithm,the advantage of algorithm efficiency rises obviously.