Efficient algorithms for conditional independence inference

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985556%3A_____%2F10%3A00353652" target="_blank" >RIV/67985556:_____/10:00353652 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Efficient algorithms for conditional independence inference

Original language description

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 involvedvariables. The computational experiments, described in the paper, also show that the new method is faster than the previous ones.

Czech name

—

Czech description

—

Type

J_x - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

CEP classification

BA - General mathematics

OECD FORD branch

—

Project

Result was created during the realization of more than one project. More information in the Projects tab.

Continuities

Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year

2010

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

Journal of Machine Learning Research

ISSN

1532-4435

e-ISSN

—

Volume of the periodical

11

Issue of the periodical within the volume

1

Country of publishing house

US - UNITED STATES

Number of pages

27

Pages from-to

—

UT code for WoS article

000286637200006

EID of the result in the Scopus database

—