Summarizing and visualizing a set of bayesian networks with quasi essential graphs - LINA-DUKE
Communication Dans Un Congrès Année : 2011

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

Résumé

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.
Fichier principal
Vignette du fichier
ASMDA2011-Submission-QEG.pdf (405.7 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00645005 , version 1 (17-04-2020)

Identifiants

  • HAL Id : hal-00645005 , version 1

Citer

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⟩
326 Consultations
133 Téléchargements

Partager

More