摘要
提出一种事务互补的挖掘算法,其适合挖掘任何长度的频繁项目集。该算法用事务互补搜索策略产生候选项,使用频繁项目集修剪其子集和非频繁项目集修剪其超集策略减少候选项;在计算支持数时使用了二进制的逻辑运算和事务特性,提高了算法的效率。将其应用到横向空间关联规则挖掘中,实验表明该算法是快速而有效的。
An algorithm of transaction complement mining is presented,which uses transaction complement search strategy to generate candidate-items,the number of which is reduced by pruning subsets of frequent item sets and superset of non-frequent item sets,and further uses binary logic operation and transaction character to count support,its efficiency is improved.The algorithm is used to extract transverse spatial association rules,and its experiment indicates that the efficiency is fast and efficient.
出处
《计算机工程与应用》
CSCD
北大核心
2008年第35期168-170,共3页
Computer Engineering and Applications
关键词
数据挖掘
关联规则
二进制
互补挖掘
空间关联
data mining
association rules
binary
complement mining
spatial association
