摘要
针对Apriori算法存在的缺陷,提出一种改进的关联规则算法。该算法对数据库中的项采用二进制编码,且只需扫描一次事物数据库就能找出所有的频繁项集,减少了扫描数据库的次数和计算成本,从而大大提高了算法的执行效率。
According to the inefficiency problems about the Apriori algorithm,this thesis proposes a new improved algorithm of association rules.This algorithm uses the binary code to the database item.This algorithm is able to discover all the frequent item sets only by searching the database once.Because this algorithm reduces the number of scanning the database and computational cost,so it has higher efficiency.
出处
《电脑知识与技术（过刊）》
2012年第2X期1015-1018,共4页
Computer Knowledge and Technology
