Algorithm of Frequent Itemsets Mining Based on Upper Triangular Itemsets Matrix
一种基于上三角项集矩阵的频繁项集挖掘算法*

This article proposes an algorithm of frequent itemsets mining based on Upper Triangular Itemsets Matrix (UTIM), by analyzing the way and efficiency that Apriori algorithm discovers frequent itemsets. The algorithm scans database only once, does not create candidate itemsets, and does not use the method of iteration for each layer. The efficiency is distinctly improved in discovers frequent itemsets.