Sciweavers

237 search results - page 28 / 48
» Incremental Learning in Inductive Programming
Sort
View
ICML
2007
IEEE
15 years 10 months ago
Learning from interpretations: a rooted kernel for ordered hypergraphs
The paper presents a kernel for learning from ordered hypergraphs, a formalization that captures relational data as used in Inductive Logic Programming (ILP). The kernel generaliz...
Gabriel Wachman, Roni Khardon
GECCO
2005
Springer
136views Optimization» more  GECCO 2005»
15 years 3 months ago
Preventing overfitting in GP with canary functions
Overfitting is a fundamental problem of most machine learning techniques, including genetic programming (GP). Canary functions have been introduced in the literature as a concept ...
Nate Foreman, Matthew P. Evett
AAAI
1994
14 years 10 months ago
Inducing Deterministic Prolog Parsers from Treebanks: A Machine Learning Approach
or untagged treebanks. ' When trained on an untagged This paper presents a method for constructing deterministic Prolog parsers from corpora of parsed sentences. Our approach ...
John M. Zelle, Raymond J. Mooney
ILP
2007
Springer
15 years 3 months ago
Combining Clauses with Various Precisions and Recalls to Produce Accurate Probabilistic Estimates
Statistical Relational Learning (SRL) combines the benefits of probabilistic machine learning approaches with complex, structured domains from Inductive Logic Programming (ILP). W...
Mark Goadrich, Jude W. Shavlik
72
Voted
NLPRS
2001
Springer
15 years 1 months ago
A New Prosodic Phrasing Model for Chinese TTS Systems
This paper proposes a new prosodic phrasing model for Chinese text-tospeech systems. First, in contrast to the commonly used CART techniques, we propose a new inductive learning a...
Weijun Chen, Fuzong Lin, Jianmin Li, Bo Zhang