.png){kind=icon}
返回
A complexity guided algorithm for association rule extraction on fuzzy DataCubes
.png){kind=icon}
PRE
AI
DOI：10.1109/TFUZZ.2007.905909.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The use of online analytical processing (OLAP) systems as data sources for data mining techniques has been widely studied and has resulted in what is known as online analytical mining (OLAM). As a result of both the use of OLAP technology in new fields of knowledge and the merging of data from different sources, it has become necessary for models to support imprecision. We, therefore, need OLAM methods which are able to deal with this imprecision. Association rules are one of the most used data mining techniques. There are several proposals that enable the extraction of association rules on DataCubes but few of these deal with imprecision in the process. The main problem observed in these proposals is the complexity of the rule set obtained. In this paper, we present a novel association rule extraction method that works over a fuzzy multidimensional model which is capable, of representing and managing imprecise data. Our method deals with the problem of reducing the complexity of the result obtained by using fuzzy concepts and a hierarchical relation between them.
Keyword:
association rules extraction
complexity reduction
fuzzy multidimensional model
on-line analytical processing (OLAP)
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
11.9
论文数:
5.0K
被引数:
2.9W
机构
引用论文
Comparative performance of rule quality measures in an induction system.png)
APPLIED INTELLIGENCE
APPLIED INTELLIGENCEIF3.5
PREAI
分享收藏
分享收藏
查看更多内容