虫虫首页| 资源下载| 资源专辑| 精品软件
登录| 注册

APriori

APriori算法是第一个关联规则挖掘算法,也是最经典的算法。它利用逐层搜索的迭代方法找出数据库中项集的关系,以形成规则,其过程由连接(类矩阵运算)与剪枝(去掉那些没必要的中间结果)组成。该算法中项集的概念即为项的集合。包含K个项的集合为k项集。项集出现的频率是包含项集的事务数,称为项集的频率。如果某项集满足最小支持度,则称它为频繁项集。[1]
  • Many of the pattern fi nding algorithms such as decision tree, classifi cation rules and c

    Many of the pattern fi nding algorithms such as decision tree, classifi cation rules and clustering techniques that are frequently used in data mining have been developed in machine learning research community. Frequent pattern and association rule mining is one of the few excep- tions to this tradition. The introduction of this technique boosted data mining research and its impact is tremendous. The algorithm is quite simple and easy to implement. Experimenting with APriori-like algorithm is the fi rst thing that data miners try to do.

    标签: 64257 algorithms decision pattern

    上传时间: 2014-01-12

    上传用户:wangdean1101

  • APriori的Java代码

    可以运行。很有用的。这几天写论文,我专门实验过的。数据库是UCI里面的任何一个

    标签: APriori

    上传时间: 2015-05-19

    上传用户:liangziheng

  • APriori算法

    apiori是是比较基本的秋频繁项集的算法,其他的一些算法都是基于该算法改进和优化的,是经典的算法

    标签: 关联规则 频繁项集 大数据 网站推送基本算法 啤酒与尿布

    上传时间: 2016-11-25

    上传用户:lyivan