找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Inductive Logic Programming; 13th International C Tamás Horváth,Akihiro Yamamoto Conference proceedings 2003 Springer-Verlag Berlin Heidelb

[复制链接]
楼主: chondrocyte
发表于 2025-3-25 10:07:46 | 显示全部楼层
发表于 2025-3-25 12:41:19 | 显示全部楼层
ILP for Mathematical Discoveryion, deduction, calculation and invention. We describe the HR system which performs a novel ILP routine called automated theory formation. This combines inductive and deductive reasoning to form clausal theories consisting of classification rules and association rules. HR generates definitions using
发表于 2025-3-25 17:16:12 | 显示全部楼层
An Exhaustive Matching Procedure for the Improvement of Learning Efficiency as a component of larger systems (e.g., learning systems). Hence, the need of techniques that can speed up such a process. This paper proposes a new algorithm for matching first-order logic descriptions under .-subsumption that is able to return the set of all substitutions by which such a relation
发表于 2025-3-25 22:30:13 | 显示全部楼层
发表于 2025-3-26 01:21:15 | 显示全部楼层
Graph Kernels and Gaussian Processes for Relational Reinforcement Learningironment that has no natural representation as a tuple of constants. In this case, the learning algorithm used to approximate the mapping between state-action pairs and their so called Q(uality)-value has to be not only very reliable, but it also has to be able to handle the relational representatio
发表于 2025-3-26 07:49:40 | 显示全部楼层
发表于 2025-3-26 09:36:56 | 显示全部楼层
A Comparative Evaluation of Feature Set Evolution Strategies for Multirelational Boostingensembles of hypotheses. While previous research has shown that this technique can be made to work efficiently even in the context of multirelational learning by using simple learners and active feature selection, such approaches have relied on simple and static methods of determining feature select
发表于 2025-3-26 14:31:26 | 显示全部楼层
发表于 2025-3-26 18:43:35 | 显示全部楼层
发表于 2025-3-26 21:59:39 | 显示全部楼层
Which First-Order Logic Clauses Can Be Learned Using Genetic Algorithms?auses using genetic algorithms. Over the last few years, a few approaches have been proposed aiming to combine genetic and evolutionary computation (EC) with inductive logic programming (ILP). The underlying rationale is that evolutionary algorithms, such as genetic algorithms, might mitigate the co
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-22 00:48
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表