Intelligent Structuring and Reducing of Association Rules with Formal Concept Analysis

Intelligent Structuring and Reducing of Association Rules with Formal Concept Analysis
复制标题

DOI:
10.1007/3-540-45422-5_24
复制
发表时间:
2001-09
期刊:
--
影响因子:
--
通讯作者:
Gerd Stumme;Rafik Taouil;Yves Bastide;Nicolas Pasquier;L. Lakhal
Gerd Stumme;Rafik Taouil;Yves Bastide;Nicolas Pasquier;L. Lakhal
中科院分区:
其他
文献类型:
--
作者:
Gerd Stumme;Rafik Taouil;Yves Bastide;Nicolas Pasquier;L. Lakhal

文献摘要

被引文献

相似文献

关联规则用于调查大型数据库。分析师通常会面对大量这样的规则,并且必须找到与他的目的最相关的规则。基于形式概念分析理论框架下的知识表示结果,我们提出了相对较小的关联规则基,所有规则都可以从中推导出来。我们还提供了它们的计算算法
Association rules are used to investigate large databases. The analyst is usually confronted with large lists of such rules and has to find the most relevant ones for his purpose. Based on results about knowledge representation within the theoretical framework of Formal Concept Analysis, we present relatively small bases for association rules from which all rules can be deduced. We also provide algorithms for their calculation.1