193 search results - page 14 / 39 » Approximate Maximum Parsimony and Ancestral Maximum Likeliho... |
109
Voted
NIPS
2003
15 years 1 months ago
2003
We discuss the integration of the expectation-maximization (EM) algorithm for maximum likelihood learning of Bayesian networks with belief propagation algorithms for approximate i...
111
click to vote
CSDA
2006
15 years 15 days ago
2006
The mixmod (mixture modeling) program fits mixture models to a given data set for the purposes of density estimation, clustering or discriminant analysis. A large variety of algor...
109
Voted
FOCI
2007
IEEE
15 years 6 months ago
2007
IEEE
— A learning machine is called singular if its Fisher information matrix is singular. Almost all learning machines used in information processing are singular, for example, layer...
80
Voted
IVC
2008
15 years 13 days ago
2008
This paper presents a method for the self-calibration of non-rigid affine structure to a Euclidean co-ordinate frame from only two views by enforcing constraints derived from the ...
76
Voted
CSDA
2007
15 years 13 days ago
2007
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...