找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Inductive Logic Programming; 22nd International C Fabrizio Riguzzi,Filip Železný Conference proceedings 2013 Springer-Verlag Berlin Heidelb

[复制链接]
楼主: papyrus
发表于 2025-3-27 00:02:13 | 显示全部楼层
发表于 2025-3-27 03:12:08 | 显示全部楼层
Pairwise Markov Logic, inference methods can be employed for pairwise MLNs without the overhead of devising or implementing high-order variants. Experiments on two relational datasets confirm the usefulness of this reduction approach.
发表于 2025-3-27 05:51:00 | 显示全部楼层
,Identifying Driver’s Cognitive Load Using Inductive Logic Programming,le for rule verification and are actively employed for user-oriented interface design. Realistic experiments were conducted to demonstrate the learning performance of this approach. Reasonable accuracy was achieved for an appropriate service providing safe driving.
发表于 2025-3-27 13:27:08 | 显示全部楼层
发表于 2025-3-27 17:41:41 | 显示全部楼层
Conference proceedings 2013Dubrovnik, Croatia, in September 2012. The 18 revised full papers were carefully reviewed and selected from 41 submissions. The papers cover the following topics: propositionalization, logical foundations, implementations, probabilistic ILP, applications in robotics and biology, grammatical inferenc
发表于 2025-3-27 20:14:24 | 显示全部楼层
A Relational Approach to Tool-Use Learning in Robots,rates informative experiments while containing the search space to a practical number of experiments. Relational learning generalises across objects and tasks to learn the spatial and structural constraints that describe useful tools and how they should be employed. The system is evaluated in a simulated robot environment.
发表于 2025-3-27 22:50:05 | 显示全部楼层
Polynomial Time Pattern Matching Algorithm for Ordered Graph Patterns,whether or not a given ordered graph is contained in the ordered graph language for a given ordered graph pattern. We also implement the proposed algorithm on a computer and evaluate the algorithm by reporting and discussing experimental results.
发表于 2025-3-28 04:07:40 | 显示全部楼层
发表于 2025-3-28 08:40:37 | 显示全部楼层
Itemset-Based Variable Construction in Multi-relational Supervised Learning,in a parameter-free criterion to assess the relevance of the constructed variables. A greedy algorithm is then proposed in order to explore the space of the considered itemsets. Experiments on multi-relationalal datasets confirm the advantage of the approach.
发表于 2025-3-28 13:31:50 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-5 06:16
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表