Looping suffix tree-based inference of partially observable hidden state.
Michael P. HolmesCharles Lee Isbell Jr.Published in: ICML (2006)
Keyphrases
- hidden state
- partially observable
- reinforcement learning
- decision problems
- dynamical systems
- state space
- markov decision processes
- hidden markov models
- markov models
- partial observability
- markov decision problems
- bayesian networks
- fully observable
- infinite horizon
- belief space
- belief state
- planning domains
- probabilistic inference
- maximum entropy
- data mining
- reward function
- domain independent
- information extraction
- search space