【24h】

An Improved Apriori Algorithm for Association Rules of Mining

机译:一种改进的Apriori关联规则挖掘算法

获取原文

摘要

Apriori --the classical association rules mining algorithm is a way to find out certain potential, regular knowledge from the massive ones. But there are two more serious defects in the data mining process. The first needs many times to scan the business database and the second will inevitably produce a large number of irrelevant candidate sets which seriously occupy the system resources. An improved method is introduced on the basic of the defects above. The improved algorithm only scans the database once, at the same time the discrete data and statistics related are completed, and the final one is to prune the candidate item sets according to the minimum supporting degree and the character of the frequent item sets. After analysis, the improved algorithm reduces the system resources occupied and improves the efficiency and quality.
机译:Apriori-经典的关联规则挖掘算法是一种从大量知识中找出某些潜在的常规知识的方法。但是,数据挖掘过程中存在两个更严重的缺陷。第一个需要多次扫描业务数据库,第二个将不可避免地产生大量不相关的候选集,这些候选集会严重占用系统资源。在上述缺陷的基础上,提出了一种改进的方法。改进后的算法只扫描数据库一次,同时完成了离散数据和相关统计的完成,最后一种是根据最小支持度和频繁项集的特点对候选项集进行删减。经过分析,改进算法减少了系统资源占用,提高了效率和质量。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号