Improved Apriori algorithm based on matrix

To the deficiency of Apriori algorithm, an improved Apriori algorithm based on the matrix is put forward. This algorithm converts the affair database to a matrix and operates it to find out the largest K-frequent itemsets, at last uses the matrix to find out all the other frequent itemsets from 2-frequent itemsets to K-1-frequent itemsets. Using an example shows the concrete process of the algorithm and comparing with other algorithms the advantages and disadvantages of the algorithm are expounded. This algorithm not only uses ma- trix and "AND operation" instead of the query operation in the database, but also greatly reduce the number of candidates of frequent itemsets, so the algorithm obtains the bonus time of calculating and improves the efficiency of computing.