Skip to main content
SpringerLink
Log in

A new algorithm for decomposition of graphical models

  • Published:
Acta Mathematicae Applicatae Sinica, English Series Aims and scope Submit manuscript

Abstract

In this paper, we combine Leimer’s algorithm with MCS-M algorithm to decompose graphical models into marginal models on prime blocks. It is shown by experiments that our method has an easier and faster implementation than Leimer’s algorithm.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Berry, A., Blair, J.R.S., Heggernes, P., Peyton, B.W. Maximum cardinality search for computing minimal triangulations of graph. Algorithmica, 39: 287–298 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  2. Blair, J.R.S., Peyton, B.W. An introduction to chordal graphs and clique trees. Graph Theory and Sparse Matrix Computation, IMA Volumes in Mathematics and its Applications, 56: 1–30 (1993)

    Article  MathSciNet  Google Scholar 

  3. Dempster, A.P. Covariance selection. Biometrics, 28: 157–175 (1972)

    Article  Google Scholar 

  4. Darroch, J.N., Lauritzen, S.L., Speed, T.P. Markov-fields and log-linear models for contingency tables. Annals of Statistics, 8: 522–539 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  5. Flores, M.J., Gámez, J. Triangulation of Bayesian networks by retriangulation. International Journal of Intelligent Systems, 18(2): 153–164 (2003)

    Article  MATH  Google Scholar 

  6. Friedman, N. Inferring cellular networks using probabilistic graphical models. Science, 303: 799–805 (2004)

    Article  Google Scholar 

  7. Geng, Z. Algorithm AS244: Decomposability and collapsibility for log-linear models. Applied Statistics, 38: 189–197 (1989)

    Article  Google Scholar 

  8. Geng, Z., Wang, C., Zhao, Q. Decomposition of search for v-structures in DAGs. Journal of Multivariate Analysis, 96: 282–294 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  9. Jirousek, R., Preucil, S. On the effective implementation of the iterative proportional fitting procedure. Computational Statistics & Data Analysis, 19: 177–189 (1995)

    Article  MATH  Google Scholar 

  10. Lauritzen, S.L. Graphical Models. Clarendon Press, Oxford, 1996

    Google Scholar 

  11. Lauritzen, S.L. Lectures on Contingency Tables. http://www.stats.ox.ac.uk/steffen/papers/cont.pdf, 2002

  12. Lauritzen, S.L., Spiegelhalter, D.J. Local computations with probabilities on graphical structures and their application to expert systems (with discussion). Journal of the Royal Statistical Society, Series B, 50: 157–224 (1998)

    MathSciNet  Google Scholar 

  13. Lauritzen, S.L., Wermuth, N. Graphical models for associations between variables, some of which are qualitative and some quantitative. Annals of Statistics, 17: 31–57 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  14. Leimer, H.G. Optimal decomposition by cliques separators. Discrete Mathematics, 113: 99–123 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  15. Liu, B.H., Guo, J.H., Jing, B.Y. A note on minimal d-separation trees for structural learning. Artificial Intelligence, 174: 442–448 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  16. Ma, S., Gong, Q., Bohnert, H.J. An Arabidopsis gene network based on the graphical Gaussian model. Genome Research, 17: 1614–1625 (2007)

    Article  Google Scholar 

  17. Malvestuto, F.M. A hypergraph-theoretic analysis of collapsibility and decomposability for extended loglinear models. Statistics and Computing, 11(2): 155–169 (2001)

    Article  MathSciNet  Google Scholar 

  18. Olesen, K., Madsen, A. Maximal prime subgraph decomposition of Bayesian networks. IEEE Transactions on Systems, Man and Cybernetics, B, 32: 21–31 (2002)

    Article  Google Scholar 

  19. Pearl, J. Causality: Models, Reasoning, and Inference. Cambridge University Press, Cambridge, 2000

    MATH  Google Scholar 

  20. Rose, D.J., Tarjan, R.E., Lueker, G.S. Algorithmic aspects of vertex elimination on graphs. SIAM Journal on Computing, 5: 266–283 (1976)

    Article  MathSciNet  MATH  Google Scholar 

  21. Sachs, K., Perez, O., Pe’er, D., Lauffenburger, D.A., Nolan, G.P. Causal protein-signaling networks derived from multiparameter single-cell data. Science, 308: 523–529 (2005)

    Article  Google Scholar 

  22. Tarjan, R.E. Decomposition by clique separators. Discrete Mathematics, 55: 221–232 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  23. Tarjan, R.E., Yannakakis, M. Simple linear-time algorithms to test chordality of graphs, test acyclicicty of hypergraphs and selectively reduce acyclic hypergraphs. SIAM Journal on Computing, 13: 566–579 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  24. Verma, T., Pearl, J. Equivalence and synthesis of causal models. In: Proceedings of the Sixth Conference on Uncertainty in Artificial Intelligence, Elsevier, Amsterdam, 1990, 255–268

    Google Scholar 

  25. Wen, W.X. Optimal decomposition of belief networks. In: Proceedings of the Sixth Annual Conference on Uncertainty in Artificial Intelligence, 1990, 209–224

  26. Xie, X., Geng, Z. A recursive method for structural learning of directed acyclic graphs. Journal of Machine Learning Research, 9: 459–483 (2008)

    MathSciNet  MATH  Google Scholar 

  27. Xie, X., Geng, Z., Zhao, Q. Decomposition of structural learning about directed acyclic graphs. Artificial Intelligence, 170: 422–439 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  28. Xu, P.F., Guo, J.H. Improving the compilation stage of propagation algorithm of Bayesian networks by decomposition. Submitted for publication (2010)

  29. Xu, P.F., Guo, J.H., He, X. An improved iterative proportional scaling procedure for Gaussian graphical models. Journal of Computational and Graphical Statistics, 20(2): 417–431 (2011)

    Article  MathSciNet  Google Scholar 

  30. Xu, P.F., Guo, J.H., Tang, M.L. Structural learning for Bayesian networks by testing complete separators in prime blocks. Computational Statistics & Data Analysis, 55: 3135–3147 (2011)

    Article  MathSciNet  Google Scholar 

  31. Zhang, N.L., Poole, D. Exploiting causal independence in Bayesian network inference. Journal of Artificial Intelligence Research, 5: 301–328 (1996)

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Mathematics and Statistics, Northeast Normal University, Changchun, 130024, China

    Ping-feng Xu & Jian-hua Guo

  2. School of Basic Science, Changchun University of Technology, Changchun, 130012, China

    Ping-feng Xu

Authors
  1. Ping-feng Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jian-hua Guo
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jian-hua Guo.

Additional information

Supported by the National Natural Science Foundation of China (Nos. 10871038, 10926186, 11025102, 11071026 and 11101052), and the Jilin Project (No. 20100401).

Rights and permissions

Reprints and permissions

About this article

Cite this article

Xu, Pf., Guo, Jh. A new algorithm for decomposition of graphical models. Acta Math. Appl. Sin. Engl. Ser. 28, 571–582 (2012). https://doi.org/10.1007/s10255-012-0170-6

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10255-012-0170-6

Keywords

2000 MR Subject Classification

Search

Navigation