Abstract
Existing algorithms for learning Bayesian network (BN) 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 alleviate the above problem, we propose a novel BN learning algorithm OMRMRG, Ordering-based Max Relevance and Min Redundancy Greedy algorithm. OMRMRG presents an ordering-based greedy search method with a greedy pruning procedure, applies Max-Relevance and Min-Redundancy feature selection method, and proposes Local Bayesian Increment function according to Bayesian Information Criterion (BIC) formula and the likelihood property of overfitting. Experimental results show that OMRMRG algorithm has much better efficiency and accuracy than most of existing BN learning algorithms on limited datasets.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Spirtes, P., Glymour, C., Scheines, R.: Causation, Prediction and Search. MIT Press, Massachusetts (2000)
Cheng, J., Greiner, R.: Learning Belief Networks form Data: An Information Theory Based Approach. Artificial Intelligence 137(1-2), 43–90 (2002)
Cooper, G., Herskovits, E.: A Bayesian method for constructing Bayesian belief networks from databases. In: UAI 1991, pp. 86–94. Morgan Kaufmann, San Francisco (1991)
Heckerman, D., Geiger, D.: Learning Bayesian Networks: the Combination of Knowledge and Statistical Data. Machine Learning 20(3), 197–243 (1995)
Wai, L., Fahiem, B.: Learning Bayesian Belief Networks An approach based on the MDL Principle. Computational Intelligence 10(4), 269–293 (1994)
HanChuan, P., Chris, D., Fuhui, L.: Minimum redundancy maximum relevance feature selection. IEEE Intelligent Systems 20(6), 70–71 (2005)
HanChuan, P., Fuhui, L., Chris, D.: Feature Selection Based on Mutual Information: Criteria of Max-Dependency, Max-Relevance,and Min-Redundancy. IEEE Transactions on PAMI 27(8), 1226–1238 (2005)
Teyssier, M., Koller, D.: Ordering-Based Search: A Simple and Effective Algorithm for Learning Bayesian Networks. In: UAI 2005, pp. 584–590. Morgan Kaufmann, San Francisco (2005)
Moore, D.S.: Goodness-of-Fit Techniques. Marcel Dekker, New York (1986)
Steck, H.: On the Use of Skeletons when Learning in Bayesian Networks. In: UAI 2000, pp. 558–565. Morgan Kaufmann, San Francisco (2000)
Moore, A.W., Wong, W.K.: Optimal Reinsertion: A New Search Operator for Accelerated and More Accurate Bayesian Network Structure Learning. In: ICML 2003, pp. 552–559. AAAI Press, Stanford (2003)
Friedman, N., Nachman, I., Peter, D.: Learning Bayesian Network Structure from Massive Datasets: The Sparse Candidate algorithm. In: UAI 1999, pp. 196–205. Morgan Kaufmann, San Francisco (1999)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Liu, F., Tian, F., Zhu, Q. (2007). A Novel Ordering-Based Greedy Bayesian Network Learning Algorithm on Limited Data. In: Orgun, M.A., Thornton, J. (eds) AI 2007: Advances in Artificial Intelligence. AI 2007. Lecture Notes in Computer Science(), vol 4830. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-76928-6_10
Download citation
DOI: https://doi.org/10.1007/978-3-540-76928-6_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-76926-2
Online ISBN: 978-3-540-76928-6
eBook Packages: Computer ScienceComputer Science (R0)