Sciweavers

842 search results - page 42 / 169
» Distributions of Maximum Likelihood Estimators and Model Com...
Sort
View
TASLP
2010
97views more  TASLP 2010»
14 years 4 months ago
Hierarchical Bayesian Language Models for Conversational Speech Recognition
Traditional n-gram language models are widely used in state-of-the-art large vocabulary speech recognition systems. This simple model suffers from some limitations, such as overfi...
Songfang Huang, Steve Renals
DICTA
2009
14 years 11 months ago
Multivariate Skew t Mixture Models: Applications to Fluorescence-Activated Cell Sorting Data
In many applied problems in the context of pattern recognition, the data often involve highly asymmetric observations. Normal mixture models tend to overfit when additional compone...
Kui Wang, Shu-Kay Ng, Geoffrey J. McLachlan
EMNLP
2007
14 years 11 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
CSDA
2007
94views more  CSDA 2007»
14 years 9 months ago
Some extensions of score matching
Many probabilistic models are only defined up to a normalization constant. This makes maximum likelihood estimation of the model parameters very difficult. Typically, one then h...
Aapo Hyvärinen
SODA
2001
ACM
79views Algorithms» more  SODA 2001»
14 years 11 months ago
Learning Markov networks: maximum bounded tree-width graphs
Markov networks are a common class of graphical models used in machine learning. Such models use an undirected graph to capture dependency information among random variables in a ...
David R. Karger, Nathan Srebro