Bayesian analysis of binary sequences
DOI10.1016/j.cam.2004.05.010zbMath1108.62310OpenAlexW1985878414MaRDI QIDQ1765468
Publication date: 23 February 2005
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2004.05.010
Nonlinear optimizationMachine learningLaplace approximationMomentsQuadratic programConvexGeometric probabilityPolytopeConcaveCut polytopePosterior likelihoodsProbability monomialsSemidefinite
Bayesian inference (62F15) Applications of mathematical programming (90C90) Learning and adaptive systems in artificial intelligence (68T05) Quadratic programming (90C20)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computing the volume, counting integral points, and exponential sums
- The even and odd cut polytopes
- Probability set functions
- Optimization. Algorithms and consistent approximations
- Shelling polyhedral 3-balls and 4-polytopes
- Binary cumulants
- Polytope Volume Computation
- Solving Systems of Linear Equations and Inequalities
- Integration on a convex polytope
This page was built for publication: Bayesian analysis of binary sequences