| 关联规则挖掘的优化算法 |
 点此下载全文 |
| 引用本文：刘振宇， 徐维祥.关联规则挖掘的优化算法[J].计算技术与自动化,2013,(2):56-59 |
| 摘要点击次数: 1326 |
| 全文下载次数: 98 |
|
|
| 中文摘要:频繁项集挖掘是关联规则挖掘的核心部分，目前大多数关于关联规则挖掘的研究都集中于如何提高频繁项集挖掘的效率，然而在实际应用中，决策者面对的是最终从频繁项集中生成的规则集，因此优化规则的生成过程及生成规则同样值得重视。本文提出频繁项集的子集树这一模式来生成关联规则，不仅简化规则的生成过程还可缩小决策者面对的规则集，更便于规则的增量更新。 |
| 中文关键词:频繁项集 关联规则 项集子集树 |
| |
| An Algorithm for Optimizing of Association Rules Mining |
|
|
| Abstract:Frequent Itemsets Mining is the core component of association rules mining. Most current research on the association rules mining have focused on improving the efficiency of frequent itemset mining. But in the real application, users always face the ultimate association rules generated from frequent itemsets to make decision, so how to optimize the rule generation process and the result is also worthy to pay more attention. This paper presents a subset tree of frequent itemset to generate association rules which not only simplify the generation process and result of association but also facilitate the incremental updates of association rules. |
| keywords:frequent itemset association rules subset tree of frequent itemset |
| 查看全文 查看/发表评论 下载pdf阅读器 |
次