首页> 外文期刊>Information Sciences: An International Journal >Genetic learning of the membership functions for mining fuzzy association rules from low quality data
【24h】

Genetic learning of the membership functions for mining fuzzy association rules from low quality data

机译:从低质量数据挖掘模糊关联规则的隶属函数的遗传学习

获取原文
获取原文并翻译 | 示例
           

摘要

Many methods have been proposed to mine fuzzy association rules from databases with crisp values in order to help decision-makers make good decisions and tackle new types of problems. However, most real-world problems present a certain degree of imprecision. Various studies have been proposed to mine fuzzy association rules from imprecise data but they assume that the membership functions are known in advance and it is not an easy task to know a priori the most appropriate fuzzy sets to cover the domains of the variables. In this paper, we propose FARLAT-LQD, a new fuzzy data-mining algorithm to obtain both suitable membership functions and useful fuzzy association rules from databases with a wide range of types of uncertain data. To accomplish this, first we perform a genetic learning of the membership functions based on the 3-tuples linguistic representation model to reduce the search space and to learn the most adequate context for each fuzzy partition, maximizing the fuzzy supports and the interpretability measure GM3M in order to preserve the semantic interpretability of the obtained membership functions. Moreover, we propose a new algorithm based on the Fuzzy Frequent Pattern-growth algorithm, called FFP-growth-LQD, to efficiently mine the fuzzy association rules from inaccurate data considering the learned membership functions in the genetic process. The results obtained over 3 databases of different sizes and kinds of imprecisions demonstrate the effectiveness of the proposed algorithm. (C) 2014 Elsevier Inc. All rights reserved.
机译:已经提出了许多方法来从具有清晰值的数据库中挖掘模糊关联规则,以帮助决策者做出正确的决策并解决新型问题。但是,大多数现实世界中的问题都存在一定程度的不精确性。已经提出了各种研究来从不精确的数据中挖掘模糊关联规则,但是它们假定隶属函数是预先已知的,并且先验地知道最合适的模糊集来覆盖变量的域并不是一件容易的事。在本文中,我们提出了FARLAT-LQD,这是一种新的模糊数据挖掘算法,可以从具有多种不确定数据类型的数据库中获取合适的隶属函数和有用的模糊关联规则。为此,首先我们基于三元组语言表示模型对隶属度函数进行遗传学习,以减少搜索空间并学习每个模糊分区的最适当上下文,从而最大化模糊支持和GM3M中的可解释性度量为了保留获得的隶属函数的语义可解释性。此外,我们提出了一种基于模糊频繁模式增长算法的新算法,称为FFP-growth-LQD,以考虑遗传过程中学习到的隶属函数,从不准确的数据中有效地挖掘模糊关联规则。通过3个不同大小和不精确度的数据库获得的结果证明了该算法的有效性。 (C)2014 Elsevier Inc.保留所有权利。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号