Affordable Access

Grobner bases and factorisation in discrete probability and Bayes

Publisher
KLUWER ACADEMIC PUBL
Publication Date
Keywords
  • Qa76 Electronic Computers. Computer Science. Computer Software
  • Qa Mathematics
Disciplines
  • Computer Science
  • Mathematics

Abstract

Grobner bases, elimination theory and factorization may be used to perform calculations in elementary discrete probability and more complex areas such as Bayesian networks (influence diagrams). The paper covers the application of computational algebraic geometry to probability theory. The application to the Boolean algebra of events is straightforward (and essentially known). The extension into the probability superstructure is via the polynomial interpolation of densities and log densities and this is used naturally in the Bayesian application.

There are no comments yet on this publication. Be the first to share your thoughts.

Statistics

Seen <100 times
0 Comments

More articles like this

Boolean Gröbner bases

on Journal of Symbolic Computatio... Jan 01, 2011

Regular Gröbner Bases

on Journal of Symbolic Computatio... Jan 01, 2002
More articles like this..