Sciweavers

99 search results - page 9 / 20
» Learning Hidden Markov Models with Distributed State Represe...
Sort
View
NAACL
2004
13 years 9 months ago
Catching the Drift: Probabilistic Content Models, with Applications to Generation and Summarization
We consider the problem of modeling the content structure of texts within a specific domain, in terms of the topics the texts address and the order in which these topics appear. W...
Regina Barzilay, Lillian Lee
ICML
2007
IEEE
14 years 8 months ago
Three new graphical models for statistical language modelling
The supremacy of n-gram models in statistical language modelling has recently been challenged by parametric models that use distributed representations to counteract the difficult...
Andriy Mnih, Geoffrey E. Hinton
ICML
2008
IEEE
14 years 8 months ago
A distance model for rhythms
Modeling long-term dependencies in time series has proved very difficult to achieve with traditional machine learning methods. This problem occurs when considering music data. In ...
Douglas Eck, Jean-François Paiement, Samy B...
NN
1997
Springer
174views Neural Networks» more  NN 1997»
13 years 11 months ago
Learning Dynamic Bayesian Networks
Bayesian networks are directed acyclic graphs that represent dependencies between variables in a probabilistic model. Many time series models, including the hidden Markov models (H...
Zoubin Ghahramani
KDD
2002
ACM
136views Data Mining» more  KDD 2002»
14 years 8 months ago
Relational Markov models and their application to adaptive web navigation
Relational Markov models (RMMs) are a generalization of Markov models where states can be of different types, with each type described by a different set of variables. The domain ...
Corin R. Anderson, Pedro Domingos, Daniel S. Weld