Založeno v roce 2005 s podporou MŠMT ČR (projekt 1M0572)

Publikace

Efficient algorithms for conditional independence inference

Typ:
Článek v odborném periodiku
Autoři publikace:
Bouckaert R., Hemmecke R., Lindner S., Studený M.
Název periodika:
Journal of Machine Learning Research
Rok:
2010
Číslo:
1 (2010)
Strany:
3453-3479
ISSN:
1532-4435
Klíčová slova:
conditional independence inference, linear programming appro
Anotace:
The topic of the paper is computer testing of (probabilistic) conditional independence (CI) implications by an algebraic method of structural imsets. The basic idea is to transform CI statements into certain integral vectors and to verify by a computer the corresponding algebraic relation between the vectors, called the independence implication. The main contribution of the paper is a new method, based on linear programming (LP), which overcomes the limitation of former methods to the number of involved variables. The computational experiments, described in the paper, also show that the new method is faster than the previous ones.
 
Copyright 2005 DAR XHTML CSS