Distance Guided Classification with Gene Expression Programming

  • Lei Duan
  • Changjie Tang
  • Tianqing Zhang
  • Dagang Wei
  • Huan Zhang
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4093)

Abstract

Gene Expression Programming (GEP) aims at discovering essential rules hidden in observed data and expressing them mathematically. GEP has been proved to be a powerful tool for constructing efficient classifiers. Traditional GEP-classifiers ignore the distribution of samples, and hence decrease the efficiency and accuracy. The contributions of this paper include: (1) proposing two strategies of generating classification threshold dynamically, (2) designing a new approach called Distance Guided Evolution Algorithm (DGEA) to improve the efficiency of GEP, and (3) demonstrating the effectiveness of generating classification threshold dynamically and DGEA by extensive experiments. The results show that the new methods decrease the number of evolutional generations by 83% to 90%, and increase the accuracy by 20% compared with the traditional approach.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Han, J., Kambr, M.: Data Mining Concepts and Techniques, pp. 185–235. Higher Education Press, Beijing (2001)Google Scholar
  2. 2.
    Ross Quinlan, J.: C4.5: Programs for Machine Learning. Morgan Kaufmann, San Francisco (1993)Google Scholar
  3. 3.
    Zhou, C., Nelson, P.C., Xiao, W., Tirpak, T.M.: Discovery of Classification Rules by Using Gene Expression Programming. In: Proceedings of the International Conference on Artificial Intelligence, Las Vegas, USA, pp. 1355–1361 (2002)Google Scholar
  4. 4.
    Ferreira, C.: Gene Expression Programming: A New Adaptive Algorithm for Solving Problems. Complex Systems 13(2), 87–129 (2001)MATHMathSciNetGoogle Scholar
  5. 5.
    Goldberg, D.E.: Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Reading (1989)MATHGoogle Scholar
  6. 6.
    Koza, J.R.: Genetic Programming. MIT Press, Cambridge, MA (1992)MATHGoogle Scholar
  7. 7.
    Ferreira, C.: Gene Expression Programming: Mathematical Modeling by an Artificial Intelligence, Angra do Heroismo, Portugal (2002)Google Scholar
  8. 8.
    Ferreira, C.: Discovery of the Boolean Functions to the Best Density-Classification Rules Using Gene Expression Programming. In: Foster, J.A., Lutton, E., Miller, J., Ryan, C., Tettamanzi, A.G.B. (eds.) EuroGP 2002. LNCS, vol. 2278, pp. 51–60. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  9. 9.
    Ferreira, C.: Mutation, Transposition, and recombination: An analysis of the evolutionary Dynamics. In: Proceedings of the 4th International Workshop on Frontiers in Evolutionary Algorithms, Research Triangle Park, North Carolina, USA, pp. 614–617 (2002)Google Scholar
  10. 10.
    Zhou, C., Xiao, W., Tirpak, T.M., Nelson, P.C.: Evolution Accurate and Compact Classification Rules With Gene Expression Programming. IEEE Transactions on Evolutionary Computation 7(6), 519–531 (2003)CrossRefGoogle Scholar
  11. 11.
    Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, pp. 184–189. Higher Education Press, Beijing (2002)Google Scholar
  12. 12.
    Witten, I.H., Frank, E.: Data Mining: Practical machine learning tools and techniques, 2nd edn. Morgan Kaufmann, San Francisco (2005)Google Scholar
  13. 13.
    Blake, C.L., Merz, C.J.: UCI repository of machine learning databases (2000)Google Scholar
  14. 14.

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Lei Duan
    • 1
  • Changjie Tang
    • 1
  • Tianqing Zhang
    • 1
  • Dagang Wei
    • 1
  • Huan Zhang
    • 1
  1. 1.School of Computer ScienceSichuan UniversityChengduChina

Personalised recommendations