Skip to main content

Induction of Linear Decision Trees with Real-Coded Genetic Algorithms and k-D Trees

  • Conference paper
Intelligent Data Engineering and Automated Learning - IDEAL 2005 (IDEAL 2005)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 3578))

  • 1315 Accesses

Abstract

Although genetic algorithm-based decision tree algorithms are applied successfully in various classification tasks, their execution times are quite long on large datasets. A novel decision tree algorithm, called Real-Coded Genetic Algorithm-based Linear Decision Tree Algorithm with k-D Trees (RCGA-based LDT with kDT), is proposed. In the proposed algorithm, a k-D tree is built when a new node of a linear decision tree is created. The use of k-D trees speeds up the construction of linear decision trees without sacrificing the quality of the constructed decision trees.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight 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. Bentley, J.L.: Multidimensional Binary Search Trees Used for Associative Searching. Communications of the ACM 18(9), 509–517 (1975)

    Article  MATH  MathSciNet  Google Scholar 

  2. Breiman, L., Friedman, J.H., Olshen, R.A., Stone, C.J.: Classification and Regression Trees. Wadsworth International Group, Belmont (1984)

    MATH  Google Scholar 

  3. Brodley, C.E., Utgoff, P.E.: Multivariate Decision Trees. UM-CS-1992-083 (1992)

    Google Scholar 

  4. Cantú-Paz, E., Kamath, C.: Inducing Oblique Decision Trees with Evolutionary Algorithms. IEEE Transactions on Evolutionary Computation 7(1), 54–68 (2003)

    Article  Google Scholar 

  5. Chai, B.B., Huang, T., Zhuang, X., Zhao, Y., Sklansky, J.: Piecewise Linear Classifiers using Binary Tree Structure and Genetic Algorithm. Pattern Recognition 29(11), 1905–1917 (1996)

    Article  Google Scholar 

  6. Gama, J.: Oblique Linear Tree. In: Liu, X., Cohen, P.R., Berthold, M.R. (eds.) IDA 1997. LNCS, vol. 1280, pp. 187–198. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  7. Heath, D., Kasif, S., Salzberg, S.: Induction of Oblique Decision Trees. In: Proceedings of the 13th International Joint Conference on Artificial Intelligence, pp. 1002–1007 (1993)

    Google Scholar 

  8. Herrera, F., Lozano, M., Verdegay, J.L.: Tackling Real-Coded Genetic Algorithms: Operators and Tools for Behavioural Analysis. Artificial Intelligence Review 12(4), 265–319 (1998)

    Article  MATH  Google Scholar 

  9. Holland, J.H.: Adaption in Natural and Artificial Systems. MIT Press, Cambridge (1975)

    MATH  Google Scholar 

  10. Michalewicz, Z.: Genetic Algorithms + Data Structures = Evolution Programs. Springer, New York (1996)

    MATH  Google Scholar 

  11. Murthy, S.K., Kasif, S., Salzberg, S.: A System for Induction of Oblique Decision Trees. Journal of Artificial Intelligence Research 2, 1–32 (1994)

    MATH  Google Scholar 

  12. Quinlan, J.R.: C4.5: Programs for Machine Learning. Morgan Kaufmann, San Francisco (1993)

    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 Berlin Heidelberg

About this paper

Cite this paper

Ng, Sc., Leung, Ks. (2005). Induction of Linear Decision Trees with Real-Coded Genetic Algorithms and k-D Trees. In: Gallagher, M., Hogan, J.P., Maire, F. (eds) Intelligent Data Engineering and Automated Learning - IDEAL 2005. IDEAL 2005. Lecture Notes in Computer Science, vol 3578. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11508069_35

Download citation

  • DOI: https://doi.org/10.1007/11508069_35

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-26972-4

  • Online ISBN: 978-3-540-31693-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics