%0 Journal Article
%T Algorithm of Frequent Itemsets Mining Based on Upper Triangular Itemsets Matrix<br>一种基于上三角项集矩阵的频繁项集挖掘算法*
%A 黄龙军
%A 段隆振
%A 章志明
%J 计算机应用研究
%D 2006
%I 
%X 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.
%K Data Mining
%K Association Rules
%K Frequent Itemsets
%K UTIM(Upper Triangular Itemsets Matrix)<br>数据挖掘
%K 关联规则
%K 频繁项集
%K 上三角项集矩阵
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=A9D9BE08CDC44144BE8B5685705D3AED&aid=283064BA6CC3B411E98DAE9367C930A4&yid=37904DC365DD7266&vid=EA389574707BDED3&iid=708DD6B15D2464E8&sid=C5154311167311FE&eid=96C778EE049EE47D&journal_id=1001-3695&journal_name=计算机应用研究&referenced_num=0&reference_num=0