%0 Journal Article
%T Improvement of Eclat algorithm for association rules based on hash Boolean matrix<br>基于散列布尔矩阵的关联规则Eclat改进算法*
%A XIONG Zhong-yang
%A CHEN Pei-en
%A ZHANG Yu-fang
%A <br>熊忠阳
%A 陈培恩
%A 张玉芳
%J 计算机应用研究
%D 2010
%I 
%X Taking the hash table with a combination of Boolean matrix, this paper proposed an improvement of Eclat algorithm for association rules based on hash Boolean matrix, by increasing the intersection speed of the algorithm to speed up the process of frequent set. The experimental result demonstrates that the improved Eclat algorithm in the calculation of performance and time efficiency are superior to the traditional algorithm.
%K vertical data layout
%K intersection
%K hashing
%K Boolean matrix
%K frequent itemset<br>垂直数据表示
%K 交集
%K 散列
%K 布尔矩阵
%K 频集
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=A9D9BE08CDC44144BE8B5685705D3AED&aid=DDF92AAD4F97669A74514B7D92183846&yid=140ECF96957D60B2&vid=DB817633AA4F79B9&iid=E158A972A605785F&sid=9F0564033BABD14F&eid=E84660E787B699A9&journal_id=1001-3695&journal_name=计算机应用研究&referenced_num=0&reference_num=12