Multiple hypothesis testing and quasi essential graph for comparing two sets of Bayesian networks

1Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In machine learning, graphical models like Bayesian networks are one of important visualization tools that can be learned from data to represent pictorially a complex system. In order to compare two complex systems (or one complex system functioning in two different contexts), one usually compares directly their representative graphs. However, with small sample size data, it is hard to learn the graph that represents precisely the system. That's why ensemble methods (e.g. Bootstrapping, evolutionary algorithm, etc...) are proposed to learn from data of each system a set of graphs that represents more precisely this system. Then, for comparing two systems, one needs a mechanism to compare two sets of graphs. We propose in this work an approach based on multiple hypothesis testing and quasi essential graph (QEG) to compare two sets of Bayesian networks. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Nguyen, H. T., Leray, P., & Ramstein, G. (2011). Multiple hypothesis testing and quasi essential graph for comparing two sets of Bayesian networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6882 LNAI, pp. 176–185). https://doi.org/10.1007/978-3-642-23863-5_18

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free