Computing the maximum-entropy extension of given discrete probability distributions

DOI10.1016/0167-9473(89)90046-7MaRDI QIDQ804113zbMATHOpenAlexFDO

Authors Francesco M. Malvestuto

Publication date 1989

Published in Computational Statistics and Data Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-9473(89)90046-7

zbMATH Keywords

decompositionintersection graphreductionmaximum-entropy principleIPFP

Mathematics Subject Classification ID

Statistical aspects of information-theoretic topics (62B10) Approximations to statistical distributions (nonasymptotic) (62E17)

Recommendations

• Entropy, optimization and counting
• Maximum entropy distributions between upper and lower bounds
• scientific article; zbMATH DE number 4188971
• An efficient algorithm to compute maximum entropy densities
• scientific article; zbMATH DE number 5818908

Cites work

• scientific article; zbMATH DE number 3845624 (Why is no real title available?)
• scientific article; zbMATH DE number 3962991 (Why is no real title available?)
• scientific article; zbMATH DE number 3509596 (Why is no real title available?)
• scientific article; zbMATH DE number 3249395 (Why is no real title available?)
• scientific article; zbMATH DE number 3290993 (Why is no real title available?)
• scientific article; zbMATH DE number 3400923 (Why is no real title available?)
• A fast algorithm for iterative proportional fitting in log-linear models
• Axiomatic derivation of the principle of maximum entropy and the principle of minimum cross-entropy
• Existence of extensions and product extensions for discrete probability distributions
• Information Theory and Statistical Mechanics
• Markov fields and log-linear interaction models for contingency tables
• Maximum Entropy Condition in Queueing Theory
• On a Least Squares Adjustment of a Sampled Frequency Table When the Expected Marginal Totals are Known
• On the Desirability of Acyclic Database Schemes
• Projection pursuit
• Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
• The Analysis of Multidimensional Contingency Tables: Stepwise Procedures and Direct Estimation Methods for Building Models for Multiple Classifications

Cited in

(13)

• Entropy, optimization and counting
• An implementation of the iterative proportional fitting procedure by propagation trees.
• A universal table model for categorical databases
• On the effective implementation of the iterative proportional fitting procedure
• A note on conditional logics and entropy
• CALCULATING MAXIMUM-ENTROPY PROBABILITY DENSITIES FOR BELIEF FUNCTIONS
• scientific article; zbMATH DE number 5818908 (Why is no real title available?)
• Regression-based network-flow and inner-matrix reconstruction
• Maximum Entropy Functions of Discrete Fuzzy Random Variables
• Decomposition of a hypergraph by partial-edge separators
• Iterative proportional scaling via decomposable submodels for contingency tables
• scientific article; zbMATH DE number 61022 (Why is no real title available?)
• Maximum entropy in applied econometric research

This page was built for publication: Computing the maximum-entropy extension of given discrete probability distributions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q804113)