LEARNING BAYESIAN NETWORKS WITH LARGEST CHAIN GRAPHS

Mohamed BENDOU; Paul MUNTEANU

Research.Publish.Connect.

*Please fill out at least one Field. *Value must be an number!

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Name:
Country:
Subject:

Advanced Search Affiliations Search

If you're looking for an exact phrase use quotation marks on text fields.

Proceedings

Proceedings Search *Please fill out at least one Field. *Value must be an number!

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

If you're looking for an exact phrase use quotation marks on text fields.

Papers

Papers Search *Please fill out at least one Field.

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

If you're looking for an exact phrase use quotation marks on text fields.

Authors

Authors Search *Please fill out at least one Field.

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

If you're looking for an exact phrase use quotation marks on text fields.

Advanced Search

Paper

LEARNING BAYESIAN NETWORKS WITH LARGEST CHAIN GRAPHS

Topics: Bayesian Networks

In Proceedings of the Sixth International Conference on Enterprise Information Systems - Volume 2: ICEIS, 184-190, 2004 , Porto, Portugal

Authors: Mohamed BENDOU and Paul MUNTEANU

Affiliation: ESIEA Recherche, France

Keyword(s): Bayesian networks, equivalence classes, learning, largest chain graphs, essential graphs, instanciable partially oriented graph

Related Ontology Subjects/Areas/Topics: Artificial Intelligence ; Artificial Intelligence and Decision Support Systems ; Bayesian Networks ; Enterprise Information Systems ; Soft Computing

Abstract: This paper proposes a new approach for designing learning bayesian network algorithms that explore the structure equivalence classes space. Its main originality consists in the representation of equivalence classes by largest chain graphs, instead of essential graphs which are generally used in the similar task. We show that this approach drastically simplifies the algorithms formulation and has some beneficial aspects on their execution time.

CC BY-NC-ND 4.0

Guest: Register as new SciTePress user now for free.

SciTePress user: please login.

My Papers

You are not signed in, therefore limits apply to your IP address 3.144.113.197

In the current month:

Recent papers: 100 available of 100 total

2⁺ years older papers: 200 available of 200 total

Paper citation in several formats:

BENDOU, M. and MUNTEANU, P. (2004). LEARNING BAYESIAN NETWORKS WITH LARGEST CHAIN GRAPHS. In Proceedings of the Sixth International Conference on Enterprise Information Systems - Volume 2: ICEIS; ISBN 972-8865-00-7; ISSN 2184-4992, SciTePress, pages 184-190. DOI: 10.5220/0002636301840190

@conference{iceis04,
author={Mohamed BENDOU. and Paul MUNTEANU.},
title={LEARNING BAYESIAN NETWORKS WITH LARGEST CHAIN GRAPHS},
booktitle={Proceedings of the Sixth International Conference on Enterprise Information Systems - Volume 2: ICEIS},
year={2004},
pages={184-190},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0002636301840190},
isbn={972-8865-00-7},
issn={2184-4992},
}

TY - CONF

JO - Proceedings of the Sixth International Conference on Enterprise Information Systems - Volume 2: ICEIS
TI - LEARNING BAYESIAN NETWORKS WITH LARGEST CHAIN GRAPHS
SN - 972-8865-00-7
IS - 2184-4992
AU - BENDOU, M.
AU - MUNTEANU, P.
PY - 2004
SP - 184
EP - 190
DO - 10.5220/0002636301840190
PB - SciTePress