Fast restricted casual inference

• Autorzy: Kłopotek M.
• Języki publikacji: EN

Abstrakty

EN

Hidden variables are well known sources of disturbance when recovering belief networks from data based oniy on measurable variables. Hence models assuming existence of hidden variables are under development. This paper presents a new algorithm "accelerating" the known CI algorithm of Spirtes, Glymour and Scheines [20]. We prove that this algorithm does not produces (conditional) independencies not present in the data if statistical independence test is reliable. This result is to be considered as non-trivial since e.g. the same claim fails to be true for FCI algorithm, another " accelerator" of CI, developed in [20].

Słowa kluczowe

EN

belief networks; discovery under casual insufficiency

• Wydawca: De Gruyter
• Czasopismo: Demonstratio Mathematica
• Rocznik: 2000
• Tom: Vol. 33, nr 2
• Strony: 419--442
• Opis fizyczny: Bibliogr. 21 poz.

Twórcy

autor

Kłopotek M.

• Institute of Computer Science Polish Academy of Sciences ul. Ordona 21 01-237 Warszawa, Poland,