Solving the 100 swiss francs problem

DOI10.1007/s11786-011-0068-3OpenAlexW3101303041MaRDI QIDQ691647

Shuhong Gao, Mingfu Zhu, Guangran Jiang

Publication date: 3 December 2012

Published in: Mathematics in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0809.4627

zbMATH Keywords

maximum likelihood estimationlatent class modelalgebraic statisticssolving polynomial equations

Mathematics Subject Classification ID

Applications of statistics to biology and medical sciences; meta analysis (62P10) Parametric inference under constraints (62F30) Numerical computation of solutions to systems of equations (65H10)

Related Items (3)

Algebraic boundary of matrices of nonnegative rank at most three ⋮ Gröbner bases of symmetric ideals ⋮ Fixed points of the EM algorithm and nonnegative rank boundaries

Cites Work

• A new efficient algorithm for computing Gröbner bases \((F_4)\)
• Solving the likelihood equations
• A new incremental algorithm for computing Groebner bases
• A new framework for computing Gröbner bases
• The maximum likelihood degree
• Algebraic Statistics for Computational Biology
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Solving the 100 swiss francs problem