Name
Abstract | ||
|---|---|---|
Given a model in algebraic statistics and data, the likelihood function is a rational function on a projective variety. Algebraic algorithms are presented for computing all critical points of this function, with the aim of identifying the local maxima in the probability simplex. Applications include models specified by rank conditions on matrices and the Jukes–Cantor models of phylogenetics. The maximum likelihood degree of a generic complete intersection is also determined. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1007/s10208-004-0156-8 | Foundations of Computational Mathematics |
Keywords | Field | DocType |
Maximum likelihood,Maximum likelihood degree,Syzygies,Phylogenetic trees | M-estimator,Mathematical optimization,Likelihood function,Expectation–maximization algorithm,Marginal likelihood,Estimation theory,Restricted maximum likelihood,Algebraic statistics,Mathematics,Likelihood principle | Journal |
Volume | Issue | ISSN |
5 | 4 | 1615-3375 |
Citations | PageRank | References |
19 | 3.22 | 3 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Serkan Hosten | 1 | 65 | 13.64 |
| Amit Khetan | 2 | 53 | 8.87 |
| Bernd Sturmfels | 3 | 926 | 136.85 |