An implementation of the iterative proportional fitting procedure by propagation trees.
From MaRDI portal
Publication:1606471
DOI10.1016/S0167-9473(01)00013-5zbMATH Open1061.65500MaRDI QIDQ1606471FDOQ1606471
Authors: J. H. Badsberg, Francesco M. Malvestuto 
Publication date: 24 July 2002
Published in: Computational Statistics and Data Analysis (Search for Journal in Brave)
Recommendations
- On the effective implementation of the iterative proportional fitting procedure
- A fast algorithm for iterative proportional fitting in log-linear models
- Parallel Iterative Proportional Fitting
- Convergence of the iterative proportional fitting procedure
- Iterative proportional fitting for nonhierarchical log-linear models
Markov extensionAcyclic hypergraphIterative proportional fitting procedureProbabilistic databasePropagation tree
Cites Work
- Network flows. Theory, algorithms, and applications.
- On a Least Squares Adjustment of a Sampled Frequency Table When the Expected Marginal Totals are Known
- Title not available (Why is that?)
- Title not available (Why is that?)
- Propagation of Probabilities, Means, and Variances in Mixed Graphical Association Models
- Title not available (Why is that?)
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- Decomposition by clique separators
- I-divergence geometry of probability distributions and minimization problems
- Title not available (Why is that?)
- Complexity of Finding Embeddings in a k-Tree
- Title not available (Why is that?)
- On the tree representation of chordal graphs
- Title not available (Why is that?)
- Treewidth. Computations and approximations
- Optimal decomposition by clique separators
- Title not available (Why is that?)
- 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
- Algorithmic Aspects of Vertex Elimination on Graphs
- On Linear Recognition of Tree-Width at Most Four
- Computing the Minimum Fill-In is NP-Complete
- Title not available (Why is that?)
- Markov fields and log-linear interaction models for contingency tables
- Title not available (Why is that?)
- A fast algorithm for query optimization in universal-relation databases
- Decomposition of a hypergraph by partial-edge separators
- Existence of extensions and product extensions for discrete probability distributions
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the effective implementation of the iterative proportional fitting procedure
- Computing the maximum-entropy extension of given discrete probability distributions
- Verteilungsfunktionen mit gegebenen Marginalverteilungen
- Log-Linear Models for Frequency Tables with Ordered Classifications
- A fast algorithm for iterative proportional fitting in log-linear models
- Markov Measures and Markov Extensions
Cited In (11)
- Iterative proportional scaling via decomposable submodels for contingency tables
- Multiplicity adjustment for temporal and spatial scan statistics using Markov property
- 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
- Local computations of the iterative proportional scaling procedure for hierarchical models
- A backward selection procedure for approximating a discrete probability distribution by decomposable models
- Title not available (Why is that?)
- Hierarchical subspace models for contingency tables
- Title not available (Why is that?)
- Characteristic properties and recognition of graphs in which geodesic and monophonic convexities are equivalent
- A fast algorithm for iterative proportional fitting in log-linear models
This page was built for publication: An implementation of the iterative proportional fitting procedure by propagation trees.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1606471)
