Sciweavers

252 search results - page 30 / 51
» Learning Partially Observable Action Models: Efficient Algor...
Sort
View
IJCAI
1993
15 years 3 months ago
Learning Finite Automata Using Local Distinguishing Experiments
One of the open problems listed in Rivest and Schapire, 1989] is whether and how that the copies of L in their algorithm can be combined into one for better performance. This pape...
Wei-Mein Shen
113
Voted
TSMC
2010
14 years 9 months ago
Interaction Modeling and Prediction in Smart Spaces: A Bio-Inspired Approach Based on Autobiographical Memory
In Smart Spaces (SSs), the capability of learning from experience is fundamental for autonomous adaptation to environmental changes and for proactive interaction with users. New re...
Alessio Dore, Andrea F. Cattoni, Carlo S. Regazzon...
113
Voted
ICML
2006
IEEE
16 years 3 months ago
Bayesian learning of measurement and structural models
We present a Bayesian search algorithm for learning the structure of latent variable models of continuous variables. We stress the importance of applying search operators designed...
Ricardo Silva, Richard Scheines
ICML
2008
IEEE
16 years 3 months ago
Automatic discovery and transfer of MAXQ hierarchies
We present an algorithm, HI-MAT (Hierarchy Induction via Models And Trajectories), that discovers MAXQ task hierarchies by applying dynamic Bayesian network models to a successful...
Neville Mehta, Soumya Ray, Prasad Tadepalli, Thoma...
103
Voted
JMLR
2010
112views more  JMLR 2010»
14 years 9 months ago
Reduced-Rank Hidden Markov Models
Hsu et al. (2009) recently proposed an efficient, accurate spectral learning algorithm for Hidden Markov Models (HMMs). In this paper we relax their assumptions and prove a tighte...
Sajid M. Siddiqi, Byron Boots, Geoffrey J. Gordon