Abstract
For a given data set, its set of attributes defines its data space representation. The quality of a data space representation is one of the most important factors influencing the performance of a data mining algorithm. The attributes defining the data space can be inadequate, making it difficult to discover high-quality knowledge. In order to solve this problem, this paper proposes a Genetic Programming algorithm developed for attribute construction. This algorithm constructs new attributes out of the original attributes of the data set, performing an important preprocessing step for the subsequent application of a data mining algorithm.
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
Banzhaf, W.; Nordin, P.; Keller, R. E.; Francone, F. D. Genetic Programming ~ an Introduction: On the Automatic Evolution of Computer Programs and Its Applications. Morgan Kaufmann, 1998.
Dhar, V.; Chou, D. and Provost, F. Discovering Interesting Patterns for Investment Decision Making with GLOWER-A Genetic Learner Overlaid With Entropy Reduction. Data Mining and Knowledge Discovery 4(4), 251–280. Oct. 2000.
Fayyad, U. M.; Piatetsky-Shapiro, G; Smith, P.; Uthurusamy, R. (Eds) Advances in Knowledge Discovery and Data Mining, 1–34. AAAI/MIT Press, 1996.
Freitas, A. A. Understanding the crucial role of attribute interaction in data mining. Artificial Intelligence Review 16(3), Nov. 2001, pp. 177–199.
C. Gathercole and P. Ross. An adverse interaction between crossover and restricted tree depth in genetic programming. Genetic Programming 1996: Proc. 1st Annual Conf., 291–296. MIT Press, 1996.
Hu, Y-J. A Genetic Programming Approach to Constructive Induction. In Proceeding of 3rd Anual Genetic Programming Conference, pp. 146–151, 1998.
Hu, Y-J. Constructive Induction: Covering Attribute Spectrum. In: H. Liu & H. Motoda (Eds) Feature Extraction Construction and Selection, pp. 257–272. Kluwer, 1998.
Hu, Y-J & Kibler, D. Generation of Attributes for Learning Algorithms. In Proceeding of the 13th National Conference on Artificial Intelligence, pp. 806–811, 1996
Koza, J. Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, 1992.
W. B. Langdon. Quadratic bloat in genetic programming. Proc. 2000 Genetic and Evolutionary omputation Conf. (GECCO-2000), 451–458. Morgan Kaufmann, 2000.
Langdon, W. B. & Poli, R. An analysis of the MAX problem in genetic programming. Genetic Programming 1997: Proc. 2nd Annual Conf., 222–230. Morgan Kaufmann, 1997.
Langdon, W. B.; Soule, T.; Poli, R. and Foster, J. A.. The evolution of size and shape. In: L. Spector, W. B. Langdon, U-M. O’Reilly and P. J. Angeline. (Eds.) Advances in Genetic Programming Volume 3, 163–190. MIT Press, 1999.
Pagallo, G. & Haussler, D. Boolean Feature Discovery in Empirical Learning. In Machine Learning 5, pp. 71–99. 1990.
Quinlan, J. R. C4.5: Programs for Machine Learning. Morgan Kaufmann, 1993.
Zheng, Z. Constructing X-of-N attributes for decision tree learning. Machine Learning 40 (2000), 1–43.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Otero, F.E.B., Silva, M.M.S., Freitas, A.A., Nievola, J.C. (2003). Genetic Programming for Attribute Construction in Data Mining. In: Ryan, C., Soule, T., Keijzer, M., Tsang, E., Poli, R., Costa, E. (eds) Genetic Programming. EuroGP 2003. Lecture Notes in Computer Science, vol 2610. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36599-0_36
Download citation
DOI: https://doi.org/10.1007/3-540-36599-0_36
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00971-9
Online ISBN: 978-3-540-36599-0
eBook Packages: Springer Book Archive