Advanced Search

Query:

Fill in the form and click »Search«...

Format:

Display: entries per page entries

Zbl 1186.68356
Borgelt, Christian
A conditional independence algorithm for learning undirected graphical models. (English)
[J] J. Comput. Syst. Sci. 76, No. 1, 21-33 (2010). ISSN 0022-0000

Summary: When it comes to learning graphical models from data, approaches based on conditional independence tests are among the most popular methods. Since Bayesian networks dominate research in this field, these methods usually refer to directed graphs, and thus have to determine not only the set of edges, but also their direction. At least for a certain kind of possibilistic graphical models, however, undirected graphs are a much more natural basis. Hence, in this area, algorithms for learning undirected graphs are desirable, especially, since first learning a directed graph and then transforming it into an undirected one wastes resources and computation time. In this paper, I present a general algorithm for learning undirected graphical models, which is strongly inspired by the well-known Cheng-Bell-Liu algorithm for learning Bayesian networks from data. Its main advantage is that it needs fewer conditional independence tests, while it achieves results of comparable quality.

MSC 2000:: *68T05 Learning and adaptive systems
68R10 Graph theory in connection with computer science
68W05 Nonnumerical algorithms

Keywords: graphical models; possibilistic network; learning from data; conditional independence test

Comment on this Item PDF MathML XML ASCII DVI PS BibTeX Online Ordering Article Journal

	Scientific prize winners of the ICM 2010
	Overhang
	Lie groups, physics and geometry. An introduction for physicists, engineers and chemists.

Advanced Search

Zentralblatt MATH Berlin [Germany]