A Growing Evolutionary Algorithm and Its Application for Data Mining

Full Text (PDF, 495KB), PP.8-16

Views: 0 Downloads: 0


Ning Hou 1,* Zhanmin Wang 2

1. Changqing Oilfield Company, Xi’an, China

2. Xi’an University of Technology, Xi’an, China

* Corresponding author.

DOI: https://doi.org/10.5815/ijisa.2011.04.02

Received: 13 Aug. 2010 / Revised: 4 Dec. 2010 / Accepted: 26 Feb. 2011 / Published: 8 Jun. 2011

Index Terms

Association rule, evolutionary algorithm, representation


An unsuitable representation will make the task of mining classification rules very hard for a traditional evolutionary algorithm (EA). But for a given dataset, it is difficult to decide which one is the best representation used in the mining progress. In this paper, we analyses the effects of different representations for a traditional EA and proposed a growing evolutionary algorithm which was robust for mining classification rules in different datasets. Experiments showed that the proposed algorithm is effective in dealing with problems of deception, linkage, epistasis and multimodality in the mining task.

Cite This Paper

Ning Hou, Zhanmin Wang, "A Growing Evolutionary Algorithm and Its Application for Data Mining", International Journal of Intelligent Systems and Applications(IJISA), vol.3, no.4, pp.8-16, 2011. DOI:10.5815/ijisa.2011.04.02


[1]J. H. Holland, “Adaptation in natural and artificial systems”, Ann Arbor: University of Michigan Press,1975

[2]J. H. Holland, “Adaptation progress in theoretical biology”, New York:Academic,vol.4,pp.263–293,1976

[3]D. E. Goldberg, “ Genetic Algorithms in Search”, Optimization & Machine Learning. 1st ed. New York: Addison-Wesley, 1989

[4]Albert Orriols-Puig, Jorge Casillas et al., “Fuzzy-UCS: a Michigan-style learning fuzzy-classifier system for supervised learning”. IEEE transactions on evolutionary computation. 13(2),2009.

[5]D.E.Goldberg.Simple genetic algorithms and the minimal deceptive problem.In L.D.Davis,editor,Genetic Algorithms and Simulated Annealing,Research Notes in Artificial Intelligence,Los Altos,CA,1987.Morgan Kaufmann.

[6]D.E.Goldberg.Genetic algorithms and Walsh functions:Part II,Deception and its analysis.Complex Systems,3:153–171,1989.

[7]D.E.Goldberg and M.Rudnick.Schema variance from Walsh-schema transform.Complex Systems,5:265–278,1991

[8]D.E.Goldberg.Construction of high-order deceptive functions using low-order Walsh coe?cients.Technical Report 90002,Illinois Genetic Algorithms Laboratory, Dept.of General Engineering,University of Illinois,Urbana,IL,1990.

[9]A. D. Bethke, “Genetic algorithms as funtion optimizers”, Ph.D. thesis, University of Michigan, Ann Arbor, MI.

[10]D.E.Goldberg, B.Korb, and K.Deb, "Messy genetic algorithms: motivation, analysis, and first results, complex systems, Vol3, pp.493-530, 1989.

[11]D.E.Goldberg, K.Deb,and D.Thierens, "Toward a better understanding of mixing in genetic algorithm," Journal of the society of Control engineers, Vol.32, No.1, pp.10-16, 1993.

[12]G. Harik, "Learning linkage to efficiently solve problems of bounded difficulty using genetic algorithms," Doctoral dissertation, university of Illinois at Urbana-Champaign, 1997.

[13]R. Das, L. D. Whitley, “The only challenging problems are deceptive: global search by solving order-1 hyperplanes.”, Proceedings of the Fourth International Conference on Genetic Algorithms. San Mateo, CA: Morgan Kaufmann, 1991.

[14]J. J. Grefenstette, “Deception considered harmful”, Pages 75-91 of: Whitley, L. D., Foundations of genetic algorithms, vol.2. San Mateo, CA: Morgan Kaufmann.1993

[15]T. C. Jones, “Evolutionary Algorithms, fitness landscapes and search.”, Ph.D. thesis, University of New Mexico, Albuquerque, NM.1995.

[16]R. Agrawal, T. Imielinski and A. Swami. “Mining association rules between sets of items in large databases”. In Proc. of the ACM SIGMOD Conference on Management of Data, Washington, D.C, May 1993.

[17]D. J. Newman, S. Hettich, C. Blake, and C. Merz, UCI Repository of Machine Learning Databases. Berleley, CA: Dept. Information Comput. Sci., University of California,1998.