...
首页> 外文期刊>Expert systems with applications >An evolutionary algorithm to discover quantitative association rules from huge databases without the need for an a priori discretization
【24h】

An evolutionary algorithm to discover quantitative association rules from huge databases without the need for an a priori discretization

机译:一种无需先验离散即可从大型数据库中发现定量关联规则的进化算法

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

摘要

Association rules are one of the most frequently used tools for finding relationships between different attributes in a database. There are various techniques for obtaining these rules, the most common of which are those which give categorical association rules. However, when we need to relate attributes which are numeric and discrete, we turn to methods which generate quantitative association rules, a far less studied method than the above. In addition, when the database is extremely large, many of these tools cannot be used. In this paper, we present an evolutionary tool for finding association rules in databases (both small and large) comprising quantitative and categorical attributes without the need for an a priori discretization of the domain of the numeric attributes. Finally, we evaluate the tool using both real and synthetic databases.
机译:关联规则是用于查找数据库中不同属性之间关系的最常用工具之一。有多种获取这些规则的技术,其中最常见的是那些给出分类关联规则的技术。但是,当我们需要关联数字和离散属性时,我们转向生成定量关联规则的方法,这是一种比上述方法研究较少的方法。另外,当数据库很大时,许多工具将无法使用。在本文中,我们提出了一种进化工具,用于在包含定量和分类属性的数据库(无论大小)中查找关联规则,而无需对数字属性的域进行先验离散。最后,我们使用真实数据库和综合数据库评估该工具。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号