Skip to main content

Learning Decision Rules by Means of Hybrid-Encoded Evolutionary Algorithms

  • Chapter
Information Processing with Evolutionary Algorithms

Part of the book series: Advanced Information and Knowledge Processing ((AI&KP))

  • 546 Accesses

Summary

This paper describes an approach based on evolutionary algorithms, HIDER (HIerarchical DEcision Rules), for learning rules in continuous and discrete domains. The algorithm produces a hierarchical set of rules, that is, the rules are sequentially obtained and must be therefore tried in order until one is found whose conditions are satisfied. In addition, the algorithm tries to obtain more understandable rules by minimizing the number of attributes involved. The evolutionary algorithm uses binary coding for discrete attributes and integer coding for continuous attributes. The integer coding consists in defining indexes to the values that have greater probability of being used as boundaries in the conditions of the rules. Thus, the individuals handles these indexes instead of the real values. We have tested our system on real data from the UCI Repository, and the results of a 10-fold cross-validation are compared to C4.5s and C4.5Rules. The experiments show that HIDER works well in practice.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References.

  1. J. S. Aguilar, J. C. Riquelme, and M. Toro (1998) Decision queue classifier for supervised learning using rotated hyperboxes. In Progress in Artificial Intelligence IBERAMIA’98. Lecture Notes in Artificial Intelligence 1484. Springer-Verlag, pages 326–336.

    Google Scholar 

  2. J. S. Aguilar, J. C. Riquelme, and M. Toro (1998) A tool to obtain a hierarchical qualitative set of rules from quantitative data. In Lecture Notes in Artificial Intelligence 1415. Springer-Verlag, pages 336–346.

    Google Scholar 

  3. J. Antonisse (1989) A new interpretation of schema notation that overturns the binary encoding constraint. In Third International Conference on Genetic Algorithms, pages 86–97. Morgan Kaufmann.

    Google Scholar 

  4. S. Bhattacharyya and G.J. Koehler (1994) An analysis of non-b inary genetic algorithms with cardinality 2v. Complex Systeme, 8:227–256.

    MathSciNet  Google Scholar 

  5. C. Blake and E. K. Merz (1998) UCI repository of machine learning databases, 1998.

    Google Scholar 

  6. P. Clark and R. Boswell (1991) Rule induction with cn2: Some recents improvements. In Machine Learning: Proceedings of the Fifth European Conference (EWSL-91), pages 151–163.

    Google Scholar 

  7. K. A. DeJong, W. M. Spears, and D. F. Gordon (1993) Using genetic algorithms for concept learning. Machine Learning, 1(13):161–188.

    Google Scholar 

  8. L. J. Eshelman and J. D. Schaffer (1993) Real-coded genetic algorithms and interval-schemata. Foundations of Genetic Algorithms-2, pages 187–202.

    Google Scholar 

  9. D. E. Goldberg (1989) Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley.

    Google Scholar 

  10. R. C. Holte (1993) Very simple classification rules perform well on most commonly used datasets. Machine learning, 11:63–91.

    Article  MATH  ISI  Google Scholar 

  11. C. Z. Janikow (1993) A knowledge-intensive genetic algorithm for supervised learning. Machine Learning, 1(13):169–228.

    Google Scholar 

  12. G.J. Koehler, S. Bhattacharyya, and M.D. Vose (1998) General cardinality genetic algorithms. Evolutionary Computation, 5(4):439–459.

    Google Scholar 

  13. Z. Michalewicz (1996) Genetic Algorithms + Data Structures = Evolution Programs. Springer-Verlag, 3 ed..

    Google Scholar 

  14. T. Mitchell (1997) Machine Learning. McGraw Hill.

    Google Scholar 

  15. J. R. Quinlan (1996) Improved use of continuous attributes in c4.5. Journal of Artificial Intelligence Research, 4:77–90.

    MATH  ISI  Google Scholar 

  16. N. J. Radcliffe (1990) Genetic Neural Networks on MIMD Computers. Ph. d., University of Edinburgh.

    Google Scholar 

  17. R. L. Rivest (1987) Learning decision lists. Machine Learning, 1(2):229–246.

    Google Scholar 

  18. G. Syswerda (1989) Uniform crossover in genetic algorithms. In Proceedings of the Third International Conference on Genetic Algorithms, pages 2–9.

    Google Scholar 

  19. G. Venturini (1993) Sia: a supervised inductive algorithm with genetic search for learning attributes based concepts. In Proceedings of European Conference on Machine Learning, pages 281–296.

    Google Scholar 

  20. M.D. Vose and A.H. Wright (1998) The simple genetic algorithm and the walsh transform: Part i, theory. Evolutionary Computation, 6(3):253–273.

    Google Scholar 

  21. M.D. Vose and A.H. Wright (1998) The simple genetic algorithm an d the walsh transform: Part ii, the inverse. Evolutionary Computation, 6(3):275–289.

    Google Scholar 

  22. D. Whitley (1993) A genetic algorithm tutorial. Technical Report CS-93-103, Colorado State University, Fort Collins, CO 80523.

    Google Scholar 

  23. D. R. Wilson and T. R. Martinez (1997) Improved heterogeneous distance functions. Journal of Artificial Intelligence Research, 6(1):1–34.

    ISI  MathSciNet  Google Scholar 

  24. A. H. Wright (1991) Genetic algorithms for real parameter optimization. Foundations of Genetic Algorithms-1, pages 205–218.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag London Limited

About this chapter

Cite this chapter

Riquelme, J., Aguilar-Ruiz, J. (2005). Learning Decision Rules by Means of Hybrid-Encoded Evolutionary Algorithms. In: Wu, X., Jain, L., Graña, M., Duro, R.J., d’Anjou, A., Wang, P.P. (eds) Information Processing with Evolutionary Algorithms. Advanced Information and Knowledge Processing. Springer, London. https://doi.org/10.1007/1-84628-117-2_12

Download citation

  • DOI: https://doi.org/10.1007/1-84628-117-2_12

  • Publisher Name: Springer, London

  • Print ISBN: 978-1-85233-866-4

  • Online ISBN: 978-1-84628-117-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics