Sciweavers

901 search results - page 9 / 181
» Modelling Complex Data by Learning Which Variable to Constru...
Sort
View
COLT
1994
Springer
13 years 11 months ago
Learning Probabilistic Automata with Variable Memory Length
We propose and analyze a distribution learning algorithm for variable memory length Markov processes. These processes can be described by a subclass of probabilistic nite automata...
Dana Ron, Yoram Singer, Naftali Tishby
JMLR
2006
118views more  JMLR 2006»
13 years 7 months ago
Learning Factor Graphs in Polynomial Time and Sample Complexity
We study the computational and sample complexity of parameter and structure learning in graphical models. Our main result shows that the class of factor graphs with bounded degree...
Pieter Abbeel, Daphne Koller, Andrew Y. Ng
IJAR
2007
96views more  IJAR 2007»
13 years 7 months ago
Complexity measurement of fundamental pseudo-independent models
Pseudo-independent (PI) models are a special class of probabilistic domain model (PDM) where a set of marginally independent domain variables shows collective dependency, a specia...
J. Lee, Y. Xiang
ICPR
2010
IEEE
13 years 6 months ago
Learning Non-Linear Dynamical Systems by Alignment of Local Linear Models
Abstract—Learning dynamical systems is one of the important problems in many fields. In this paper, we present an algorithm for learning non-linear dynamical systems which works...
Masao Joko, Yoshinobu Kawahara, Takehisa Yairi
ACL
2001
13 years 8 months ago
Using Machine Learning Techniques to Interpret WH-questions
We describe a set of supervised machine learning experiments centering on the construction of statistical models of WH-questions. These models, which are built from shallow lingui...
Ingrid Zuckerman, Eric Horvitz