Sciweavers

1900 search results - page 119 / 380
» Gaussian Processes in Machine Learning
Sort
View
CICLING
2004
Springer
14 years 25 days ago
Korean Compound Noun Decomposition Using Syllabic Information Only
The compound nouns are freely composed in Korean, since it is possible to concatenate independent nouns without a postposition. Therefore, the systems that handle compound nouns su...
Seong-Bae Park, Jeong Ho Chang, Byoung-Tak Zhang
SEMWEB
2005
Springer
14 years 2 months ago
Bootstrapping Ontology Alignment Methods with APFEL
Abstract. Ontology alignment is a prerequisite in order to allow for interoperation between different ontologies and many alignment strategies have been proposed to facilitate the ...
Marc Ehrig, Steffen Staab, York Sure
EACL
2006
ACL Anthology
13 years 10 months ago
Automatic Acronym Recognition
This paper deals with the problem of recognizing and extracting acronymdefinition pairs in Swedish medical texts. This project applies a rule-based method to solve the acronym rec...
Dana Dannélls
ICGI
2010
Springer
13 years 10 months ago
Grammatical Inference Algorithms in MATLAB
Although MATLAB1 has become one of the mainstream languages for the machine learning community, there is still skepticism among the Grammatical Inference (GI) community regarding t...
Hasan Ibne Akram, Colin de la Higuera, Huang Xiao,...
ICML
2006
IEEE
14 years 10 months ago
PAC model-free reinforcement learning
For a Markov Decision Process with finite state (size S) and action spaces (size A per state), we propose a new algorithm--Delayed Q-Learning. We prove it is PAC, achieving near o...
Alexander L. Strehl, Lihong Li, Eric Wiewiora, Joh...