An implementation of the iterative proportional fitting procedure by propagation trees.

DOI10.1016/S0167-9473(01)00013-5zbMath1061.65500MaRDI QIDQ1606471

J. H. Badsberg, Francesco Mario Malvestuto

Publication date: 24 July 2002

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

zbMATH Keywords

Markov extensionAcyclic hypergraphIterative proportional fitting procedureProbabilistic databasePropagation tree

Mathematics Subject Classification ID

Related Items (9)

Local computations of the iterative proportional scaling procedure for hierarchical models ⋮ Unnamed Item ⋮ Hierarchical subspace models for contingency tables ⋮ CHARACTERISTIC PROPERTIES AND RECOGNITION OF GRAPHS IN WHICH GEODESIC AND MONOPHONIC CONVEXITIES ARE EQUIVALENT ⋮ Iterative proportional scaling via decomposable submodels for contingency tables ⋮ An improved Hara-Takamura procedure by sharing computations on junction tree in Gaussian graphical models ⋮ A Localization Approach to Improve Iterative Proportional Scaling in Gaussian Graphical Models ⋮ Multiplicity adjustment for temporal and spatial scan statistics using Markov property ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the effective implementation of the iterative proportional fitting procedure
• Computing the maximum-entropy extension of given discrete probability distributions
• Decomposition by clique separators
• A fast algorithm for iterative proportional fitting in log-linear models
• Existence of extensions and product extensions for discrete probability distributions
• Markov fields and log-linear interaction models for contingency tables
• I-divergence geometry of probability distributions and minimization problems
• A fast algorithm for query optimization in universal-relation databases
• Treewidth. Computations and approximations
• Decomposition of a hypergraph by partial-edge separators
• Optimal decomposition by clique separators
• On the Desirability of Acyclic Database Schemes
• Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
• Complexity of Finding Embeddings in a k-Tree
• On the tree representation of chordal graphs
• Computing the Minimum Fill-In is NP-Complete
• Propagation of Probabilities, Means, and Variances in Mixed Graphical Association Models
• Log-Linear Models for Frequency Tables with Ordered Classifications
• Algorithmic Aspects of Vertex Elimination on Graphs
• On Linear Recognition of Tree-Width at Most Four
• Verteilungsfunktionen mit gegebenen Marginalverteilungen
• Markov Measures and Markov Extensions
• A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
• On a Least Squares Adjustment of a Sampled Frequency Table When the Expected Marginal Totals are Known

This page was built for publication: An implementation of the iterative proportional fitting procedure by propagation trees.