.png){kind=icon}
返回
Incremental association rule mining: a survey
.png){kind=icon}
PRE
AI
DOI：10.1002/widm.1086.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Association rule mining is a computationally expensive task. Despite the huge processing cost, it has gained tremendous popularity due to the usefulness of association rules. Several efficient algorithms can be found in the literature. This paper provides a comprehensive survey on the state-of-the-art algorithms for association rule mining, specially when the data sets used for rule mining are not static. Addition of new data to a data set may lead to additional rules or to the modification of existing rules. Finding the association rules from the whole data set may lead to significant waste of time if the process has started from the scratch. Several algorithms have been evolved to attend this important issue of the association rule mining problem. This paper analyzes some of them to tackle the incremental association rule mining problem. (c) 2013 Wiley Periodicals, Inc.
Keyword:
EFFICIENT ALGORITHMS
MAINTENANCE
GENERATION
DISCOVERY
FRAMEWORK
PATTERNS
UPDATE
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
11.7
论文数:
548
被引数:
5.3K
机构
引用论文
Progressive partition miner: An efficient algorithm for mining general temporal association rules
PREAI
分享收藏分享收藏High-temperature oxidation resistance of VCps-reinforced Fe-matrix composites using an in-situ reaction.png)
AIP Advances
OAAI
AIP AdvancesIF0
OAAI分享收藏分享收藏
查看更多内容