Sciweavers

360 search results - page 3 / 72
» Learning Evaluation Functions for Large Acyclic Domains
Sort
View
UAI
2008
13 years 7 months ago
Learning Inclusion-Optimal Chordal Graphs
Chordal graphs can be used to encode dependency models that are representable by both directed acyclic and undirected graphs. This paper discusses a very simple and efficient algo...
Vincent Auvray, Louis Wehenkel
ICDM
2006
IEEE
119views Data Mining» more  ICDM 2006»
14 years 2 days ago
Fast On-line Kernel Learning for Trees
Kernel methods have been shown to be very effective for applications requiring the modeling of structured objects. However kernels for structures usually are too computational dem...
Fabio Aiolli, Giovanni Da San Martino, Alessandro ...
AIIDE
2006
13 years 7 months ago
The Self Organization of Context for Learning in MultiAgent Games
Reinforcement learning is an effective machine learning paradigm in domains represented by compact and discrete state-action spaces. In high-dimensional and continuous domains, ti...
Christopher D. White, Dave Brogan
IJCAI
2007
13 years 7 months ago
Reinforcement Learning of Local Shape in the Game of Go
We explore an application to the game of Go of a reinforcement learning approach based on a linear evaluation function and large numbers of binary features. This strategy has prov...
David Silver, Richard S. Sutton, Martin Mülle...
AI
2010
Springer
13 years 6 months ago
Learning conditional preference networks
We investigate the problem of eliciting CP-nets in the well-known model of exact learning with equivalence and membership queries. The goal is to identify a preference ordering wi...
Frédéric Koriche, Bruno Zanuttini