找回密碼
 To register

QQ登錄

只需一步,快速開始

掃一掃,訪問微社區(qū)

打印 上一主題 下一主題

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

[復(fù)制鏈接]
樓主: chondrocyte
21#
發(fā)表于 2025-3-25 10:07:46 | 只看該作者
22#
發(fā)表于 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
23#
發(fā)表于 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
24#
發(fā)表于 2025-3-25 22:30:13 | 只看該作者
25#
發(fā)表于 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
26#
發(fā)表于 2025-3-26 07:49:40 | 只看該作者
27#
發(fā)表于 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
28#
發(fā)表于 2025-3-26 14:31:26 | 只看該作者
29#
發(fā)表于 2025-3-26 18:43:35 | 只看該作者
30#
發(fā)表于 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
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點評 投稿經(jīng)驗總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機版|小黑屋| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2026-1-27 12:59
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
凤城市| 孟州市| 措勤县| 阿克苏市| 沾化县| 姚安县| 宜兰市| 眉山市| 丰都县| 富民县| 柘城县| 山丹县| 长岛县| 敖汉旗| 怀来县| 龙南县| 辽宁省| 桃园县| 淮北市| 南城县| 黄梅县| 杭锦旗| 新沂市| 方正县| 平和县| 尤溪县| 华容县| 灌阳县| 延庆县| 湘潭县| 济源市| 大悟县| 鄯善县| 清水河县| 伊宁市| 旬邑县| 噶尔县| 南陵县| 兴化市| 遂平县| 赫章县|