关键词: 数据挖掘, 关联规则, 邻接矩阵, 频繁模式树

Abstract: In view of the association rule mining technology and the research and analysis of its classic Apriori algorithm and FP-growth algorithm, an advanced frequent itemsets mining algorithm is proposed. The improved algorithm stores database using of matrix and calculates itemsets’ support number in terms of the matrix operation, which reduces the number of times for database scanning. The algorithm creates frequent pattern tree using of orderly frequent item adjacency matrix, which effectively reduces the branch and layer of the tree. Finally the examples analyze the frequent itemsets of mining process.

Key words: data mining, association rules, adjacency matrix, frequent pattern tree