Home > Table of Contents


Proceedings of 2009 International Workshop on Information Security and Application (IWISA 2009)

Qingdao, China, November 21-22, 2009

Editors: Feng Gao and Xijun Zhu

AP Catalog Number: AP-PROC-CS-09CN004

ISBN: 978-952-5726-06-0

Page(s): 576-579

Study of Multi-agent Search Algorithms of the Structural Learning in Bayesian Network Learning

Yonghui Cao

Full text: PDF


Structural learning is finding the best network that fits the available data and is optimally complex. This can be accomplished by utilizing a search algorithm over the possible network structures. In this paper, a greater importance is given to the search algorithm because we have assumed that the data will be complete. That is, each element of the database is a valid state of a variable. If there are non-applicable entries in the database then the database is said to be incomplete. In the paper, we explore the search algorithms used in this research. In the algorithms, the arcs are added heuristically and exhaustively.

Index Terms

Search Algorithms, Heuristic Search, Exhaustive Search

Copyright @ 2009 ACADEMY PUBLISHER All rights reserved