.png){kind=icon}
返回
Multi-level fuzzy mining with multiple minimum supports
.png){kind=icon}
PRE
AI
DOI：10.1016/j.eswa.2006.09.011.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Finding association rules in transaction databases is most commonly seen in data mining, In real applications, different items may have different support criteria to judge their importance, taxonomic relationships among items may appear, and data may have quantitative values. This paper thus proposes a fuzzy multiple-level mining algorithm for extracting knowledge implicit in quantitative transactions with multiple minimum supports of items. Items may have different minimum supports and the maximum-itemset minimum-taxonomy support constraint is adopted to discover the large itemsets. Under the constraint, the characteristic of downward-closure is kept, such that the original apriori algorithm can be easily extended to find fuzzy large itemsets. The proposed algorithm adopts a top-down progressively deepening approach to derive large itemsets. It can also discover cross-level fuzzy association rules under the maximum-itemset minimum-taxonomy support constraint. An example is also given to demonstrate that the proposed mining algorithm can derive the multiple-level association rules under multiple item supports in a simple and effective way. (c) 2006 Elsevier Ltd. All rights reserved.
Keyword:
data mining
fuzzy set
multiple minimum supports
quantitative value
taxonomy
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.5
论文数:
3.0W
被引数:
10.2W
机构
暂无机构信息
引用论文
UNE PROPRIÉTÉ DYNAMIQUE DES HOMÉOMORPHISMES DU PLAN AU VOISINAGE D’UN POINT FIXE D’INDICE >1.png)
Topology
OAAI
TopologyIF0
OAAI分享收藏
查看更多内容