{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,6]],"date-time":"2023-01-06T02:36:40Z","timestamp":1672972600932},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2007,11,8]],"date-time":"2007-11-08T00:00:00Z","timestamp":1194480000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Genet Program Evolvable Mach"],"published-print":{"date-parts":[[2008,6]]},"DOI":"10.1007\/s10710-007-9045-7","type":"journal-article","created":{"date-parts":[[2007,11,7]],"date-time":"2007-11-07T20:36:26Z","timestamp":1194467786000},"page":"125-155","source":"Crossref","is-referenced-by-count":3,"title":["Detecting the epistatic structure of generalized embedded landscape"],"prefix":"10.1007","volume":"9","author":[{"given":"Shude","family":"Zhou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert B.","family":"Heckendorn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zengqi","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,11,8]]},"reference":[{"issue":"4","key":"9045_CR1","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1162\/evco.1999.7.4.331","volume":"7","author":"D. Thierens","year":"1999","unstructured":"Thierens, D.: Scalability problems of simple genetic algorithms. Evol. Comput. 7(4), 331\u2013352 (1999)","journal-title":"Evol. Comput."},{"key":"9045_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-3643-4","volume-title":"The Design of Innovation: Lessons from and for Competent Genetic Algorithms","author":"D.E. Goldberg","year":"2002","unstructured":"Goldberg, D.E.: The Design of Innovation: Lessons from and for Competent Genetic Algorithms. Kluwer Academic Publishers, Boston (2002)"},{"key":"9045_CR3","first-page":"266","volume":"186","author":"H. Kargupta","year":"2000","unstructured":"Kargupta, H., Bandyopadhyay, S.: A perspective on the foundation and evolution of the linkage learning genetic algorithms. J. Comp. Methods Appl. Mech. Eng. 186, 266\u2013294 (2000)","journal-title":"J. Comp. Methods Appl. Mech. Eng."},{"key":"9045_CR4","unstructured":"Goldberg, D.E., Deb, K., Kargupta, H., Harik, G.: Rapid, accurate optimization of difficult optimization problems using fast messy genetic algorithms. In: Proceedings of the Fifth International Conference on Genetic Algorithms. San Mateo, USA (1993)"},{"key":"9045_CR5","unstructured":"Kargupta, H.: The gene expression messy genetic algorithm. In: Proceedings of the IEEE International Conference on Evolutionary Computation. Nogoya, Japan (1996)"},{"key":"9045_CR6","unstructured":"Harik, G.R.: Learning gene linkage to efficiently solve problems of bounded difficulty using genetic algorithms. Ph.D. dissertation, University of Michigan, Ann Arbor (1997)"},{"key":"9045_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-1539-5","volume-title":"Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation","author":"P. Larranaga","year":"2002","unstructured":"Larranaga, P., Lozano, J.A.: Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation. Kluwer Academic Publishers, Boston (2002)"},{"key":"9045_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/b10910","volume-title":"Hierarchical Bayesian Optimization Algorithm: Toward a New Generation of Evolutionary Algorithms","author":"M. Pelikan","year":"2005","unstructured":"Pelikan, M.: Hierarchical Bayesian Optimization Algorithm: Toward a New Generation of Evolutionary Algorithms. Springer Publication, Berlin (2005)"},{"issue":"4","key":"9045_CR9","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1162\/106365602760972758","volume":"10","author":"R.B. Heckendorn","year":"2002","unstructured":"Heckendorn, R.B.: Embedded landscapes. Evol. Comput. 10(4), 345\u2013369 (2002)","journal-title":"Evol. Comput."},{"issue":"1","key":"9045_CR10","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1162\/10636560151075112","volume":"9","author":"H. Kargupta","year":"2001","unstructured":"Kargupta, H., Park, B.: Gene expression and fast construction of distributed evolutionary representation. Evol. Comput. 9(1), 43\u201359 (2001)","journal-title":"Evol. Comput."},{"issue":"4","key":"9045_CR11","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1162\/1063656043138914","volume":"12","author":"R.B Heckendorn","year":"2004","unstructured":"Heckendorn, R.B., Wright, A.: Efficient linkage discovery by limited probing. Evol. Comput. 12(4), 517\u2013545 (2004)","journal-title":"Evol. Comput."},{"key":"9045_CR12","unstructured":"Rana, S., Heckendorn, R.B., Whitley, D.: A tractable Walsh analysis of sat and its implication of genetic algorithms. In: Proceedings of the Fifteenth National Conference on Artificial Intelligence, pp. 392\u2013397. AAAI, Menlo Park, CA (1998)"},{"key":"9045_CR13","doi-asserted-by":"crossref","unstructured":"Wright, A.H., Pulavarty, S.: On the convergence of an estimation of distribution algorithm based on linkage discovery and factorization. In: GECCO 2005 Proceedings, pp. 695\u2013702. ACM SIGEVO, June (2005)","DOI":"10.1145\/1068009.1068126"},{"key":"9045_CR14","unstructured":"M\u00fchlenbein, H.: Convergence of estimation of distribution algorithms for finite samples. http:\/\/www.ais.fhg.de\/muehlen\/pegasus\/publications.html (2007)"},{"key":"9045_CR15","unstructured":"Chen, Y.-P.: Extending the scalability of linkage learning genetic algorithms: theory and practice. IlliGAL Report No. 2004018 (2004)"},{"issue":"2","key":"9045_CR16","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1023\/A:1009689913453","volume":"5","author":"H. M\u00fchlenbein","year":"1999","unstructured":"M\u00fchlenbein, H., Mahnig, T., Ochoa, A.R.: Schemata, distributions and graphical models in evolutionary optimization. J. Heuristics 5(2), 215\u2013247 (1999)","journal-title":"J. Heuristics"},{"key":"9045_CR17","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/S0888-613X(02)00093-2","volume":"31","author":"H. M\u00fchlenbein","year":"2002","unstructured":"M\u00fchlenbein, H., Mahnig, T.: Evolutionary optimization and the estimation of search distribution with application to graph bipartitioning. J. Approx. Reason. 31, 157\u2013192 (2002)","journal-title":"J. Approx. Reason."},{"issue":"2","key":"9045_CR18","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1109\/TEVC.2003.820663","volume":"8","author":"Q. Zhang","year":"2004","unstructured":"Zhang, Q., M\u00fcehlenbein, H.: On the convergence of a class of estimation of distribution algorithms. IEEE Trans. Evol. Comput. 8(2), 127\u2013136 (2004)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"1","key":"9045_CR19","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1109\/TEVC.2003.819431","volume":"8","author":"Q. Zhang","year":"2004","unstructured":"Zhang, Q.: On stability of fixed points of limit models of univariate marginal distribution algorithm and factorized distribution algorithm. IEEE Trans. Evol. Comput. 8(1), 80\u201393 (2004)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"4","key":"9045_CR20","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1162\/evco.1999.7.4.377","volume":"7","author":"M. Munetomo","year":"1999","unstructured":"Munetomo, M., Goldberg, D.E.: Linkage identification by non-monotonicity detection for overlapping functions. Evol. Comput. 7(4), 377\u2013398 (1999)","journal-title":"Evol. Comput."},{"issue":"4","key":"9045_CR21","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1162\/evco.1997.5.4.439","volume":"5","author":"G.J. Koehler","year":"1998","unstructured":"Koehler, G.J., Bhattacharyya, S., Vose, M.D.: General cardinality genetic algorithms. Evol. Comput. 5(4), 439\u2013549 (1998)","journal-title":"Evol. Comput."},{"issue":"3","key":"9045_CR22","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1162\/evco.1998.6.3.253","volume":"6","author":"M.D. Vose","year":"1998","unstructured":"Vose, M.D., Wright, A.H.: The simple genetic algorithm and the Walsh transform: Part I, theory. Evol. Comput. 6(3), 253\u2013273 (1998)","journal-title":"Evol. Comput."},{"key":"9045_CR23","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1162\/evco.1998.6.3.275","volume":"6","author":"M.D. Vose","year":"1998","unstructured":"Vose, M.D., Wright, A.H.: The simple genetic algorithm and the Walsh transform: Part II, the inverse. Evol. Comput. 6, 275\u2013289 (1998)","journal-title":"Evol. Comput."},{"key":"9045_CR24","unstructured":"Simon, H.A.: The Science of the Artificial. MIT Press (1981)"},{"key":"9045_CR25","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1007\/BF00197646","volume":"62","author":"D.E. Goldberg","year":"1990","unstructured":"Goldberg, D.E., Bridges C.L.: An analysis of a reordering operator on a ga-hard problem. Biol. Cybernet. 62, 397\u2013405 (1990)","journal-title":"Biol. Cybernet."},{"key":"9045_CR26","first-page":"493","volume":"3","author":"D.E. Goldberg","year":"1989","unstructured":"Goldberg, D.E., Korb, B., Deb, K.: Messy genetic algorithms: motivation, analysis and first results. Complex Syst. 3, 493\u2013530 (1989)","journal-title":"Complex Syst."},{"key":"9045_CR27","unstructured":"Bethke, A.D.: Genetic algorithms as function optimizers. Dissertation University of Michigan, Ann Arbor (1981)"},{"issue":"1","key":"9045_CR28","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1162\/evco.1999.7.1.69","volume":"7","author":"R.B. Heckendorn","year":"1999","unstructured":"Heckendorn, R.B., Whitley, D.: Predicting epistasis from mathematical models. Evol. Comput. 7(1), 69\u2013101 (1999)","journal-title":"Evol. Comput."},{"key":"9045_CR29","unstructured":"Heckendorn, R.B., Rana, S., Whitley, D.: Test function generators as embedded landscapes. In: Foundations of Genetic Algorithms \u2013 5. Morgan Kaufmann Publishers (1999)"},{"issue":"4","key":"9045_CR30","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1162\/evco.1999.7.4.353","volume":"7","author":"H. M\u00fchlenbein","year":"1999","unstructured":"M\u00fchlenbein, H., Mahnig, T.: Fda \u2013 a scalable evolutionary algorithm for the optimization of additively decomposed functions. Evol. Comput. 7(4), 353\u2013376 (1999)","journal-title":"Evol. Comput."},{"key":"9045_CR31","doi-asserted-by":"crossref","unstructured":"Kargupta, H., Bandyopadhyay, S.: Further experimentations on the scalability of the gemga. In: Lecture Notes in Computer Science: Parallel Problem Solving from Nature, pp. 315\u2013324. Springer-Verlag, Amsterdam (1998)","DOI":"10.1007\/BFb0056874"},{"key":"9045_CR32","doi-asserted-by":"crossref","unstructured":"Bandyopadhyay, S., Kargupta, H., Wang, G.: Revisiting the gemga: scalable evolutionary optimization through linkage learning. In: Proceedings of the IEEE International Conference on Evolutionary Computation, pp. 603\u2013608. IEEE Press, Piscataway (1998)","DOI":"10.1109\/ICEC.1998.700097"},{"key":"9045_CR33","first-page":"227","volume":"8","author":"S. Bhattacharyya","year":"1994","unstructured":"Bhattacharyya, S., Koehler, G.: An analysis of non-binary genetic algorithm with cardinality 2 v . Complex Syst. 8, 227\u2013256 (1994)","journal-title":"Complex Syst."},{"key":"9045_CR34","volume-title":"Digital Signal Processing Algorithms: Number Theory, Convolution, Fast Fourier Transforms, and Applications","author":"H. Krishna Garg","year":"1998","unstructured":"Krishna Garg, H.: Digital Signal Processing Algorithms: Number Theory, Convolution, Fast Fourier Transforms, and Applications. CRC Press, Boston (1998)"},{"key":"9045_CR35","unstructured":"Rotman, J.J.: Advanced Modern Algebra. Prentice Hall (2002)"},{"key":"9045_CR36","unstructured":"Oei, C.K.: Walsh function analysis of genetic algorithms of nonbinary strings. Unpublished Masters Thesis, UIUC, (1992)"},{"key":"9045_CR37","doi-asserted-by":"crossref","unstructured":"Iglesias, M.T., Naudts, B., Verschoren, A., Vidal C.: Walsh transforms, balanced sum theorems and partition coefficients over multary alphabets. In: GECCO 2005 Proceedings, pp. 1303\u20131308. ACM SIGEVO, June (2005)","DOI":"10.1145\/1068009.1068220"},{"key":"9045_CR38","volume-title":"Digital Signal Processing","author":"A.V. Oppenheim","year":"1975","unstructured":"Oppenheim, A.V., Schafer, R.W.: Digital Signal Processing. Prentice Hall, Inc, Englewood Cliffs, NJ (1975)"},{"key":"9045_CR39","unstructured":"Kargupta, H., Goldberg, D.E.: SEARCH, blackbox optimization, and sample complexity. In: Belew, R., Vose, M. (eds.) Foundations of Genetic Algorithms, pp. 291\u2013324. Morgan Kaufmann (1996)"},{"issue":"4","key":"9045_CR40","first-page":"233","volume":"11","author":"H. Kargupta","year":"1997","unstructured":"Kargupta, H.: SEARCH, computational processes in evolution, and preliminary development of the gene expression messy genetic algorithm. Complex Syst. 11(4), 233\u2013287 (1997)","journal-title":"Complex Syst."}],"container-title":["Genetic Programming and Evolvable Machines"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10710-007-9045-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10710-007-9045-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10710-007-9045-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T22:22:04Z","timestamp":1559254924000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10710-007-9045-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,11,8]]},"references-count":40,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2008,6]]}},"alternative-id":["9045"],"URL":"https:\/\/doi.org\/10.1007\/s10710-007-9045-7","relation":{},"ISSN":["1389-2576","1573-7632"],"issn-type":[{"value":"1389-2576","type":"print"},{"value":"1573-7632","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,11,8]]}}}