By Topic

Practical aspects of efficient forward selection in decomposable graphical models

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
S. M. Altmueller ; Dept. of Comput. Sci., City Univ. of New York, NY, USA ; R. M. Haralick

We discuss efficient forward selection in the class of decomposable graphical models. This subclass of graphical models has a number of desirable properties. The contributions of This work 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.

Published in:

Tools with Artificial Intelligence, 2004. ICTAI 2004. 16th IEEE International Conference on

Date of Conference:

15-17 Nov. 2004