Sciweavers

3718 search results - page 292 / 744
» On learning with dissimilarity functions
Sort
View
ICML
2002
IEEE
16 years 7 months ago
Learning from Scarce Experience
Searching the space of policies directly for the optimal policy has been one popular method for solving partially observable reinforcement learning problems. Typically, with each ...
Leonid Peshkin, Christian R. Shelton
ADMA
2006
Springer
121views Data Mining» more  ADMA 2006»
16 years 20 days ago
A New Polynomial Time Algorithm for Bayesian Network Structure Learning
We propose a new algorithm called SCD for learning the structure of a Bayesian network. The algorithm is a kind of constraintbased algorithm. By taking advantage of variable orderi...
Sanghack Lee, Jihoon Yang, Sungyong Park
COLT
2005
Springer
16 years 6 days ago
Learning Convex Combinations of Continuously Parameterized Basic Kernels
We study the problem of learning a kernel which minimizes a regularization error functional such as that used in regularization networks or support vector machines. We consider thi...
Andreas Argyriou, Charles A. Micchelli, Massimilia...
IVA
2005
Springer
16 years 5 days ago
Autonomous Virtual Agents Learning a Cognitive Model and Evolving
In this paper, we propose a new integration approach to simulate an Autonomous Virtual Agent's cognitive learning of a task for interactive Virtual Environment applications. O...
Toni Conde, Daniel Thalmann
ECAI
2004
Springer
16 years 2 days ago
Applying Affective Tactics for a Better Learning
This paper describes the Mediating Agent, an animated pedagogical agent inserted in a computational system for distance learning, which has the goal of motivating the student to le...
Patrícia Augustin Jaques, Rosa Maria Vicari...