{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T23:51:28Z","timestamp":1649202688611},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2010,3,11]],"date-time":"2010-03-11T00:00:00Z","timestamp":1268265600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Sci. China Inf. Sci."],"published-print":{"date-parts":[[2010,4]]},"DOI":"10.1007\/s11432-010-0041-9","type":"journal-article","created":{"date-parts":[[2010,3,12]],"date-time":"2010-03-12T18:30:53Z","timestamp":1268418653000},"page":"715-728","source":"Crossref","is-referenced-by-count":7,"title":["About the convergence rates of a class of gene expression programming"],"prefix":"10.1007","volume":"53","author":[{"given":"Xin","family":"Du","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"LiXin","family":"Ding","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,3,11]]},"reference":[{"key":"41_CR1","volume-title":"Gene Expression Programming: Mathematical Modeling by an Artificial Intelligence","author":"C. Ferreira","year":"2006","unstructured":"Ferreira C. Gene Expression Programming: Mathematical Modeling by an Artificial Intelligence. 2nd ed. Berlin: Springer-Verlag, 2006","edition":"2nd ed."},{"key":"41_CR2","first-page":"1459","volume":"9","author":"J. Peng","year":"2005","unstructured":"Peng J, Tang C J, Li C, et al. M-GEP: A new evolution algorithm based on multi-layer chromosomes gene expression programming (in Chinese). Chinese J Comput, 2005, 9: 1459\u20131466","journal-title":"Chinese J Comput"},{"key":"41_CR3","unstructured":"Du X, Li Y Q, Xie D T, et al. A new algorithm of automatic programming: GEDGEP. In: The 6th International Conference on Simulated Evolution and Learning, Hefei, 2006. 292\u2013301"},{"key":"41_CR4","first-page":"55","volume":"31","author":"J. Zuo","year":"2004","unstructured":"Zuo J, Tang C J, Li C, et al. Time series prediction based on gene expression programming (in Chinese). Int Confer Web Inf Age, 2004, 31: 55\u201364","journal-title":"Int Confer Web Inf Age"},{"key":"41_CR5","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1109\/TEVC.2003.819261","volume":"7","author":"C. Zhou","year":"2003","unstructured":"Zhou C, Xiao W M, Tirpak T M, et al. Evolving accurate and compact classification rules with gene expression programming. IEEE Trans Evolut Comput, 2003, 7: 519\u2013531","journal-title":"IEEE Trans Evolut Comput"},{"key":"41_CR6","first-page":"1247","volume":"28","author":"X. B. Jia","year":"2005","unstructured":"Jia X B, Tang C J, Zuo J, et al. Mining frequent function set based on gene expression programming (in Chinese). Chinese J Comput, 2005, 28: 1247\u20131254","journal-title":"Chinese J Comput"},{"key":"41_CR7","doi-asserted-by":"crossref","first-page":"655","DOI":"10.1109\/21.370197","volume":"25","author":"J. Suzuki","year":"1995","unstructured":"Suzuki J. A Markov chain analysis on simple genetic algorithms. IEEE Trans Syst Man Cyber, 1995, 25: 655\u2013659","journal-title":"IEEE Trans Syst Man Cyber"},{"key":"41_CR8","first-page":"559","volume-title":"Proceedings of the Genetic and Evolutionary Computation Conference","author":"F. Schmitt","year":"2001","unstructured":"Schmitt F, Rothlauf F. On the importance of the second largest eigenvalue on the convergence rate of genetic algorithms. In: Proceedings of the Genetic and Evolutionary Computation Conference. Sanfrancisco: ACM, 2001. 559\u2013564"},{"key":"41_CR9","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/S0304-3975(99)00091-2","volume":"229","author":"J. He","year":"1999","unstructured":"He J, Kang L S. On the convergence rates of genetic algorithms. Theor Comput Sci, 1999, 229: 23\u201339","journal-title":"Theor Comput Sci"},{"key":"41_CR10","doi-asserted-by":"crossref","first-page":"601","DOI":"10.1016\/S1383-7621(01)00018-2","volume":"47","author":"J. He","year":"2001","unstructured":"He J, Yu X H. Conditions for the convergence of evolutionary algorithms. J Syst Architect, 2001, 47: 601\u2013612","journal-title":"J Syst Architect"},{"key":"41_CR11","doi-asserted-by":"crossref","first-page":"1809","DOI":"10.1016\/j.artint.2008.07.001","volume":"172","author":"Y. Yu","year":"2008","unstructured":"Yu Y, Zhou Z H. A new approach to estimating the expected first hitting time of evolutionary algorithms. Artif Intell, 2008, 172: 1809\u20131832","journal-title":"Artif Intell"},{"key":"41_CR12","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/S0004-3702(01)00058-3","volume":"127","author":"J. He","year":"2001","unstructured":"He J, Yao X. Drift analysis and average time complexity of evolutionary algorithms. Artif Intell, 2001, 127: 57\u201385","journal-title":"Artif Intell"},{"key":"41_CR13","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1023\/B:NACO.0000023417.31393.c7","volume":"3","author":"J. He","year":"2004","unstructured":"He J, Yao X. A study of drift analysis of estimating computation time of evolutionary algorithms. Nat Comput, 2004, 3: 21\u201335","journal-title":"Nat Comput"},{"key":"41_CR14","first-page":"82","volume-title":"Proceeding of the 10th International Conference on Parallel Problem Solving from Nature","author":"P. S. Oliveto","year":"2008","unstructured":"Oliveto P S, Witt C. Simplified drift analysis for proving lower bounds in evolutionary computation. In: Proceeding of the 10th International Conference on Parallel Problem Solving from Nature. Berlin: Springer-Verlag, 2008. 82\u201391"},{"key":"41_CR15","first-page":"100","volume":"36","author":"C. A. Yuan","year":"2004","unstructured":"Yuan C A, Tang C J, Zuo J, et al. Function mining based on gene expression programming-convergence analysis and remnant-guided evolution algorithm (in Chinese). J Sichun Univ, 2004 36: 100\u2013105","journal-title":"J Sichun Univ"},{"key":"41_CR16","first-page":"359","volume":"28","author":"C. A. Yuan","year":"2006","unstructured":"Yuan C A, Tang C J, Wen Y, et al. Convergency of genetic regression in data mining based on gene expression programming and optimized solution. Int J Comput Appl, 2006, 28: 359\u2013366","journal-title":"Int J Comput Appl"},{"key":"41_CR17","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/3927.001.0001","volume-title":"An Introduction to Genetic algorithms","author":"M. Mitchell","year":"1998","unstructured":"Mitchell M. An Introduction to Genetic algorithms. Cambridge: MA MIT Press, 1998"},{"key":"41_CR18","volume-title":"Genetic Programming: On the Programming of Computers by Means of Nature Selection","author":"J. R. Koza","year":"1992","unstructured":"Koza J R. Genetic Programming: On the Programming of Computers by Means of Nature Selection. Cambridge: MA MIT Press, 1992"},{"key":"41_CR19","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1109\/72.265964","volume":"5","author":"G. Rudolph","year":"1994","unstructured":"Rudolph G. Convergence analysis of canonical genetic algorithms. IEEE Trans Neural Networ, 1994, 5: 96\u2013101","journal-title":"IEEE Trans Neural Networ"},{"key":"41_CR20","volume-title":"Finite Markov Processes and Their Application","author":"M. Iosifescu","year":"1980","unstructured":"Iosifescu M. Finite Markov Processes and Their Application. Chichester: Wiley, 1980"},{"key":"41_CR21","volume-title":"Matrix Analysis","author":"R. A. Horn","year":"2005","unstructured":"Horn R A, Johnson C R. Matrix Analysis. Beijing: Posts and Telecom Press, 2005"}],"container-title":["Science China Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-010-0041-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11432-010-0041-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-010-0041-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,3]],"date-time":"2020-06-03T00:32:34Z","timestamp":1591144354000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11432-010-0041-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,3,11]]},"references-count":21,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2010,4]]}},"alternative-id":["41"],"URL":"https:\/\/doi.org\/10.1007\/s11432-010-0041-9","relation":{},"ISSN":["1674-733X","1869-1919"],"issn-type":[{"value":"1674-733X","type":"print"},{"value":"1869-1919","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,3,11]]}}}