找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Inductive Logic Programming; 8th International Co David Page Conference proceedings 1998 Springer-Verlag Berlin Heidelberg 1998 Algorithmic

[复制链接]
楼主: 粗略
发表于 2025-3-28 16:12:42 | 显示全部楼层
发表于 2025-3-28 20:21:15 | 显示全部楼层
发表于 2025-3-29 02:15:53 | 显示全部楼层
发表于 2025-3-29 03:26:50 | 显示全部楼层
发表于 2025-3-29 07:26:43 | 显示全部楼层
Term comparisons in first-order similarity measures,er can be gained by allowing lists and other terms in the input representation and designing similarity measures that work directly on these structures. We present an improved similarity measure for the first-order instance based learner . that employs the concept of . to efficiently compute distanc
发表于 2025-3-29 14:48:45 | 显示全部楼层
发表于 2025-3-29 18:06:57 | 显示全部楼层
发表于 2025-3-29 22:46:08 | 显示全部楼层
Using prior probabilities and density estimation for relational classification,mation. Estimated densities and defined prior are combined in Bayes theorem to perform relational classification. An initial application of the technique is made to part-of-speech (POS) tagging. A novel use of Gibbs sampling for POS tagging is given.
发表于 2025-3-30 01:38:54 | 显示全部楼层
发表于 2025-3-30 06:55:50 | 显示全部楼层
A hybrid approach to word segmentation, First, a bias for word segmentation is introduced and a simple genetic algorithm is used for the search of segmentation that corresponds to the best bias value. In the second phase, the segmentation obtained from the genetic algorithm is used as an input for two inductive logic programming algorith
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-8 00:01
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表