Representing the behaviour of supervised classification learning algorithms by Bayesian networks

Pattern Recognition Letters

Volumn 20, Issue 11-13, 1999, Pages 1201-1209

  Inza, I ^a   Larranaga P ^a   Sierra, B ^a   Etxeberria, R ^a   Lozano, J A ^a   Pena J M ^a  

^a UNIVERSITY OF THE BASQUE COUNTRY UPV EHU   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY; LEARNING ALGORITHMS; MATHEMATICAL MODELS; STATISTICAL METHODS;

BAYESIAN NETWORKS; STRUCTURE LEARNING; SUPERVISED CLASSIFICATION LEARNING;

PATTERN RECOGNITION;

EID: 0342902635     PISSN: 01678655     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-8655(99)00095-1     Document Type: Article

References (34)

1. Aha, D., Kibler, D., Albert, M.K., 1991. Instance-based learning algorithms. Machine Learning 6, 37-66.
2. Andersen, S.K., Olesen, K.G., Jensen, F.V., Jensen, F., 1989. HUGIN - a shell for building Bayesian belief universes for expert systems. In: 11th International Joint Conference on Artificial Intelligence, pp. 1128-1133.
3. Auer, P., Holte, R., Maass, W., 1995. Theory and applications of agnostic PAC-learning with small decision trees. In: Prieditis, A., Russell, S. (Eds.), Machine Learning: Proceedings of the 12th International Conference, Morgan Kaufmann, Los Altos, CA.
4. Bouckaert, R.R., 1995. Bayesian belief networks: from construction to inference. Ph.D Thesis, Department of Computer Science, Utrecht University, The Netherlands.
5. Cestnik, B., 1990. Estimating probabilities: a crucial task in machine learning. In: Proceedings of the European Conference on Artificial Intelligence, pp. 147-149.
6. Clark, P., 1998. Personal communication.
7. Clark, P., Nibblet, T., 1989. The CN2 induction algorithm. Machine Learning 3 (4), 261-283.
8. Cohen, W.W., 1995. Fast effective rule induction. In: Machine Learning, Proceedings of the 12th International Conference.
9. Cooper, G.F., Herskovits, E.A., 1992. A Bayesian method for the induction of probabilistic networks from data. Machine Learning 9, 309-347.
10. Cost, S., Salzberg, S., 1993. A weighted nearest neighbor algorithm for learning with symbolic features. Machine Learning 10 (1), 57-78.
11. Dawid, A.P., 1979. Conditional independence in statistical theory. Journal of the Royal Statistics Society Series B 41, 1-31.
12. Duda, R., Hart, P., 1973. Pattern Classification and Scene Analysis. Wiley, New York.
13. Etxeberria, R., Larrañaga, P., Picaza, J.M., 1997. Analysis of the behaviour of genetic algorithms when learning Bayesian networks structure from data. Pattern Recognition Letters 18 (11-13), 1269-1273.
14. Heckerman, D., 1995. A tutorial on learning with Bayesian networks. Technical Report, MSR-TR-95-06.
15. Heckerman, D., Geiger, D., Chickering, D.M., 1995. Learning Bayesian networks: the combination of knowledge and statistical data. Machine Learning 20, 197-243.
16. Herskovits, E., Cooper, G., 1990. Kutató - An entropy-driven system for construction of probabilistic expert systems from databases. Report KSL-90-22, Knowledge Systems Laboratory, Medical Computer Science, Stanford University.
17. Holte, R.C., 1993. Very simple classification rules perform well on most commonly used databases. Machine Learning 11, 63-90.
18. Kohavi, R., 1995a. Wrappers for performance enhancement and oblivious decision graphs. Ph.D. Thesis, Standford University, Computer Science Department, STAN-CS-TR-95-1560.
19. Kohavi, R., 1995b. The power of decision tables. In: Lavrac, N., Wrobel, S. (Eds.), Proceedings of the European Conference on Machine Learning. Lecture Notes in Artificial Intelligence, Vol. 914. Springer, Berlin, pp. 174-189.
20. Kohavi, R., 1996. Scaling up the accuracy of Naive-Bayes classifiers: a decision-tree hybrid. In: Proceedings of the Second International Conference on Knowledge Discovery and Data Mining.
21. Kohavi, R., Sommerfield, D., Dougherty, J., 1997. Data mining using MLC++, a Machine Learning Library in C++. International Journal of Artificial Intelligence Tools 6 (4), 537-566.
22. Kreiner, S., 1989. Graphical modelling using DIGRAM. Research Report 89/11. Statistical Research Unit. University of Copenhagen.
23. Lam, W., Bacchus, F., 1994. Learning Bayesian belief networks. An approach based on the MDL Principle. Computational Intelligence 10 (4).
24. Larrañaga, P., Poza, M., Yurramendi, Y., Murga, R.H., Kuijpers, C.M.H., 1996. Structure learning of Bayesian networks by genetic algorithms: A performance analysis of control parameters. IEEE Transactions on Pattern Analysis and Machine Intelligence 18 (9), 912-926.
25. Lauritzen, S.L., Dawid, A.P., Larsen, B.N., Leimer, H.G., 1990. Independence Properties of Directed Markov Fields. Networks 20, 491-505.
26. Lauritzen, S.L., 1996. Graphical Models. Oxford University Press, Oxford.
27. Mitchell, T.M., 1997. Machine Learning. McGraw-Hill, New York.
28. Murphy, P.M., Aha, D.W., 1994. UCI Repository of Machine Learning databases. http://www.ics.uci.edu/mlearn/MLRepository.html. Irvine, CA. University of California, Department of Information and Computer Science.
29. Murthy, S.K., Salzberg, S., 1994. A system for the induction of oblique decision trees. Journal of Artificial Intelligence Research 2, 1-33.
30. Pearl, J., 1988. Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann, Los Altos, CA.
31. Quinlan, J.R., 1986. Induction of decision trees. Machine Learning 1, 81-106.
32. Quinlan, J.R., 1989. Inferring decision trees using the minimum description length principle. Information and Computation 80, 227-248.
33. Quinlan, J.R., 1993. C4.5: Programs for Machine Learning. Morgan Kaufmann, Los Altos, CA.
34. Robinson, R.W., 1977. Counting unlabeled acyclic digraphs. In: Little, C.H.C. (Ed.), Lectures Notes in Mathematics 622: Combinatorial Mathematics V, Springer, New York, pp. 28-43.