Computing the maximum-entropy extension of given discrete probability distributions
type: Item
instance of: scholarly article
title: Computing the maximum-entropy extension of given discrete probability distributions
zbMATH Open document ID: 0726.62012
DOI: 10.1016/0167-9473(89)90046-7
published in: Computational Statistics and Data Analysis
publication date: 1989-01-01T00:00:00Z
Mathematics Subject Classification ID: 62B10
Mathematics Subject Classification ID: 62E17
zbMATH DE Number: 4199254
zbMATH Keywords: maximum-entropy principle
zbMATH Keywords: IPFP
zbMATH Keywords: intersection graph
zbMATH Keywords: reduction
zbMATH Keywords: decomposition
author: Francesco M. Malvestuto
MaRDI profile type: Publication
full work available at URL: 0167-9473(89)90046-7
OpenAlex ID: W1969437862
cites work: On the Desirability of Acyclic Database Schemes
cites work: Q5668821
cites work: Markov fields and log-linear interaction models for contingency tables
cites work: On a Least Squares Adjustment of a Sampled Frequency Table When the Expected Marginal Totals are Known
cites work: A fast algorithm for iterative proportional fitting in log-linear models
cites work: Q5538132
cites work: The Analysis of Multidimensional Contingency Tables: Stepwise Procedures and Direct Estimation Methods for Building Models for Multiple Classifications
cites work: Maximum Entropy Condition in Queueing Theory
cites work: Q4089657
cites work: Q5572939
cites work: Projection pursuit
cites work: Information Theory and Statistical Mechanics
cites work: Q3730834
cites work: Q3315548
cites work: Existence of extensions and product extensions for discrete probability distributions
cites work: Axiomatic derivation of the principle of maximum entropy and the principle of minimum cross-entropy
cites work: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
description: scientific article; zbMATH DE number 4199254