Solution of the marginal problem and decomposable distributions

Radim Jiroušek

Kybernetika (1991)

  • Volume: 27, Issue: 5, page 403-412
  • ISSN: 0023-5954

How to cite

top

Jiroušek, Radim. "Solution of the marginal problem and decomposable distributions." Kybernetika 27.5 (1991): 403-412. <http://eudml.org/doc/29011>.

@article{Jiroušek1991,
author = {Jiroušek, Radim},
journal = {Kybernetika},
keywords = {iterative proportional fitting procedure; Decomposability of the marginal system; product of conditional distributions},
language = {eng},
number = {5},
pages = {403-412},
publisher = {Institute of Information Theory and Automation AS CR},
title = {Solution of the marginal problem and decomposable distributions},
url = {http://eudml.org/doc/29011},
volume = {27},
year = {1991},
}

TY - JOUR
AU - Jiroušek, Radim
TI - Solution of the marginal problem and decomposable distributions
JO - Kybernetika
PY - 1991
PB - Institute of Information Theory and Automation AS CR
VL - 27
IS - 5
SP - 403
EP - 412
LA - eng
KW - iterative proportional fitting procedure; Decomposability of the marginal system; product of conditional distributions
UR - http://eudml.org/doc/29011
ER -

References

top
  1. I. Csiszár, I -divergence geometry of probability distributions and minimization problems, Ann. Probab. 3 (1975), 146-158. (1975) MR0365798
  2. W. E. Deming, F. F. Stephan, On a least square adjustment of a sampled frequency table when the expected marginal totals are known, Ann. Math. Statist. 11 (1940), 427-444. (1940) MR0003527
  3. A. Feinstein, Foundations of Information Theory, McGraw-Hill, New York-Toronto- London 1958. (1958) Zbl0082.34602MR0095087
  4. R. Jiroušek, A survey of methods used in probabilistic expert system for knowledge integration, Knowledge Based Systems 3 (1990), 1, 7-12. (1990) 
  5. H. G. Kellerer, Verteilungsfunktionen mit gegeben Marginalverteilungen, Z. Warhsch. Verw. Gebiete 3 (1964), 247-270. (1964) MR0175158
  6. F. M. Malvestuto, Computing the maximum-entropy extension of given discrete probability distributions, Coraput. Statist. Data Anal. 8 (1989), 299-311. (1989) Zbl0726.62012MR1028405
  7. Lianwen Zhang, Studies on finding hyper tree covers for hypergraphs, Working Paper No. 198, School of Business, The University of Kansas, Lawrence 1988. (198,) 
  8. R. E. Tarjan, M. Yannakakis, Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs, SIAM J. Comput. 13 (1984), 3, 566-579: (1984) Zbl0545.68062MR0749707

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.