Języki publikacji
Abstrakty
The relationship between graphoid independency relations (defined in the text) and such relations induced by Probabilistic Distributions (PD) with binary random variables is investigated. It is shown that there are axioms that are sound for a subset of PD-induced relations with binary variables and are independent of the Graphoid axioms (cannot be logically derived from those axioms).
Słowa kluczowe
Wydawca
Czasopismo
Rocznik
Tom
Strony
229--236
Opis fizyczny
bibliogr. 4 poz.
Twórcy
autor
- Technion IIT faculty of Computer Science and The Netanya Academic College, 14 Habonim St Kiriat Tivon 36031, Isralel, paz@cs.technion.ac.il
Bibliografia
- [1] J. Pearl: Probabilistic Reasoning in Intelligent Systems. Morgan Kaufmann, San Mateo, CA, 1988.
- [2] M. Sudeny: Conditional independence relations have no finite complete characterization. Proceedings of 11th Prague Conference on Information Theory, Satistical Decision Foundation and Random Processes, 1990.
- [3] M. Studeny: Semigraphoids and structures of probabilistic conditional independence. Annals of Mathematics and Artificial Intelligence, 21 (1997), 71-98.
- [4] M. Studeny: Private communication, 2000.
Identyfikator YADDA
bwmeta1.element.baztech-article-BUS2-0010-0104