Improved K2 algorithm for Bayesian network structure learning

In this paper, we study the problem of learning the structure of Bayesian networks from data, which takes a dataset and outputs a directed acyclic graph. This problem is known to be NP-hard. Almost most of the existing algorithms for structure learning can be classified into three categories: constr...

Full description

Bibliographic Details

Published in:	Engineering applications of artificial intelligence Vol. 91; p. 103617
Main Authors:	Behjati, Shahab, Beigy, Hamid
Format:	Journal Article
Language:	English
Published:	Elsevier Ltd 01.05.2020
Subjects:	Bayesian network Constraint-based algorithm Score-based algorithms Structure learning Constraint-based algorithm Structure learning Score-based algorithms Bayesian network
ISSN:	0952-1976, 1873-6769
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!