Sciweavers

384 search results - page 15 / 77
» Learning Markov Network Structure with Decision Trees
Sort
View
DATAMINE
1998
249views more  DATAMINE 1998»
13 years 7 months ago
Automatic Construction of Decision Trees from Data: A Multi-Disciplinary Survey
Decision trees have proved to be valuable tools for the description, classi cation and generalizationof data. Work on constructingdecisiontrees from data exists in multiplediscipli...
Sreerama K. Murthy
PRICAI
2000
Springer
13 years 11 months ago
Generating Hierarchical Structure in Reinforcement Learning from State Variables
This paper presents the CQ algorithm which decomposes and solves a Markov Decision Process (MDP) by automatically generating a hierarchy of smaller MDPs using state variables. The ...
Bernhard Hengst
ICML
2008
IEEE
14 years 8 months ago
Laplace maximum margin Markov networks
We propose Laplace max-margin Markov networks (LapM3 N), and a general class of Bayesian M3 N (BM3 N) of which the LapM3 N is a special case with sparse structural bias, for robus...
Jun Zhu, Eric P. Xing, Bo Zhang
AAAI
2007
13 years 10 months ago
Mapping and Revising Markov Logic Networks for Transfer Learning
Transfer learning addresses the problem of how to leverage knowledge acquired in a source domain to improve the accuracy and speed of learning in a related target domain. This pap...
Lilyana Mihalkova, Tuyen N. Huynh, Raymond J. Moon...
JAIR
2002
120views more  JAIR 2002»
13 years 7 months ago
Learning Geometrically-Constrained Hidden Markov Models for Robot Navigation: Bridging the Topological-Geometrical Gap
Hidden Markov models hmms and partially observable Markov decision processes pomdps provide useful tools for modeling dynamical systems. They are particularly useful for represent...
Hagit Shatkay, Leslie Pack Kaelbling