Semantic Scholar Open Access 2013 567 sitasi

Causal networks: semantics and expressiveness

Thomas Verma J. Pearl

Abstrak

Dependency knowledge of the form “ x is independent of y once z is known” invariably obeys the four graphoid axioms, examples include probabilistic and database dependencies. Often, such knowledge can be represented efficiently with graphical structures such as undirected graphs and directed acyclic graphs (DAGs). In this paper we show that the graphical criterion called d-separation is a sound rule for reading independencies from any DAG based on a causal input list drawn from a graphoid. The rule may be extended to cover DAGs that represent functional dependencies as well as conditional dependencies.

Topik & Kata Kunci

Computer Science Mathematics

Penulis (2)

Thomas Verma

J. Pearl

Format Sitasi

APA MLA BibTeX

Verma, T., Pearl, J. (2013). Causal networks: semantics and expressiveness. https://doi.org/10.1016/b978-0-444-88650-7.50011-1

Akses Cepat

PDF tidak tersedia langsung

Cek di sumber asli →

Lihat di Sumber doi.org/10.1016/b978-0-444-88650-7.50011-1

Informasi Jurnal

Tahun Terbit: 2013
Bahasa: en
Total Sitasi: 567×
Sumber Database: Semantic Scholar
DOI: 10.1016/b978-0-444-88650-7.50011-1
Akses: Open Access ✓