×

zbMATH — the first resource for mathematics

A self-adaptive migration model genetic algorithm for data mining applications. (English) Zbl 1119.68389
Summary: Data mining involves nontrivial process of extracting knowledge or patterns from large databases. Genetic algorithms are efficient and robust searching and optimization methods that are used in data mining. In this paper we propose a self-adaptive migration model GA, where parameters of population size, the number of points of crossover and mutation rate for each population are adaptively fixed. Further, the migration of individuals between populations is decided dynamically. This paper gives a mathematical schema analysis of the method stating and showing that the algorithm exploits previously discovered knowledge for a more focused and concentrated search of heuristically high yielding regions while simultaneously performing a highly explorative search on the other regions of the search space. The effective performance of the algorithm is then shown using standard testbed functions and a set of actual classification datamining problems. Michigan style of classifier was used to build the classifier and the system was tested with machine learning databases of Pima Indian Diabetes database, Wisconsin Breast Cancer database and few others. The performance of our algorithm is better than others.

MSC:
68T05 Learning and adaptive systems in artificial intelligence
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Ghosh, Ashish; Nath, Bhabesh, Multi-objective rule mining using genetic algorithms, Information sciences, 163, 1-3, 123-133, (2000)
[2] Athreya, K.B.; Doss, H.; Sethuraman, J., On the convergence of the Markov chain simulation method, Annals of statistics, 24, 69-100, (1996) · Zbl 0860.60057
[3] T. Back, Self adaptation in genetic algorithms, in: F.J. Varela, P.B. (Eds.), Proceedings of First European Conference on Artificial Life, 1992, pp. 263-271.
[4] De Jong, K.A.; Spears, W.M.; Gordon, D.F., Using genetic algorithms for concept learning, Machine learning, 13, 161-188, (1993)
[5] K.A. De Jong, An analysis of the behaviour of a class of genetic adaptive systems. Ph.D. thesis, Department of Computer and Communication Sciences, University of Michigan, Ann Arbor, 1975.
[6] Deb, K.; Beyer, H.G., Self adaptive genetic algorithms with simulated binary crossover, Evolutionary computation, 9, 2, 197-221, (2001)
[7] Deepa Shenoy, P.; Srinivasa, K.G.; Venugopal, K.R.; Patnaik, Lalit M., Evolutionary approach for mining association rules on dynamic databases, (), 325-336 · Zbl 1032.68631
[8] Eiben, A.E.; Aarts, E.H.L.; Van Hee, K.M., Global convergence of genetic algorithm: a Markov chain analysis, (), 4-12
[9] Eiben, A.E.; Sprinkhuizen-Kuyper, I.G.; Thijseen, B.A., Competing crossovers in an adaptive GA framework, (), 787-792
[10] Herrera, F.; Lozano, M., Gradual distributed real-coded genetic algorithms, IEEE transactions on evolutionary computation, 4, 1, 43-62, (2000)
[11] Lobo, Fernando G.; Goldberg, David E., The parameter-less genetic algorithm in practice, Information sciences, 167, 1-4, 217-232, (2000) · Zbl 1080.68630
[12] He, J.; Kang, L.; Chen, Y., Convergence of genetic evolution algorithms for optimization, Parallel algorithms and applications, 5, 37-56, (1995) · Zbl 1049.68901
[13] F. Herrera, M. Lozano, Adaptive genetic algorithms based on fuzzy techniques, in: Proc. of Sixth Intl. Conf. on Information Processing and Management of Uncertainty in Knowledge Based Systems (IPMU’ 96), Granada, July 1996, pp. 775-780.
[14] R. Hinterding, Z. Michalewicz, T.C. Peachey, Self adaptive genetic algorithm for numeric functions, in: Proceedings of the 4th Conference on Parallel Problem Solving from Nature, 1996, pp. 420-429.
[15] Holland, J.H., Adaptation in natural and artificial systems, (1975), University of Michigan Press Arbor
[16] Holland, J.H., Escaping brittleness: the possibilities of general-purpose learning algorithms applied to parallel rule-based systems, (), 593-623
[17] Jacinto Mata Vzquez, Jos Luis lvarez Macas, Jos Cristbal Riquelme Santos, Discovering Numeric association rules via evolutionary algorithm, PAKDD, 2002, pp. 40-51. · Zbl 1048.68829
[18] Joanna Lis, Parallel genetic algorithm with the dynamic control parameter, in: International Conference on Evolutionary Computation, 1996, pp. 324-329.
[19] Penev, Kalin; Littlefair, Guy, Free search comparative analysis, Information sciences, 172, 1-2, 173-193, (2005)
[20] E. Kee, S. Aiery, W. Cye, An adaptive genetic algorithm, in: Proceedings of The Genetic and Evolutionary Computation Conference, 2001, pp. 391-397.
[21] T. Krink, R.K. Ursem, Parameter control using the agent based patchwork model, in: Proceedings of The Congress on Evolutionary Computation, 2000, pp. 77-83.
[22] J.H. Lobo, The parameter-less genetic algorithm: rational and automated parameter selection for simple genetic algorithm operation, Ph.D. thesis, University of Lisbon, Portugal, 2000.
[23] Martin, J.H.; Lienig, J.; Cohoon, J.H., Population structures: island (migration) models: evolutionary algorithms based on punctuated equilibria, (), C6.3:1-C6.3:16
[24] Nix, A.; Vose, M.D., Modeling genetic algorithms with Markov chains, Annals of mathematics and artificial intelligence, 5, 79-88, (1992) · Zbl 1034.68534
[25] Montiel, Oscar; Castillo, Oscar; Seplveda, Roberto; Melin, Patricia, Application of a breeder genetic algorithmnext term for finite impulse filter optimization, Information sciences, 161, 3-4, 139-158, (2004)
[26] Peter W. Eklund, A performance survey of public domain supervised machine learning algorithms, Technical Report, The University of Queensland Australia, 2002.
[27] Rudolph, G., Convergence analysis of canonical genetic algorithms, IEEE transactions on neural networks, 5, 96-101, (1995)
[28] Schierkamp Voosen, D.; Muhlenbein, H., Strategy adaptation by competing subpopulations, Parallel problem solving from nature III, (1994), Springer-Verlag Berlin, Germany, pp. 199-208
[29] V. Schnecke, O. Vornberger, An adaptive parallel genetic algorithm for VLSI layout optimization, in: Proc. of fourth Intl. Conf. on Parallel Problem Solving from Nature, 1996, pp. 859-868.
[30] Srinivas, M.; Patnaik, L.M., Binomially distributed populations for modelling gas, (), 138-143
[31] Srinivas, M.; Patnaik, L.M., Adaptive probabilities of crossover and mutation in genetic algorithms, IEEE transactions on systems, man and cybernetics, 24, 4, 17-26, (1994)
[32] Louis, Sushil J.; Rawlins, Gregory J.E., Syntactic analysis of convergence in genetic algorithms, Foundations of genetic algorithms, 141-152, (2002)
[33] Tongchim, S.; Chongstitvatan, P., Parallel genetic algorithm with parameter adaptation, Information processing letters, 82, 1, 47-54, (2002) · Zbl 1013.68293
[34] Vose, M.D.; Liepins, G.E., Punctuated equilibria in genetic search, Complex systems, 5, 1, 31-44, (1991) · Zbl 0764.68149
[35] William M. Spear, Kenneth De Jong, An analysis of multipoint crossover, Foundations of Genetic Algorithms Workshop, Bloomington, 1991, pp. 301-315.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.