Back to search

Cornell University

Results in Computational Algebra of Bayesian Networks

Abstract

dc:description.abstract

This dissertation studies the algebraic varieties arising from the conditional independence statements of Bayesian networks. Reduction techniques are described for relating these varieties to the varieties for smaller Bayesian networks. Particular attention is paid to the issues of primality, dimension, and degree. A classification of 5-node Bayesian networks is given based on whether or not they are prime for all state vectors. A proof of the Degree-2 Conjecture is given for a subclass of Bayesian networks which includes those with binomial global Markov ideal.

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Sinnott, Steven

Subjects

dc:subject × 4

Rights

Language dc:language.iso
en_US

Identifiers

dc:identifier.*
Dc Identifier Bibid
6475855

Chain of custody

source
Harvested from
Cornell University
Base URL
ecommons.cornell.edu/server/oai/request
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Sinnott, Steven. Results in Computational Algebra of Bayesian Networks. 2006. https://hdl.handle.net/1813/3364