A counting mining algorithm of maximum frequent itemset based on matrix

Mining frequent itemset is an important research topic in association rule area. There are two main kinds of Algorithm: Apriori Algorithm and FP- growth Algorithm and their varieties. Generating candidate itemset of Apriori and traversing tree nodes of FP-growth affect the efficiency of data mining. This paper puts forward the new simplified algorithm: eliminating and plotting blocks to the matrix with simply counting rows and columns, thus, to find out maximal frequent itemset. The experiment results show that the algorithm can improve mining efficiency.