메뉴 건너뛰기




Volumn 20, Issue 2, 2011, Pages 417-431

An improved iterative Proportional scaling Procedure for Gaussian graphical models

Author keywords

Junction tree; Probability propagation algorithm

Indexed keywords


EID: 80051643920     PISSN: 10618600     EISSN: None     Source Type: Journal    
DOI: 10.1198/jcgs.2010.09044     Document Type: Article
Times cited : (14)

References (33)
  • 2
    • 0035964959 scopus 로고    scopus 로고
    • An Implementation of the iterative proportional fitting procedure by propagation Trees
    • [418,429]
    • Badsberg, J. H., and Malvestuto, F. M. (2001), "An Implementation of the Iterative Proportional Fitting Procedure by Propagation Trees," Computational Statistics & Data Analysis, 37, 297-322. [418,429]
    • (2001) Computational Statistics & Data Analysis , vol.37 , pp. 297-322
    • Badsberg, J.H.1    Malvestuto, F.M.2
  • 3
    • 21044444304 scopus 로고    scopus 로고
    • Maximum Cardinality Search for Computing Minimal Triangulations of Graph
    • [425]
    • Berry, A., Blair, J. R. S., Heggernes, P., and Peyton, B. W. (2004), "Maximum Cardinality Search for Computing Minimal Triangulations of Graph," Algorithmica, 39, 287-298. [425]
    • (2004) Algorithmica , vol.39 , pp. 287-298
    • Berry, A.1    Blair, J.R.S.2    Heggernes, P.3    Peyton, B.W.4
  • 5
    • 84976668743 scopus 로고
    • Algorithm 457: Finding all cliques of an undirected graph
    • [425]
    • Bron, C., and Kerbosch, J. (1973), "Algorithm 457: Finding All Cliques of an Undirected Graph," Communications of the ACM, 16, 575-577. [425]
    • (1973) Communications of the ACM , vol.16 , pp. 575-577
    • Bron, C.1    Kerbosch, J.2
  • 6
    • 34548525473 scopus 로고    scopus 로고
    • Simulation of hyper-inversewishart distributions in graphical models
    • [429]
    • Carvalho, C. M., Massam, H., andWest, M. (2007), "Simulation of Hyper-InverseWishart Distributions in Graphical Models," Biometrika, 94 (3), 647-659. [429]
    • (2007) Biometrika , vol.94 , Issue.3 , pp. 647-659
    • Carvalho, C.M.1    Massam, H.2    Andwest, M.3
  • 8
    • 0000546609 scopus 로고
    • I-Divergence geometry of probability distributions andminimization problems
    • [417]
    • Csiszár, I. (1975), "I-Divergence Geometry of Probability Distributions andMinimization Problems," The Annals of Probability, 3, 146-158. [417]
    • (1975) The Annals of Probability , vol.3 , pp. 146-158
    • Csiszár, I.1
  • 9
    • 0010159449 scopus 로고
    • A geometric interpretation of darroch and Ratcliff's generalized iterative scaling
    • [417]
    • Csiszár, I. (1989), "A Geometric Interpretation of Darroch and Ratcliff's Generalized Iterative Scaling," The Annals of Statistics, 17, 1409-1413. [417]
    • (1989) The Annals of Statistics , vol.17 , pp. 1409-1413
    • Csiszár, I.1
  • 10
    • 0001573124 scopus 로고
    • Generalized iterative scaling for log-linear models
    • [417,418]
    • Darroch, J. N., and Ratcliff, D. (1972), "Generalized Iterative Scaling for Log-Linear Models," The Annals of Mathematical Statistics, 43, 1470-1480. [417,418]
    • (1972) The Annals of Mathematical Statistics , vol.43 , pp. 1470-1480
    • Darroch, J.N.1    Ratcliff, D.2
  • 11
    • 0000695960 scopus 로고
    • On a Least Squares adjustment of a sampled frequency table when the expected Marginal Totals Are Known
    • [417]
    • Deming, W. E., and Stephan, F. F. (1940), "On a Least Squares Adjustment of a Sampled Frequency Table When the Expected Marginal Totals Are Known," The Annals of Mathematical Statistics, 11, 427-444. [417]
    • (1940) The Annals of Mathematical Statistics , vol.11 , pp. 427-444
    • Deming, W.E.1    Stephan, F.F.2
  • 12
    • 0001038826 scopus 로고
    • Covariance selection
    • [417]
    • Dempster, A. P. (1972), "Covariance Selection," Biometrics, 28, 157-175. [417]
    • (1972) Biometrics , vol.28 , pp. 157-175
    • Dempster, A.P.1
  • 13
    • 0001489493 scopus 로고
    • An iterative procedure for estimation in contingency tables
    • [417,418]
    • Fienberg, S. E. (1970), "An Iterative Procedure for Estimation in Contingency Tables," The Annals of Mathematical Statistics, 41, 907-917. [417,418]
    • (1970) The Annals of Mathematical Statistics , vol.41 , pp. 907-917
    • Fienberg, S.E.1
  • 15
    • 77952004703 scopus 로고    scopus 로고
    • A Localization approach to improve iterative proportional scaling in gaussian Graphical Models
    • [418,421,428]
    • Hara, H., and Takemura, A. (2010), "A Localization Approach to Improve Iterative Proportional Scaling in Gaussian Graphical Models," Communications in Statistics-Theory and Methods, 39, 1643-1654. [418,421,428]
    • (2010) Communications in Statistics-Theory and Methods , vol.39 , pp. 1643-1654
    • Hara, H.1    Takemura, A.2
  • 17
    • 0003641246 scopus 로고
    • On the effective implementation of the iterative proportional fitting procedure
    • [418]
    • Jirousek, R., and Preucil, S. (1995), "On the Effective Implementation of the Iterative Proportional Fitting Procedure," Computational Statistics & Data Analysis, 19, 177-189. [418]
    • (1995) Computational Statistics & Data Analysis , vol.19 , pp. 177-189
    • Jirousek, R.1    Preucil, S.2
  • 18
    • 0001893320 scopus 로고
    • Optimal decomposition of probabilistic networks by simulated annealing
    • [425]
    • Kjærulff, U. (1992), "Optimal Decomposition of Probabilistic Networks by Simulated Annealing," Statistics and Computing, 2, 7-17. [425]
    • (1992) Statistics and Computing , vol.2 , pp. 7-17
    • Kjærulff, U.1
  • 19
    • 0039607518 scopus 로고
    • Probability densities with given marginals
    • [417]
    • Kullback, S. (1968), "Probability Densities With Given Marginals," The Annals of Mathematical Statistics, 39, 1236-1243. [417]
    • (1968) The Annals of Mathematical Statistics , vol.39 , pp. 1236-1243
    • Kullback, S.1
  • 20
    • 0043229654 scopus 로고    scopus 로고
    • Decomposing bayesian networks: Triangulation of the moral graph with genetic algorithms
    • [425]
    • Larrañaga, P., Kuijpers, C. M. H., Poza, M., and Murga, R. (1997), "Decomposing Bayesian Networks: Triangulation of the Moral Graph With Genetic Algorithms," Statistic and Computing, 7, 19-34. [425]
    • (1997) Statistic and Computing , vol.7 , pp. 19-34
    • Larrañaga, P.1    Kuijpers, C.M.H.2    Poza, M.3    Murga, R.4
  • 21
    • 0004047518 scopus 로고    scopus 로고
    • Oxford: Clarendon Press. [417-420,428]
    • Lauritzen, S. L. (1996), Graphical Models, Oxford: Clarendon Press. [417-420,428]
    • (1996) Graphical Models
    • Lauritzen, S.L.1
  • 22
    • 0041377763 scopus 로고    scopus 로고
    • Stable local computation with conditional gaussian distributions
    • [421]
    • Lauritzen, S. L., and Jensen, F. (2001), "Stable Local Computation With Conditional Gaussian Distributions," Statistics and Computing, 11, 191-203. [421]
    • (2001) Statistics and Computing , vol.11 , pp. 191-203
    • Lauritzen, S.L.1    Jensen, F.2
  • 23
    • 0002645829 scopus 로고
    • Optimal decomposition by clique separators
    • [428]
    • Leimer, H. G. (1993), "Optimal Decomposition by Clique Separators," Discrete Mathematics, 113, 99-123. [428]
    • (1993) Discrete Mathematics , vol.113 , pp. 99-123
    • Leimer, H.G.1
  • 24
    • 33645568358 scopus 로고    scopus 로고
    • Gradient directed regularization for sparse gaussian concentration graphs, with applications to inference of genetic networks
    • [417]
    • Li, H., and Gui, J. (2006), "Gradient Directed Regularization for Sparse Gaussian Concentration Graphs, With Applications to Inference of Genetic Networks," Biostatistics, 7, 302-317. [417]
    • (2006) Biostatistics , vol.7 , pp. 302-317
    • Li, H.1    Gui, J.2
  • 25
    • 35948931439 scopus 로고    scopus 로고
    • An arabidopsis gene network based on the graphical gaussian model
    • [417,426]
    • Ma, S., Gong, Q., and Bohnert, H. J. (2007), "An Arabidopsis Gene Network Based on the Graphical Gaussian Model," Genome Research, 17, 1614-1625. [417,426]
    • (2007) Genome Research , vol.17 , pp. 1614-1625
    • Ma, S.1    Gong, Q.2    Bohnert, H.J.3
  • 26
    • 0042209519 scopus 로고    scopus 로고
    • Decomposition of a hypergraph by partial-edge separators
    • [428]
    • Malvestuto, F. M., and Moscarini, M. (2000), "Decomposition of a Hypergraph by Partial-Edge Separators," Theoretical Computer Science, 237, 57-79. [428]
    • (2000) Theoretical Computer Science , vol.237 , pp. 57-79
    • Malvestuto, F.M.1    Moscarini, M.2
  • 27
    • 21844498858 scopus 로고
    • Convergence of the iterative proportional fitting procedure
    • [418]
    • Rüschendorf, L. (1995), "Convergence of the Iterative Proportional Fitting Procedure," The Annals of Statistics, 23, 1160-1174. [418]
    • (1995) The Annals of Statistics , vol.23 , pp. 1160-1174
    • Rüschendorf, L.1
  • 28
    • 0001568882 scopus 로고
    • Gaussian markov distribution over finite graphs
    • [417,418,420]
    • Speed, T. P., and Kiiveri, H. T. (1986), "Gaussian Markov Distribution Over Finite Graphs," The Annals of Statistics, 14, 138-150. [417,418,420]
    • (1986) The Annals of Statistics , vol.14 , pp. 138-150
    • Speed, T.P.1    Kiiveri, H.T.2
  • 33
    • 80051612890 scopus 로고    scopus 로고
    • A new algorithm for decomposition of graphical models
    • to appear, [425]
    • Xu, P. F., and Guo, J. H. (2010), "A New Algorithm for Decomposition of Graphical Models," Acta Mathematicae Applicatae Sinica, to appear. [425]
    • (2010) Acta Mathematicae Applicatae Sinica
    • Xu, P.F.1    Guo, J.H.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.