%0 Journal Article
%T Association rules mining algorithm based on binary<br>基于二进制的关联规则挖掘算法
%A FAN Ping
%A LIANG Jia-rong
%A LI Tian-zhi
%A GONG Jian-min
%A <br>范平
%A 梁家荣
%A 李天志
%A 巩建闽
%J 计算机应用研究
%D 2007
%I 
%X This paper proposed a novel idea of binary-based association rules mining algorithm. There some transaction items were the same in a database. It was not necessary to work out the pure subsets for everyone but only to aim at every kind of them. With this algorithm all frequent itemsets could be minded by scanning the database only one time. The algorithm was very efficient and effective compaxed to the traditional methods. When the rain-support and rain-confidence were modified, it could get the frequent itemsets easily without scanning the database again.
%K binary
%K association rules
%K frequent itemset
%K pure subsets<br>二进制
%K 关联规则
%K 频繁集
%K 真子集
%K 二进制
%K 关联
%K 规则挖掘算法
%K binary
%K based
%K algorithm
%K mining
%K rules
%K 挖掘效率
%K 频繁项集
%K 修改
%K 最小置信度
%K 最小支持度
%K 需求
%K 频繁集
%K 事务数据库
%K 扫描
%K 求解算法
%K 真子集
%K 优势
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=A9D9BE08CDC44144BE8B5685705D3AED&aid=C793235A4E87B8F6D006ED787C46AC3D&yid=A732AF04DDA03BB3&vid=B91E8C6D6FE990DB&iid=5D311CA918CA9A03&sid=9C65ADEB5990B252&eid=E203FB1A272C9DD2&journal_id=1001-3695&journal_name=计算机应用研究&referenced_num=0&reference_num=6