首页> 外文会议>Biennial conference of the Canadian Society for Computational Studies of Intelligence >Relational Concepts and the Fourier Transform: An Empirical Study
【24h】

Relational Concepts and the Fourier Transform: An Empirical Study

机译:关系概念和傅里叶变换:实证研究

获取原文

摘要

Lack of domain knowledge may impose primitive data representation. Then, compelx (non-linear) relationships among attributes complicate learning, especially for typical learning methods. These methods fail because their bias does not match the compelx relational structures relevenat to the domain. However, more recent approaches to learning have implemented biases that allow learning of structured, albeit complex, concepts. One of such approaches, based o nthe Fourier transform of Boolean functions, is studied and compared empirically to others, based on constructing new features or extracting relations from propositional training data. Controlled experiments help to characterized the kinds of concept that allow each approach to outperform the others. This characterization, which implicates parameters of Fourier complexity, other measures of concept difficulty, and the relational strucure of the target concepts, is also discussed with respect to difficult real-world domains.
机译:缺乏域名知识可能会强加原始数据表示。然后,属性之间的Compelx(非线性)关系复杂化学习,尤其是对于典型的学习方法。这些方法失败,因为它们的偏置与Compelx关系结构与域相关联。然而,最近的学习方法已经实施了允许学习结构化的偏差,尽管复杂的概念。基于构建来自命题训练数据的新特征或提取关系,研究并对布尔函数的傅立叶函数的傅立叶函数的傅立叶变换进行了比较的这样的方法。受控实验有助于表征允许每种方法优于其他方法的概念。该表征涉及傅立叶复杂性的参数,其他概念难度措施以及目标概念的关系结构,也是关于困难的现实世界域的讨论。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号