Skip to Main content Skip to Navigation
Conference papers

Summarizing and visualizing a set of bayesian networks with quasi essential graphs

Abstract : Many learning methods now generate a set of models in order to improve robustness. Evaluating for instance the quality of a set of Bayesian networks is quite usual for estimating separately the quality of each model and for summarizing these results. Visualizing the outcomes are a more complex task. We propose in this work an approach based on an inverse principle. Firstly, we build the Quasi Essential Graph (QEG), "most" representative of the whole set. Then, we apply the usual quality operators for this new object. This paper describes the notion and properties of Quasi Essential Graph. An algorithm for its extraction is proposed, as well as a graphical metaphor for its visualization. A toy example is finally given for the sake of illustration.
Document type :
Conference papers
Complete list of metadata

Cited literature [15 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00645005
Contributor : Philippe Leray Connect in order to contact the contributor
Submitted on : Friday, April 17, 2020 - 9:42:27 PM
Last modification on : Wednesday, April 27, 2022 - 3:42:42 AM

File

ASMDA2011-Submission-QEG.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00645005, version 1

Citation

Hoai-Tuong Nguyen, Philippe Leray, Gérard Ramstein. Summarizing and visualizing a set of bayesian networks with quasi essential graphs. ASMDA 2011, 2011, Roma, Italy. pp.1062-1069. ⟨hal-00645005⟩

Share

Metrics

Record views

110

Files downloads

77