Abstract
In this chapter a preliminary work on the use of Estimation of Distribution Algorithms (EDAs) for the induction of classification rules is presented. Each individual obtained by simulation of the probability distribution learnt in each EDA generation represents a disjunction of a finite number of simple rules. This problem has been modeled to allow representations with different complexities. Experimental results comparing three types of EDAs —UMDA, a dependency tree and EBNAwith two classical algorithms of rule induction —RIPPER and CN2— are shown.
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
Chow, C. and Liu, C. (1968). Approximating discrete probability distributions with dependence trees. IEEE Transactions on Information Theory, 14:462–467.
Clark, P. and Nibblet, T. (1989). The CN2 induction algorithm. Machine Learning, 3(4):261–283.
Cohen, W. (1995). Fast effective rule induction. In Proceedings of the Twelfth International Conference in Machine Learning, pages 115–123.
Dietterich, T. (1998). Approximate statistical tests for comparing supervised learning algorithms. Neural Computation, 10(7):1895–1924.
Dougherty, J., Kohavi, R., and Sahami, M. (1995). Supervised and unsupervised discretization of continuous features. In Proceedings of the Twelfth International Conference in Machine Learning, pages 194–202.
Etxeberria, R. and Larrañaga, P. (1999). Global optimization with Bayesiannetworks. In II Symposium on Artificial Intelligence. CIMAF99. Special Session on Distributions and Evolutionary Optimization, pages 332–339.
Fidelis, M., Lopes, H., and Freitas, A. (2000). Discovering comprehensible class
sification rules with a genetic algorithm. In Proceedings of the Congress on
Evolutionary Computation, pages 805–810.
Holland, J. (1986). A mathematical framework for studying learning in classifier systems. Physica D, 22.
De Jong, K. and Spears, W. (1991). Learning concept classification rules using genetic algorithms. In Proceedings of the Twelfth International Joint Conference on Artificial Intelligence, pages 651–656.
Kittler, J. (1978). Feature set search algorithms. In Chen, C., editor, Pattern
Recognition and Signal Processing, pages 41-60. Sithoff and Noordhoff. Lanzi, P., Stolzmann, W., and Wilson, S. (2000). Learning Classifier Systems.
From Foundations to Applications Springer Verlag.
Liu, J. and Kwok, J. (2000). An extended genetic rule induction algorithm. In Proceedings of the 2000 Congress on Evolutionary Computation, pages 458–463.
Müehlenbein, H. (1998). The equation for response to selection and its use for prediction. Evolutionary Computation, 5:303–346.
Murphy, P. (1995). UCI Repository of machine learning databases. University of California, Department of Information and Computer Science.
Muruzábal, J. (1999). Mining the space of generality with uncertainty-concerned, cooperative classifiers. In Proceedings of the Genetic and Evolutionary Computation Conference, pages 449–457.
Nonas, E. and Poulovassilis, A. (1998). Optimization of active rule agents using a genetic algorithm approach. In DEXA, pages 332–341.
Rivera, J. and Santana, R. (1999). Improving the discovery component of classifier systems by the application of Estimation of Distribution Algorithms. In Proceedings of the Student Sessions ACAI’99: Machine Learning and Applications, pages 43–44.
Wilson, S. (1998). Generalization in the XCS classifier system. In Proceedings of the Third Genetic Programming Conference.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer Science+Business Media New York
About this chapter
Cite this chapter
Sierra, B., Jiménez, E.A., Inza, I., Larrañaga, P., Muruzábal, J. (2002). Rule Induction by Estimation of Distribution Algorithms. In: Larrañaga, P., Lozano, J.A. (eds) Estimation of Distribution Algorithms. Genetic Algorithms and Evolutionary Computation, vol 2. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-1539-5_15
Download citation
DOI: https://doi.org/10.1007/978-1-4615-1539-5_15
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-5604-2
Online ISBN: 978-1-4615-1539-5
eBook Packages: Springer Book Archive