摘要
提出一种基于二进制的约束性关联规则挖掘算法,用数字区间确定候选频繁项的范围,通过数值的递增/减方式交叉产生候选项,利用二进制的逻辑操作计算支持数,并用数字特征减少扫描事务数,以提取满足约束条件的关联规则。该算法适于挖掘任何长度的约束性频繁项目集,且具有较高的运算效率。
An Algorithm of Constrained Association Rules Mining Based on Binary（ACARMB） is presented, which uses digital section to ascertain rang of candidate frequent items that can crosswise generate candidate items by the methods about digital ascending and descending, computes support by binary logic operation and uses digital character to reduce the number of scanned transactions, and extracts association rules satisfied with Constrained Condition（CC）. This algorithm is suitable for mining any length frequent item sets, and has higher efficiency for calculation.
出处
《计算机工程》
CAS
CSCD
北大核心
2009年第7期78-81,共4页
Computer Engineering
关键词
关联规则
约束条件
交叉搜索
数字特征
二进制
association rules
Constrained Condition（CC）
crossing search
digital character
binary
