Sciweavers

1023 search results - page 29 / 205
» Graph model selection using maximum likelihood
Sort
View
ICML
2000
IEEE
14 years 8 months ago
Maximum Entropy Markov Models for Information Extraction and Segmentation
Hidden Markov models (HMMs) are a powerful probabilistic tool for modeling sequential data, and have been applied with success to many text-related tasks, such as part-of-speech t...
Andrew McCallum, Dayne Freitag, Fernando C. N. Per...
ICIP
2005
IEEE
14 years 9 months ago
Feature selection with nonparametric statistics
In this paper we discuss a general framework for feature selection based on nonparametric statistics. The three stage approach we propose is based on the assumption that the avail...
Emanuele Franceschi, Francesca Odone, Fabrizio Sme...
ICASSP
2009
IEEE
14 years 2 months ago
Comparing maximum a posteriori vector quantization and Gaussian mixture models in speaker verification
Gaussian mixture model - universal background model (GMMUBM) is a standard reference classifier in speaker verification. We have recently proposed a simplified model using vect...
Tomi Kinnunen, Juhani Saastamoinen, Ville Hautam&a...
ICML
1999
IEEE
14 years 8 months ago
Monte Carlo Hidden Markov Models: Learning Non-Parametric Models of Partially Observable Stochastic Processes
We present a learning algorithm for non-parametric hidden Markov models with continuous state and observation spaces. All necessary probability densities are approximated using sa...
Sebastian Thrun, John Langford, Dieter Fox
NLPRS
2001
Springer
13 years 12 months ago
Statistical Parsing of Dutch using Maximum Entropy Models with Feature Merging
In this project report we describe work in statistical parsing using the maximum entropy technique and the Alpino language analysis system for Dutch. A major difficulty in this d...
Tony Mullen, Rob Malouf, Gertjan van Noord