Sciweavers

74 search results - page 1 / 15
» Discovering Relational Domain Features for Probabilistic Pla...
Sort
View
AIPS
2007
13 years 6 months ago
Discovering Relational Domain Features for Probabilistic Planning
In sequential decision-making problems formulated as Markov decision processes, state-value function approximation using domain features is a critical technique for scaling up the...
Jia-Hong Wu, Robert Givan
JAIR
2010
131views more  JAIR 2010»
13 years 2 months ago
Automatic Induction of Bellman-Error Features for Probabilistic Planning
Domain-specific features are important in representing problem structure throughout machine learning and decision-theoretic planning. In planning, once state features are provide...
Jia-Hong Wu, Robert Givan
KR
2004
Springer
13 years 9 months ago
Learning Probabilistic Relational Planning Rules
To learn to behave in highly complex domains, agents must represent and learn compact models of the world dynamics. In this paper, we present an algorithm for learning probabilist...
Hanna Pasula, Luke S. Zettlemoyer, Leslie Pack Kae...
PKDD
2009
Springer
102views Data Mining» more  PKDD 2009»
13 years 11 months ago
Relevance Grounding for Planning in Relational Domains
Probabilistic relational models are an efficient way to learn and represent the dynamics in realistic environments consisting of many objects. Autonomous intelligent agents that gr...
Tobias Lang, Marc Toussaint
ICDM
2010
IEEE
217views Data Mining» more  ICDM 2010»
13 years 2 months ago
Discovering Temporal Features and Relations of Activity Patterns
An important problem that arises during the data mining process in many new emerging application domains is mining data with temporal dependencies. One such application domain is a...
Ehsan Nazerfard, Parisa Rashidi, Diane J. Cook