Characterization of inclusion neighbourhood in terms of the essential graph

Result code in IS VaVaI

RIV/67985556:_____/05:00411275 - isvavai.cz

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Characterization of inclusion neighbourhood in terms of the essential graph

Original language description

The motivation of the problem solved in the paper is learning Bayesian networks. Neighbouring equivalence classes of a given equivalence class of Bayesian networks in the sense of so-called inclusion neighbourhood are characterized efficiently in terms of the respective standard representative of the equivalence class, which is named the essential graph.

Czech name

Charakterizace inlusion-okolí v termínech esenciálního grafu

Czech description

Motivace řešeného problému je učení Bayesovských sítí. Jsou charakterizovány sousední třídy ekvivalence dané třídy ekvivalence Bayesovských sítí ve smyslu inclusion-okolí a to v termínech standardního reprezentanta oné třídy ekvivalence, nazývaného esenciální graf.

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

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year

2005

Confidentiality

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

Name of the periodical

International Journal of Approximate Reasoning

ISSN

0888-613X

e-ISSN

—

Volume of the periodical

38

Issue of the periodical within the volume

3

Country of publishing house

US - UNITED STATES

Number of pages

27

Pages from-to

283-309

UT code for WoS article

—

EID of the result in the Scopus database

—