Sciweavers

481 search results - page 23 / 97
» Learning relational probability trees
Sort
View
JAIR
2010
145views more  JAIR 2010»
13 years 6 months ago
Planning with Noisy Probabilistic Relational Rules
Noisy probabilistic relational rules are a promising world model representation for several reasons. They are compact and generalize over world instantiations. They are usually in...
Tobias Lang, Marc Toussaint
JMLR
2006
112views more  JMLR 2006»
13 years 7 months ago
Kernels on Prolog Proof Trees: Statistical Learning in the ILP Setting
We develop kernels for measuring the similarity between relational instances using background knowledge expressed in first-order logic. The method allows us to bridge the gap betw...
Andrea Passerini, Paolo Frasconi, Luc De Raedt
DIS
2006
Springer
13 years 11 months ago
Optimal Bayesian 2D-Discretization for Variable Ranking in Regression
In supervised machine learning, variable ranking aims at sorting the input variables according to their relevance w.r.t. an output variable. In this paper, we propose a new relevan...
Marc Boullé, Carine Hue
AAAI
1990
13 years 8 months ago
What Should Be Minimized in a Decision Tree?
In this paper, we address the issue of evaluating decision trees generated from training examples by a learning algorithm. We give a set of performance measures and show how some ...
Usama M. Fayyad, Keki B. Irani
ICRA
2010
IEEE
133views Robotics» more  ICRA 2010»
13 years 6 months ago
Generalized model learning for Reinforcement Learning on a humanoid robot
— Reinforcement learning (RL) algorithms have long been promising methods for enabling an autonomous robot to improve its behavior on sequential decision-making tasks. The obviou...
Todd Hester, Michael Quinlan, Peter Stone