Scheduled System Maintenance:
On May 6th, single article purchases and IEEE account management will be unavailable from 8:00 AM - 12:00 PM ET (12:00 - 16:00 UTC). We apologize for the inconvenience.
By Topic

Structure Learning Based on Ordering of Sets

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
$31 $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

3 Author(s)
Tao Du ; Dept. of Comput. Sci., Shanghai Jiao Tong Univ. ; Shensheng Zhang ; Zongjiang Wang

When learning Bayesian networks from data, in many real circumstances, experts of domains could give the relationships between the classes of variables. In this paper, the problem of `learning Bayesian networks based on ordering of sets' is formulated. To solve this problem, we propose a partitioned greedy search algorithm for learning structures of Bayesian networks based on the ordering of sets. The results of experiments show that, with the ordering of sets, compared with traditional greedy DAG search algorithm, the score of the structure obtained by our algorithm is improved, and the search time is greatly reduced

Published in:

Computer and Information Technology, 2005. CIT 2005. The Fifth International Conference on

Date of Conference:

21-23 Sept. 2005