Maximum Entropy in the framework of Algebraic Statistics: A First Step
| dc.creator | Dukkipati, Ambedkar | |
| dc.date | 2007-01-18 | |
| dc.date | 2007-06-12 | |
| dc.date.accessioned | 2026-07-07T08:16:59Z | |
| dc.date.available | 2026-07-07T08:16:59Z | |
| dc.description | Algebraic statistics is a recently evolving field, where one would treat statistical models as algebraic objects and thereby use tools from computational commutative algebra and algebraic geometry in the analysis and computation of statistical models. In this approach, calculation of parameters of statistical models amounts to solving set of polynomial equations in several variables, for which one can use celebrated Grobner bases theory. Owing to the important role of information theory in statistics, this paper as a first step, explores the possibility of describing maximum and minimum entropy (ME) models in the framework of algebraic statistics. We show that ME-models are toric models (a class of algebraic statistical models) when the constraint functions (that provide the information about the underlying random variable) are integer valued functions, and the set of statistical models that results from ME-methods are indeed an affine variety. | |
| dc.identifier | https://arxiv.org/abs/cs/0701117 | |
| dc.identifier | http://arxiv.org/abs/cs/0701117 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/133977 | |
| dc.subject | Information Theory | |
| dc.subject | Symbolic Computation | |
| dc.title | Maximum Entropy in the framework of Algebraic Statistics: A First Step | |
| dc.type | text |