{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,15]],"date-time":"2025-08-15T00:30:35Z","timestamp":1755217835904,"version":"3.43.0"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2002,6,1]],"date-time":"2002-06-01T00:00:00Z","timestamp":1022889600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2002,6,1]],"date-time":"2002-06-01T00:00:00Z","timestamp":1022889600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Genet Program Evolvable Mach"],"published-print":{"date-parts":[[2002,6]]},"DOI":"10.1023\/a:1015579825262","type":"journal-article","created":{"date-parts":[[2002,12,28]],"date-time":"2002-12-28T18:59:19Z","timestamp":1041101959000},"page":"129-155","source":"Crossref","is-referenced-by-count":10,"title":["On Appropriate Adaptation Levels for the Learning of Gene Linkage"],"prefix":"10.1007","volume":"3","author":[{"given":"James","family":"Smith","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"408586_CR1","unstructured":"P. J. Angeline, \u201cAdaptive and self-adaptive evolutionary computations,\u201d Computational Intelligence, pp. 152\u2013161, 1995."},{"key":"408586_CR2","unstructured":"T. Back, \u201cSelf adaptation in genetic algorithms,\u201d in Towards a Practice on Autonomous Systems: Proc. First European Conf. Artificial Life, F. Varela and P. Bourgine (eds.), 1992, pp. 263\u2013271."},{"key":"408586_CR3","doi-asserted-by":"crossref","unstructured":"T. Back, D. Fogel, and Z. Michalwicz, Handbook of Evolutionary Computation, Oxford University Press, 1997, vol. 1.","DOI":"10.1201\/9781420050387"},{"key":"408586_CR4","unstructured":"S. Baluja and S. Davies, \u201cUsing optimal dependency-trees for combinatorial optimisation: Learning the structure of the search space,\u201d in Proc. 1997 Internat. Conf. Machine Learning, Fisher (ed.), 1997."},{"key":"408586_CR5","unstructured":"P. Bosman and D. Thierens, \u201cLinkage information processing in distribution estimation algorithms,\u201d in Proc. Genetic and Evolutionary Computation Conf., W. Banzhaf, J. Daida, A. Eiben, M. Garzon, V. Honovar, M. Jakiela, and R. Smith (eds.), 1999, pp. 60\u201367."},{"key":"408586_CR6","unstructured":"K. De Jong, \u201cAn analysis of the behaviour of a class of genetic adaptive systems,\u201d Ph.D. thesis, University of Michigan, 1975."},{"key":"408586_CR7","first-page":"424","volume":"9","author":"J. S. DeBonet","year":"1997","unstructured":"J. S. DeBonet, C. Isbell, and P. Viola, \u201cMIMIC: Finding optima by estimating probability densities,\u201d Advances in Neural Information Processing Systems, vol. 9, pp. 424\u2013431, 1997.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"408586_CR8","doi-asserted-by":"crossref","unstructured":"A. E. Eiben, P. Raue, and Z. Ruttkay, \u201cGenetic algorithms with multi-parent recombination,\u201d in Proc. Third Conf. Parallel Problem Solving from Nature, Y. Davidor (ed.), 1994, pp. 78\u201387.","DOI":"10.1007\/3-540-58484-6_252"},{"key":"408586_CR9","doi-asserted-by":"crossref","unstructured":"A. E. Eiben, C. van Kemenade, and J. Kok, \u201cOrgy in the computer: Multi-parent reproduction in genetic algorithms,\u201d in Advances in Artifical Life: Proc. Third European Conf. Artifical Life. F. Moran, A. Moreno, J. Morelo, and P. Chacon (eds.), 1995, pp. 934\u2013945.","DOI":"10.1007\/3-540-59496-5_354"},{"key":"408586_CR10","unstructured":"R. Etxeberria and P. Larranaga, \u201cGlobal optimisation using Bayesian networks,\u201d in Proc. Second Symposium on Artificial Intell. (CIMAF-99), A. O. Rodriguez, M. S. Ortiz, and R. Hermida (eds.), 1999, pp. 332\u2013339."},{"key":"408586_CR11","doi-asserted-by":"crossref","unstructured":"S. Forrest and M. Mitchell, \u201cRelative building block fitness and the building block hypothesis,\u201d in Foundations of Genetic Algorithms 2, L. D. Whitley (ed.), 1992, pp. 109\u2013126.","DOI":"10.1016\/B978-0-08-094832-4.50013-1"},{"key":"408586_CR12","unstructured":"D. Goldberg, Genetic Algorithms in Search, Optimisation and Machine Learning, Addison Wesley, 1989."},{"key":"408586_CR13","series-title":"Tcga Report","volume-title":"Optimal initial population size for binary-coded genetic algorithms","author":"D. E. Goldberg","year":"1985","unstructured":"D. E. Goldberg, \u201cOptimal initial population size for binary-coded genetic algorithms,\u201d Tcga Report no. 85001, University of Alabama, Tuscaloosa, US, 1985."},{"issue":"5","key":"408586_CR14","first-page":"493","volume":"3","author":"D. E. Goldberg","year":"1989","unstructured":"D. E. Goldberg, B. Korb, and K. Deb, \u201cMessy genetic algorithms: Motivation, analysis, and first results,\u201d Complex Systems, vol. 3, no. 5, pp. 493\u2013530, 1989.","journal-title":"Complex Systems"},{"issue":"1","key":"408586_CR15","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1109\/TSMC.1986.289288","volume":"16","author":"J. J. Grefenstette","year":"1986","unstructured":"J. J. Grefenstette, \u201cOptimisation of control parameters for genetic algorithms,\u201d Transaction on Systems, Man and Cybernetics, vol. 16, no. 1, pp. 122\u2013128, 1986.","journal-title":"Transaction on Systems, Man and Cybernetics"},{"key":"408586_CR16","unstructured":"G. Harik, and D. Goldberg, \u201cLearning linkage,\u201d Technical Report IlliGAL 96006, Illinois Genetic Algorithms Laboratory, University of Illinois."},{"key":"408586_CR17","doi-asserted-by":"crossref","unstructured":"H. Kargupta, \u201cThe gene expression messy genetic algorithm,\u201d in Proc. Third IEEE International Conf. Evolutionary Computing, 1996, pp. 814\u2013819.","DOI":"10.1109\/ICEC.1996.542706"},{"issue":"4","key":"408586_CR18","first-page":"233","volume":"11","author":"H. Kargupta","year":"1999","unstructured":"H. Kargupta, \u201cSEARCH, computational processes in evolution, and preliminary development of the gene expression messy genetic algorithm,\u201d Journal of Complex Systems, vol. 11, no. 4, pp. 233\u2013287, 1999.","journal-title":"Journal of Complex Systems"},{"key":"408586_CR19","first-page":"266","volume":"2186","author":"H. Kargupta","year":"2000","unstructured":"H. Kargupta and S. Bandyopadhyay, \u201cA perspective on the foundation and evolution of the linkage learning genetic algorithms,\u201d J. Computer Methods in Applied Mechanics and Engineering, vol. 2186, pp. 266\u2013294, 2000.","journal-title":"Computer Methods in Applied Mechanics and Engineering"},{"key":"408586_CR20","unstructured":"J. R. Levenick, \u201cInserting introns improves genetic algorithm success rate: Taking a cue from biology,\u201d in Proc. Fourth Internat. Conf. Genetic Algorithms, R. K. Belewand L. B. Booker (eds.), San Mateo, CA, 1991, pp. 123\u2013127."},{"key":"408586_CR21","unstructured":"J. R. Levenick, \u201cMegabits: Generic endogenous crossover control,\u201d in Proc. Sixth Internat. Conf. Genetic Algorithms, L. J. Eshelman (ed.), pp. 88\u201395."},{"key":"408586_CR22","unstructured":"Muhlenbein and Mahnig, \u201cConvergence theory and applications of the factorized distribution algorithm,\u201d JCIT: J. Computing and Information Technology, vol. 7, 1999."},{"issue":"3","key":"408586_CR23","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1162\/evco.1997.5.3.303","volume":"5","author":"H. Muhlenbein","year":"1998","unstructured":"H. Muhlenbein, \u201cThe equation for the response to selection and its use for prediction,\u201d Evolutionary Computation, vol. 5, no. 3, pp. 303\u2013346, 1998.","journal-title":"Evolutionary Computation"},{"key":"408586_CR24","doi-asserted-by":"crossref","unstructured":"H. Muhlenbein and G. Paas, \u201cFrom recombination of genes to the estimation of distributions I. Binary parameters,\u201d in Proc. Fourth Conf. Parallel Problem Solving from Nature, H.-M. Voigt, W. Ebeling, I. Rechenberg, and H.-P. Schwefel (eds.), 1996, pp. 188\u2013197.","DOI":"10.1007\/3-540-61723-X_983"},{"issue":"4","key":"408586_CR25","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1162\/evco.1999.7.4.377","volume":"7","author":"M. Munetomo","year":"1999","unstructured":"M. Munetomo and D. E. Goldberg, \u201cLinkage Identification by Non-monotonicity Detection for Overlapping Functions,\u201d Evolutionary Computation, vol. 7, no. 4, pp. 377\u2013398, 1999.","journal-title":"Evolutionary Computation"},{"key":"408586_CR26","unstructured":"M. Pelikan, D. E. Goldberg, and E. Cant-Paz, \u201cBOA: The Bayesian optimization algorithm,\u201d in Proc. Genetic and Evolutionary Computation Conf., W. Banzhaf, J. Daida, A. Eiben, M. Garzon, V. Honovar, M. Jakiela, and R. Smith (eds.), 1999a, vol. 1, pp. 525\u2013532."},{"key":"408586_CR27","volume-title":"A survey of optimization by building and using probabilistic models","author":"M. Pelikan","year":"1999","unstructured":"M. Pelikan, D. E. Goldberg, and F. Lobo, \u201cA survey of optimization by building and using probabilistic models,\u201d Technical Report, Illinois Genetic Algorithms Laboratory, University of Illinois at Urbana-Champaign, 1999b."},{"key":"408586_CR28","doi-asserted-by":"crossref","unstructured":"M. Pelikan and H. Muehlenbein, \u201cThe bivariate marginal distribution algorithm,\u201d in Advances in Soft Computing\u2013Engineering Design and Manufacturing, R. Roy, T. Furuhashi, and P. Chawdhry (eds.), 1999, pp. 521\u2013535.","DOI":"10.1007\/978-1-4471-0819-1_39"},{"key":"408586_CR29","volume-title":"Evolutionsstrategie: Optimierung technischer Systeme nach Prinzipien der biologischen Evolution","author":"I. Rechenberg","year":"1973","unstructured":"I. Rechenberg, Evolutionsstrategie: Optimierung technischer Systeme nach Prinzipien der biologischen Evolution, Stuttgart: Frommann-Holzboog, 1973."},{"key":"408586_CR30","unstructured":"A. Salman, K. Mehrota, and C. Mohan, \u201cLinkage crossover for genetic algorithms,\u201d in Proc. Genetic and Evolutionary Computation Conf., W. Banzhaf, J. Daida, A. Eiben, M. Garzon, V. Honovar, M. Jakiela, and R. Smith (eds.), 1999, pp. 564\u2013571."},{"key":"408586_CR31","unstructured":"J. Schaffer and A. Morishima, \u201cAn adaptive crossover distribution mechanism for genetic algorithms,\u201d in Proc. Second Internat. Conf. Genetic Algorithms, J. J. Grefenstette (ed.), 1987, pp. 36\u201340."},{"key":"408586_CR32","unstructured":"J. D. Schaffer, R. A. Caruana, L. J. Eshelman, and R. Das, \u201cA study of control parameters affecting online performance of genetic algorithms for function optimisation,\u201d in Proc. Third Internat. Conf. Genetic Algorithms, J. D. Schaffer (ed.), 1989, pp. 51\u201360."},{"key":"408586_CR33","unstructured":"J. D. Schaffer and L. J. Eshelman, \u201cOn crossover as an evolutionarily viable strategy,\u201d in Proc. Fourth Internat. Conf. Genetic Algorithms, R. Belewand L. Booker (eds.), 1991, pp. 61\u201368."},{"key":"408586_CR34","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-0348-5927-1","volume-title":"Numerische Optimierung von Computer-Modellen mittels der Evolutionsstrategie","author":"H. P. Schwefel","year":"1977","unstructured":"H. P. Schwefel, Numerische Optimierung von Computer-Modellen mittels der Evolutionsstrategie, Basel\/Stuttgart: Birkhaeuser, 1977, vol. 26 of ISR."},{"key":"408586_CR35","volume-title":"Numerical Optimisation of Computer Models","author":"H. P. Schwefel","year":"1981","unstructured":"H. P. Schwefel, Numerical Optimisation of Computer Models, John Wiley and Sons: New York, 1981."},{"key":"408586_CR36","doi-asserted-by":"crossref","unstructured":"M. Sebag and M. Schoenauer, \u201cControlling crossover through inductive learning,\u201d in Proc. Third Conf. Parallel Problem Solving from Nature, Y. Davidor (ed.), 1994, pp. 209\u2013218.","DOI":"10.1007\/3-540-58484-6_265"},{"key":"408586_CR37","doi-asserted-by":"crossref","unstructured":"J. Smith and T. Fogarty, \u201cAdaptively parameterised evolutionary systems: Self adaptive recombination and mutation in a genetic algorithm,\u201d in Proc. Fourth Conf. Parallel Problem Solving from Nature, Voigt, Ebeling, Rechenberg, and Schwefel (eds.), 1996a, pp. 441\u2013450.","DOI":"10.1007\/3-540-61723-X_1008"},{"key":"408586_CR38","doi-asserted-by":"crossref","unstructured":"J. Smith and T. Fogarty, \u201cRecombination strategy adaptation via evolution of gene linkage,\u201d in Proc. Third IEEE Internat. Conf. Evolutionary Computing, 1996b, pp. 826\u2013831.","DOI":"10.1109\/ICEC.1996.542708"},{"key":"408586_CR39","doi-asserted-by":"crossref","unstructured":"J. Smith and T. Fogarty, \u201cSelf adaptation of mutation rates in a steady state genetic algorithm,\u201d in Proc. Third IEEE Internat. Conf. Evolutionary Computing, 1996c, pp. 318\u2013323.","DOI":"10.1109\/ICEC.1996.542382"},{"issue":"2","key":"408586_CR40","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/s005000050009","volume":"1","author":"J. Smith","year":"1997","unstructured":"J. Smith and T. Fogarty, \u201cOperator and parameter adaptation in genetic algorithms,\u201d Soft Computing, vol. 1, no. 2, pp. 81\u201387, 1997.","journal-title":"Soft Computing"},{"key":"408586_CR41","doi-asserted-by":"crossref","unstructured":"J. Smith and T. C. Fogarty, \u201cAn adaptive poly-parental recombination strategy,\u201d in Evolutionary Computing 2, T. C. Fogarty (ed.), 1995, pp. 48\u201361.","DOI":"10.1007\/3-540-60469-3_24"},{"key":"408586_CR42","unstructured":"J. E. Smith, \u201cSelf adaptation in evolutionary algorithms,\u201d Ph.D. thesis, University of the West of England, 1998."},{"key":"408586_CR43","unstructured":"W. M. Spears and K. A. De Jong, \u201cOn the virtues of parameterized uniform crossover,\u201d in Proc. Fourth Internat. Conf. Genetic Algorithms, R. Belewand L. Booker (eds.), 1991, pp. 230\u2013237."},{"key":"408586_CR44","unstructured":"D. Thierens and D. Goldberg, \u201cMixing in genetic algorithms,\u201d in Proc. Fifth Internat. Conf. Genetic Algorithms, S. Forrest (ed.), 1993, pp. 38\u201345."},{"key":"408586_CR45","doi-asserted-by":"crossref","unstructured":"C. van Kemenade, \u201cExplicit filtering of building blocks for genetic algorithms,\u201d in Proc. Fourth Conf. Parallel Problem Solving from Nature, H.-M. Voigt, W. Ebeling, I. Rechenberg, and H.-P. Schwefel (eds.), 1996, pp. 494\u2013503.","DOI":"10.1007\/3-540-61723-X_1013"},{"key":"408586_CR46","doi-asserted-by":"crossref","unstructured":"A. White and F. Oppacher, \u201cAdaptive crossover using automata,\u201d in Proc. Third Conf. Parallel Problem Solving from Nature, Y. Davidor (ed.), 1994, pp. 229\u2013238.","DOI":"10.1007\/3-540-58484-6_267"}],"container-title":["Genetic Programming and Evolvable Machines"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1015579825262.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1015579825262\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1015579825262.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,5]],"date-time":"2025-08-05T20:47:58Z","timestamp":1754426878000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1015579825262"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,6]]},"references-count":46,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2002,6]]}},"alternative-id":["408586"],"URL":"https:\/\/doi.org\/10.1023\/a:1015579825262","relation":{},"ISSN":["1389-2576","1573-7632"],"issn-type":[{"type":"print","value":"1389-2576"},{"type":"electronic","value":"1573-7632"}],"subject":[],"published":{"date-parts":[[2002,6]]}}}