Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

article · International Journal of Approximate Reasoning · 2013

Independence for full conditional probabilities: Structure, factorization, non-uniqueness, and Bayesian networks

Fábio Gagliardi Cozman

Cited by 11Open access

Abstract

The index has no abstract for this paper. The publisher’s page may have one.

Cite this paper

APA 7

Cozman, F. G. (2013). Independence for full conditional probabilities: Structure, factorization, non-uniqueness, and Bayesian networks. International Journal of Approximate Reasoning, 54(9), 1261–1278. https://doi.org/10.1016/j.ijar.2013.08.001

MLA 9

Cozman, Fábio Gagliardi. “Independence for full conditional probabilities: Structure, factorization, non-uniqueness, and Bayesian networks.” International Journal of Approximate Reasoning, vol. 54, no. 9, 2013, pp. 1261–78, https://doi.org/10.1016/j.ijar.2013.08.001.

Chicago

Cozman, Fábio Gagliardi. 2013. “Independence for full conditional probabilities: Structure, factorization, non-uniqueness, and Bayesian networks.” International Journal of Approximate Reasoning 54 (9): 1261–78. https://doi.org/10.1016/j.ijar.2013.08.001.

Harvard

Cozman, F.G. (2013) ‘Independence for full conditional probabilities: Structure, factorization, non-uniqueness, and Bayesian networks’, International Journal of Approximate Reasoning, 54(9), pp. 1261–1278. Available at: https://doi.org/10.1016/j.ijar.2013.08.001.

BibTeX
@article{cozman2013independence,
  title = {{Independence for full conditional probabilities: Structure, factorization, non-uniqueness, and Bayesian networks}},
  author = {Cozman, Fábio Gagliardi},
  journal = {International Journal of Approximate Reasoning},
  volume = {54},
  number = {9},
  pages = {1261--1278},
  year = {2013},
  doi = {10.1016/j.ijar.2013.08.001}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.

Related papers