.png){kind=icon}
返回
An improved data mining approach using predictive itemsets
.png){kind=icon}
PRE
AI
DOI：10.1016/j.eswa.2007.09.009.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we present a mining algorithm to improve the efficiency of. finding large itemsets. Based on the concept of prediction proposed in the (n, p) algorithm, our method considers the data dependency in the given transactions to predict promising and non-promising candidate itemsets. Our method estimates for each level a different support threshold that is derived from a data dependency parameter and determines whether an item should be included in a promising candidate itemset directly. In this way, we maintain the efficiency of. finding large itemsets by reducing the number of scanning the input dataset and the number candidate items. Experimental results show our method has a better efficiency than the apriori and the (n, p) algorithms when the minimum support value is small. (C) 2007 Elsevier Ltd. All rights reserved.
Keyword:
Data mining
Association rule
Predictive itemset
Data dependency
Predicting minimum support
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.5
论文数:
3.0W
被引数:
10.2W
机构
引用论文
分享收藏Phytochemical Analysis and Antioxidant Activity of Brotowali (Tinospora crispa L. Mier) Stem.png)
Molekul
OAAI
MolekulIF0
OAAI分享收藏
查看更多内容