一种基于编码的关联规则挖掘算法 关键词:关联规则;Apfiofi算法;频繁模式;候选项集 [gap=908]Key words:association rule;Apriori algorithm;frequent pattern;candidate items
基于24个网页-相关网页
It adopts the extending itemmethod and the dimensions hold the line . Except the last element of items, the otherkeeps the same, thus high rank candidate items are created.
该算法采用项扩展的方法,维保持不变,除项最后一个元素不同外,其余都要求相同,这样生成高阶候选项集。
参考来源 - 多维关联规则的研究·2,447,543篇论文数据,部分数据来源于NoteExpress
The result indicates that we can remarkably decrease the candidate items and improve the efficiency of mining frequent pattern when using the interest measure.
分析结果表明,利用规则兴趣度能够大大减小候选项目集的大小,有效提高频繁模式挖掘算法的效率。
In the process of association rules mining, the main factor of influencing the mining efficiency is that a large number of candidate items are came into being.
关联规则挖掘过程中,大量候选项集的产生成为影响挖掘效率提高的一个主要因素。
Since the existing catalog application is immutable, and the catalog items are largely read-only, this is an ideal candidate for the requester-side caching pattern.
由于现有 Catalog 应用程序不能修改,而 Catalog 项目大部分都是只读的,因此这就非常适合采用请求端缓存模式。
应用推荐