Generating Effective Classifiers with Supervised Learning of Genetic Programming
A new approach of learning classifiers using genetic programming has been developed recently. Most of the previous researches generate classification rules to classify data. However, the generation of rules is time consuming and the recognition accuracy is limited. In this paper, an approach of learning classification functions by genetic programming is proposed for classification. Since a classification function deals with numerical attributes only, the proposed scheme first transforms the nominal data into numerical values by rough membership functions. Then, the learning technique of genetic programming is used to generate classification functions. For the purpose of improving the accuracy of classification, we proposed an adaptive interval fitness function. Combining the learned classification functions with training samples, an effective classification method is presented. Numbers of data sets selected from UCI Machine Learning repository are used to show the effectiveness of the proposed method and compare with other classifiers.
KeywordsGenetic Programming Classification Function Association Rule Mining Positive Instance Nominal Attribute
Unable to display preview. Download preview PDF.
- 1.Blake, C., Keogh, E., Merz, C.J.: UCI repository of machine learning database, Irvine, University of California, Department of Information and Computer Science (1998), http://www.ics.uci.edu/~mlearn/MLRepository.html
- 4.Freitas, A.A.: A Genetic Programming Framework for Two Data Mining Tasks: Classification and Generalized Rule Induction. In: Proc. the 2nd Annual Conf. Genetic Programming, pp. 96–101. Morgan Kaufmann Publishers, Stanford University (1997)Google Scholar
- 7.Kohavi, R.: Scaling Up the Accuracy of Naïve-Bayes Classifiers: a Decision-Tree Hybrid. Proc. Int. Conf. Knowledge Discovery & Data Mining. pp.202-207. AAAI Press/MIT Press Publishers, Cambridge/Menlo Park (1996)Google Scholar
- 9.Koza, J.R.: Introductory Genetic Programming Tutorial. In: Proc. the First Annual Conf. Genetic Programming. MIT Press Publishers, Stanford University (1996)Google Scholar
- 10.Liu, B., Hsu, W., Ma, Y.: Integrating Classification and Association Rule Mining. In: Proc. the Fourth Int. Conf. Knowledge Discovery and Data Mining, pp. 443–447. AAAI Press Publishers, Menlo Park (1998)Google Scholar
- 11.Loveard, T., Ciesielski, V.: Representing Classification Problems in Genetic Programming. In: Proc. the Congress on Evolutionary Computation, COEX Center, Seoul, Korea, pp. 1070–1077 (2001)Google Scholar
- 13.Pawlak, Z., Skowron, A.: Rough Membership Functions. In: Yager, R.R., Fedrizzi, M., Kacprzyk, J. (eds.) Advances in the Dempster-Shafer Theory of Evidence, pp. 251–271 (1994)Google Scholar
- 14.Quinlan, J.R.: C4.5: Programs for Machine Learning. Morgan Kaufmann Publishers, San Mateo (1993)Google Scholar
- 15.Singleton, A.: Genetic Programming with C++ Byte, pp. 171–176 (February 1994), http://www.byte.com/art/9402/sec10/art1.htm
- 16.Xie, Z., Hsu, W., Liu, Z., Lee, M.L.: SNNB: A Selective Neighborhood Based Naïve Bayes for Lazy Learning. In: Proc. the sixth Pacific-Asia Conf. on Advances in Knowledge Discovery and Data Mining, pp. 104–114 (2002)Google Scholar