Practical Aspects of Efficient Forward Selection in Decomposable Graphical Models

Authors:
Stephan M. Altmueller;Robert M. Haralick
Affiliations:
City University of New York Graduate Center;City University of New York Graduate Center
Venue:
ICTAI '04 Proceedings of the 16th IEEE International Conference on Tools with Artificial Intelligence
Year:
2004

Citing 0
Cited 1

Decomposable Families of Itemsets

ECML PKDD '08 Proceedings of the European conference on Machine Learning and Knowledge Discovery in Databases - Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we discuss efficient forward selection in the class of decomposable graphical models. This subclass of graphcial models has a number of desirable properties. The contributions of this paper are twofold. First we improve an existing algorithm by addressing cases previously not considered. Second we extend the algorithm to reflect model graphs with multiple disconnected components. We further present experimental results that apply this approach to a real dataset and discuss its properties. We belief that the presented approach is applicable to a wide area of fields and problems.