Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
398104 | International Journal of Approximate Reasoning | 2011 | 14 Pages |
Abstract
The closure of a discrete exponential family is described by a finite set of equations corresponding to the circuits of an underlying oriented matroid. These equations are similar to the equations used in algebraic statistics, although they need not be polynomial in the general case. This description allows for a combinatorial study of the possible support sets in the closure of an exponential family. If two exponential families induce the same oriented matroid, then their closures have the same support sets. Furthermore, the positive cocircuits give a parameterization of the closure of the exponential family.
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence