Sciweavers

287 search results - page 14 / 58
» Data-Driven Constructive Induction
Sort
View
IPL
2006
92views more  IPL 2006»
13 years 7 months ago
A constructive approach to sequential Nash equilibria
We present a Coq-formalised proof that all non-cooperative, sequential games have a Nash equilibrium point. Our proof methodology follows the style advocated by LCFstyle theorem p...
René Vestergaard
NLP
2000
13 years 11 months ago
Learning Rules for Large-Vocabulary Word Sense Disambiguation: A Comparison of Various Classifiers
In this article we compare the performance of various machine learning algorithms on the task of constructing word-sense disambiguation rules from data. The distinguishing characte...
Georgios Paliouras, Vangelis Karkaletsis, Ion Andr...
WSC
2008
13 years 10 months ago
A modeling-based classification algorithm validated with simulated data
We present a Generalized Lotka-Volterra (GLV) based approach for modeling and simulation of supervised inductive learning, and construction of an efficient classification algorith...
Karen Hovsepian, Peter Anselmo, Subhasish Mazumdar
AAAI
2006
13 years 9 months ago
kFOIL: Learning Simple Relational Kernels
A novel and simple combination of inductive logic programming with kernel methods is presented. The kFOIL algorithm integrates the well-known inductive logic programming system FO...
Niels Landwehr, Andrea Passerini, Luc De Raedt, Pa...
CORR
2006
Springer
110views Education» more  CORR 2006»
13 years 7 months ago
Definitions by Rewriting in the Calculus of Constructions
Abstract : The main novelty of this paper is to consider an extension of the Calculus of Constructions where predicates can be defined with a general form of rewrite rules. We prov...
Frédéric Blanqui