Sciweavers

15 search results - page 2 / 3
» A GIS-like training algorithm for log-linear models with hid...
Sort
View
NIPS
2007
13 years 7 months ago
Agreement-Based Learning
The learning of probabilistic models with many hidden variables and nondecomposable dependencies is an important and challenging problem. In contrast to traditional approaches bas...
Percy Liang, Dan Klein, Michael I. Jordan
PKDD
2009
Springer
155views Data Mining» more  PKDD 2009»
14 years 18 days ago
Dynamic Factor Graphs for Time Series Modeling
Abstract. This article presents a method for training Dynamic Factor Graphs (DFG) with continuous latent state variables. A DFG includes factors modeling joint probabilities betwee...
Piotr W. Mirowski, Yann LeCun
WSDM
2010
ACM
322views Data Mining» more  WSDM 2010»
14 years 3 months ago
Inferring Search Behaviors Using Partially Observable Markov (POM) Model
This article describes an application of the partially observable Markov (POM) model to the analysis of a large scale commercial web search log. Mathematically, POM is a variant o...
Kuansan Wang, Nikolas Gloy, Xiaolong Li
CVPR
2012
IEEE
11 years 8 months ago
Learning latent temporal structure for complex event detection
In this paper, we tackle the problem of understanding the temporal structure of complex events in highly varying videos obtained from the Internet. Towards this goal, we utilize a...
Kevin Tang, Fei-Fei Li, Daphne Koller
EMNLP
2007
13 years 7 months ago
Probabilistic Models of Nonprojective Dependency Trees
A notable gap in research on statistical dependency parsing is a proper conditional probability distribution over nonprojective dependency trees for a given sentence. We exploit t...
David A. Smith, Noah A. Smith