Markovian combination of subgraphs of DAGs

Proceedings of the 10th IASTED International Conference on Artificial Intelligence and Applications, AIA 2010

Volumn , Issue , 2010, Pages 90-95

  Kim, Sung Ho ^a  

^a Korea Advanced Institute of Science and Technology (KAIST)   (South Korea)

Author keywords

Collision node; D separateness; Dashed line; Graphical marginalization; Separateness condition; Smallest ancestral set

Indexed keywords

BAYESIAN NETWORK MODELS; CAUSAL RELATIONSHIPS; DASHED LINES; DIRECTED ACYCLIC GRAPHS; GRAPHICAL MODEL; GREEDY SEARCH ALGORITHMS; MARGINALIZATION; MARKOVIAN; RANDOM VECTORS; STRUCTURE-LEARNING; SUBGRAPHS; SUBVECTORS; YIELD MODELS;

ARTIFICIAL INTELLIGENCE; DISTRIBUTED PARAMETER NETWORKS; EARTHQUAKE RESISTANCE; GRAPHIC METHODS; INFERENCE ENGINES; INTELLIGENT NETWORKS; LEARNING ALGORITHMS; LEARNING SYSTEMS; MODEL STRUCTURES; RANDOM VARIABLES; SPEECH RECOGNITION;

BAYESIAN NETWORKS;

EID: 77954574065     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (13)

1. Pearl, J. (1986). Fusion, propagation and structuring in belief networks, Artificial Intelligence, 29, 241-288.
2. Pearl, J. (1988). Probabilistic Reasoning In Intelligent Systems: Networks of Plausible Inference, San Mateo, CA.: Morgan Kaufmann.
3. Meek, C. (1995). Causal influence and causal explanation with background knowledge, In: Uncertainty in Artificial Intelligence: Proceedings of the Eleventh Conference, P. Besnard and S. Hanks (Ed.), 403-410, San Mateo, CA.: Morgan Kaufmann.
4. Spirtes, P., Glymour, C., and Scheines, R. (2000). Causation, Prediction, and Search, 2nd ed., Cambridge, Massachusetts: MIT Press.
5. Neapolitan, R.E. (2004). Learning Bayesian Networks, Upper Saddle River, NJ: Pearson Prentice Hall.
6. Chickering,D. (1996). Learning Bayesian networks is NP-complete, in D. Fisher and H. Lenz (Eds.) Learning from Data Springer-Verlag, 121-130.
7. Fienberg, S.E. and Kim, S.-H. (1999). Combining conditional log-linear structures, J. Am. Statist. Ass., 445(94), 229-239.
8. Kim, S.-H. (2006a). Conditional log-linear structures for log-linear modelling, Computational Statistics and Data Analysis, 50(8), 2044-2064.
9. Whittaker, J. (1990). Graphical Models in Applied Multivariate Statistics, New York: Wiley
10. Kim, S.-H. (2006b). Properties of Markovian subgraphs of a decomposable graph, Lecture Notes in Artificial Intelligence, LNAI 4293, 15-26.
11. Kim, S.-H. and Lee, S. (2008). Searching model structures based on marginal model structures. In New Developments in Robotics, Automation and Control, Vienna, Austria: I-Tech Education and Publishing.
12. Koster, J.T.A. (2002). Marginalizing and conditioning in graphical models, Bernoulli 8(6), 817-840.
13. Kim, S.-H. (2009). Markovian combination of graphical model structures of undirected graphs. The 27th IASTED International Conference on Artificial Intelligence and Application, Innsbruck, Austria, Feb. 16-18, pp. 214-219.