Abstract
We introduce a Bayesian network classifier less restrictive than Naive Bayes (NB) and Tree Augmented Naive Bayes (TAN) classifiers. Considering that learning an unrestricted network is unfeasible the proposed classifier is confined to be consistent with the breadth-first search order of an optimal TAN. We propose an efficient algorithm to learn such classifiers for any score that decompose over the network structure, including the well known scores based on information theory and Bayesian scoring functions. We show that the induced classifier always scores better than or the same as the NB and TAN classifiers. Experiments on modeling transcription factor binding sites show that, in many cases, the improved scores translate into increased classification accuracy.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Barash, Y., Elidan, G., Friedman, N., Kaplan, T.: Modeling dependencies in protein-DNA binding sites. In: Proc. RECOMB 2003, pp. 28–37 (2003)
Carvalho, A.M., Oliveira, A.L., Sagot, M.-F.: Learning Bayesian networks consistent with the optimal branching. In: Proc. ICMLA 2007 (to appear, 2007)
Chickering, D.M.: Learning Bayesian networks is NP-Complete. In: Learning from data: AI and statistics V, pp. 121–130. Springer, Heidelberg (1996)
Chow, C.K., Liu, C.N.: Approximating discrete probability distributions with dependence trees. IEEE Trans. Info. Theory 14(3), 462–467 (1968)
Cooper, G.F.: The computational complexity of probabilistic inference using Bayesian belief networks. Artif. Intell. 42(2-3), 393–405 (1990)
Cooper, G.F., Herskovits, E.: A Bayesian method for the induction of probabilistic networks from data. Machine Learning 9, 309–347 (1992)
Dagum, P., Luby, M.: Approximating probabilistic inference in Bayesian belief networks is NP-hard. Artif. Intell. 60(1), 141–153 (1993)
Dasgupta, S.: Learning polytrees. In: Proc. UAI 1999, pp. 134–141 (1999)
Domingos, P., Pazzani, M.J.: Beyond independence: Conditions for the optimality of the simple Bayesian classifier. In: Proc. ICML1996, pp. 105–112 (1996)
Domingos, P., Pazzani, M.J.: Simple Bayesian classifiers do not assume independence. In: Proc. AAAI/IAAI 1996, vol. 2, p. 1386 (1996)
Duda, R.O., Hart, P.E.: Pattern Classification and Scene Analysis. John Wiley and Sons, New York (1973)
Edmonds, J.: Optimum branchings. J. Research of the National Bureau of Standards 71B, 233–240 (1967)
Wingender, E., et al.: The TRANSFAC system on gene expression regulation. Nuc. Ac. Res. 29(1), 281–283 (2001)
Friedman, N., Geiger, D., Goldszmidt, M.: Bayesian network classifiers. Machine Learning 29(2-3), 131–163 (1997)
Friedman, N., Koller, D.: Being Bayesian about network structure: A Bayesian approach to structure discovery in Bayesian networks. Machine Learning 50(1-2), 95–125 (2003)
Grossman, D., Domingos, P.: Learning Bayesian network classifiers by maximizing conditional likelihood. In: Proc. ICML 2004, pp. 46–53. ACM Press, New York (2004)
Heckerman, D., Geiger, D., Chickering, D.M.: Learning Bayesian networks: The combination of knowledge and statistical data. Machine Learning 20(3), 197–243 (1995)
Lam, W., Bacchus, F.: Learning Bayesian belief networks: An approach based on the MDL principle. Comp. Intell. 10, 269–294 (1994)
O’Flanagan, R.A., Paillard, G., Lavery, R., Sengupta, A.M.: Non-additivity in protein-DNA binding. Bioinformatics 21(10), 2254–2263 (2005)
Sharon, E., Segal, E.: A feature-based approach to modeling protein-DNA interactions. In: Proc. RECOMB 2007. LNCS(LNBI), vol. 4453, pp. 77–91. Springer, Heidelberg (2007)
Su, J., Zhang, H.: Full Bayesian network classifiers. In: Proc. ICML 2006, pp. 897–904. ACM Press, New York (2006)
Suzuki, J.: A construction of Bayesian networks from databases based on an MDL principle. In: Proc. UAI 1993, pp. 266–273 (1993)
Teyssier, M., Koller, D.: Ordering-based search: A simple and effective algorithm for learning Bayesian networks. In: Proc. UAI 2005, pp. 584–591 (2005)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Carvalho, A.M., Oliveira, A.L., Sagot, MF. (2007). Efficient Learning of Bayesian Network Classifiers. 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_4
Download citation
DOI: https://doi.org/10.1007/978-3-540-76928-6_4
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)