Sciweavers

535 search results - page 80 / 107
» Online learning over graphs
Sort
View
AIPS
2007
13 years 10 months ago
Learning to Plan Using Harmonic Analysis of Diffusion Models
This paper summarizes research on a new emerging framework for learning to plan using the Markov decision process model (MDP). In this paradigm, two approaches to learning to plan...
Sridhar Mahadevan, Sarah Osentoski, Jeffrey Johns,...
ECCV
2006
Springer
14 years 9 months ago
Efficient Belief Propagation with Learned Higher-Order Markov Random Fields
Belief propagation (BP) has become widely used for low-level vision problems and various inference techniques have been proposed for loopy graphs. These methods typically rely on a...
Xiangyang Lan, Stefan Roth, Daniel P. Huttenlocher...
KDD
2009
ACM
198views Data Mining» more  KDD 2009»
14 years 8 months ago
Heterogeneous source consensus learning via decision propagation and negotiation
Nowadays, enormous amounts of data are continuously generated not only in massive scale, but also from different, sometimes conflicting, views. Therefore, it is important to conso...
Jing Gao, Wei Fan, Yizhou Sun, Jiawei Han
AMAI
2004
Springer
14 years 1 months ago
Using the Central Limit Theorem for Belief Network Learning
Learning the parameters (conditional and marginal probabilities) from a data set is a common method of building a belief network. Consider the situation where we have known graph s...
Ian Davidson, Minoo Aminian
AIPS
2008
13 years 10 months ago
Learning Relational Decision Trees for Guiding Heuristic Planning
The current evaluation functions for heuristic planning are expensive to compute. In numerous domains these functions give good guidance on the solution, so it worths the computat...
Tomás de la Rosa, Sergio Jiménez, Da...