By Topic

Max-Relevance and Min-Redundancy Greedy Bayesian Network Learning on High Dimensional Data

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

2 Author(s)
Feng Liu ; Beijing Univ. of Posts & Telecommun., Beijing ; Qiliang Zhu

Existing algorithms for learning Bayesian network require a lot of computation on high dimensional itemsets which affects accuracy especially on limited datasets and takes up a large amount of time. To address the above problem, we propose a novel Bayesian network learning algorithm MRMRG, Max Relevance-Min Redundancy Greedy. MRMRG algorithm is a variant of K2 which is a well- known BN learning algorithm. We also analyze the time complexity of MRMRG. The experimental results show that MRMRG algorithm has much better efficiency and accuracy than most of existing algorithms on limited datasets.

Published in:

Natural Computation, 2007. ICNC 2007. Third International Conference on  (Volume:1 )

Date of Conference:

24-27 Aug. 2007