{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T20:49:51Z","timestamp":1743022191948,"version":"3.40.3"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319270593"},{"type":"electronic","value":"9783319270609"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-27060-9_29","type":"book-chapter","created":{"date-parts":[[2015,11,19]],"date-time":"2015-11-19T15:14:30Z","timestamp":1447946070000},"page":"353-363","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Finding the Optimal Sample Based on Shannon\u2019s Entropy and Genetic Algorithms"],"prefix":"10.1007","author":[{"given":"Edwin","family":"Aldana-Bobadilla","sequence":"first","affiliation":[]},{"given":"Carlos","family":"Alfaro-P\u00e9rez","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,12,30]]},"reference":[{"key":"29_CR1","volume-title":"Theory and Methods of Survey Sampling","author":"P Mukhopadhyay","year":"2009","unstructured":"Mukhopadhyay, P.: Theory and Methods of Survey Sampling. PHI Learning Pvt. Ltd., New Delhi (2009)"},{"key":"29_CR2","volume-title":"Sampling Theory of Surveys with Applications","author":"PV Sukhatme","year":"1957","unstructured":"Sukhatme, P.V.: Sampling Theory of Surveys with Applications. Iowa State University Press, Ames (1957)"},{"key":"29_CR3","unstructured":"Israel, G.D.: Sampling the evidence of extension program impact. University of Florida Cooperative Extension Service, Institute of Food and Agriculture Sciences, EDIS (1992)"},{"key":"29_CR4","volume-title":"Sampling Techniques","author":"WG Cochran","year":"2007","unstructured":"Cochran, W.G.: Sampling Techniques. Wiley, New York (2007)"},{"key":"29_CR5","volume-title":"Model Assisted Survey Sampling","author":"C-E S\u00e4rndal","year":"2003","unstructured":"S\u00e4rndal, C.-E., Swensson, B., Wretman, J.: Model Assisted Survey Sampling. Springer, New York (2003)"},{"key":"29_CR6","doi-asserted-by":"publisher","first-page":"1593","DOI":"10.1214\/009117906000000791","volume":"34","author":"I Barany","year":"2007","unstructured":"Barany, I., Vu, V.: Central limit theorems for Gaussian polytopes. Ann. Probab. 34, 1593\u20131621 (2007)","journal-title":"Ann. Probab."},{"issue":"1","key":"29_CR7","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1145\/584091.584093","volume":"5","author":"CE Shannon","year":"2001","unstructured":"Shannon, C.E.: A mathematical theory of communication. ACM SIGMOBILE Mob. Comput. Commun. Rev. 5(1), 3\u201355 (2001)","journal-title":"ACM SIGMOBILE Mob. Comput. Commun. Rev."},{"issue":"3","key":"29_CR8","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F Glover","year":"1989","unstructured":"Glover, F.: Tabu search-part I. ORSA J. Comput. 1(3), 190\u2013206 (1989)","journal-title":"ORSA J. Comput."},{"issue":"4598","key":"29_CR9","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220(4598), 671\u2013680 (1983)","journal-title":"Science"},{"key":"29_CR10","first-page":"36","volume-title":"Encyclopedia of Machine Learning","author":"M Dorigo","year":"2010","unstructured":"Dorigo, M., Birattari, M.: Ant colony optimization. In: Sammut, C., Webb, G.I. (eds.) Encyclopedia of Machine Learning, pp. 36\u201339. Springer, New York (2010)"},{"key":"29_CR11","series-title":"Encyclopedia of Machine Learning","first-page":"760","volume-title":"Particle Swarm Optimization","author":"J Kennedy","year":"2010","unstructured":"Kennedy, J.: Particle Swarm Optimization. Encyclopedia of Machine Learning, pp. 760\u2013766. Springer, New York (2010)"},{"key":"29_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1007\/3-540-56602-3_163","volume-title":"Machine Learning: ECML-93","author":"WM Spears","year":"1993","unstructured":"Spears, W.M., et al.: An overview of evolutionary computation. In: Brazdil, P.B. (ed.) ECML 1993. LNCS, vol. 667, pp. 442\u2013459. Springer, Heidelberg (1993)"},{"issue":"1","key":"29_CR13","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1023\/A:1006554906681","volume":"12","author":"SAH Geritz","year":"1998","unstructured":"Geritz, S.A.H., Mesze, G., Metz, J.A.J.: Evolutionarily singular strategies and the adaptive growth and branching of the evolutionary tree. Evol. Ecol. 12(1), 35\u201357 (1998)","journal-title":"Evol. Ecol."},{"issue":"2","key":"29_CR14","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1109\/4235.687880","volume":"1","author":"J-H Kim","year":"1997","unstructured":"Kim, J.-H., Myung, H.: Evolutionary programming techniques for constrained optimization problems. IEEE Trans. Evol. Comput. 1(2), 129\u2013140 (1997)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"29_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/3-540-48885-5_8","volume-title":"Genetic Programming","author":"JR Koza","year":"1999","unstructured":"Koza, J.R., Bennett III, F.H., Stiffelman, O.: Genetic programming as a Darwinian invention machine. In: Langdon, W.B., Fogarty, T.C., Nordin, P., Poli, R. (eds.) EuroGP 1999. LNCS, vol. 1598, pp. 93\u2013108. Springer, Heidelberg (1999)"},{"issue":"2","key":"29_CR16","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1023\/A:1022602019183","volume":"3","author":"DE Goldberg","year":"1988","unstructured":"Goldberg, D.E., Holland, J.H.: Genetic algorithms and machine learning. Mach. Learn. 3(2), 95\u201399 (1988)","journal-title":"Mach. Learn."},{"issue":"1","key":"29_CR17","doi-asserted-by":"publisher","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 Netw. 5(1), 96\u2013101 (1994)","journal-title":"IEEE Trans. Neural Netw."},{"key":"29_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-45111-9_1","volume-title":"Advances in Soft Computing and Its Applications","author":"A Kuri-Morales","year":"2013","unstructured":"Kuri-Morales, A., Aldana-Bobadilla, E.: The best genetic algorithm I. In: Castro, F., Gelbukh, A., Gonz\u00e1lez, M. (eds.) MICAI 2013, Part II. LNCS, vol. 8266, pp. 1\u201315. Springer, Heidelberg (2013)"},{"key":"29_CR19","unstructured":"Morales, A.K., Quezada, C.V.: A universal eclectic genetic algorithm for constrained optimization. Proceedings of the 6th European Congress on Intelligent Techniques and Soft Computing, vol. 1 (1998)"},{"key":"29_CR20","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1002\/j.1538-7305.1948.tb01338.x","volume":"27","author":"CE Shannon","year":"1948","unstructured":"Shannon, C.E.: A note on the concept of entropy. Bell Syst. Tech. J. 27, 379\u2013423 (1948)","journal-title":"Bell Syst. Tech. J."},{"key":"29_CR21","unstructured":"Shannon, C.E., Weaver, W.: The mathematical theory of information (1949)"},{"issue":"4","key":"29_CR22","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1080\/00031305.1996.10473566","volume":"50","author":"RJ Hyndman","year":"1996","unstructured":"Hyndman, R.J., Fan, Y.: Sample quantiles in statistical packages. Am. Stat. 50(4), 361\u2013365 (1996)","journal-title":"Am. Stat."},{"key":"29_CR23","unstructured":"Hyndman, R.J.: The problem with Sturges\u2019 rule for constructing histograms. Monash University (1995)"},{"issue":"4","key":"29_CR24","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1080\/00031305.1976.10479172","volume":"30","author":"DP Doane","year":"1976","unstructured":"Doane, D.P.: Aesthetic frequency classifications. Am. Stat. 30(4), 181\u2013183 (1976)","journal-title":"Am. Stat."},{"key":"29_CR25","unstructured":"Soo, N.H., Halim, Y.: Feature selection methodology in quality data mining (2004)"},{"issue":"4","key":"29_CR26","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/BF01096412","volume":"3","author":"DJ White","year":"1993","unstructured":"White, D.J., Anandalingam, G.: A penalty function approach for solving bi-level linear programs. J. Glob. Optim. 3(4), 397\u2013419 (1993)","journal-title":"J. Glob. Optim."},{"key":"29_CR27","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/3-540-46016-0_12","volume-title":"MICAI 2002: Advances in Artificial Intelligence","author":"\u00c1F Kuri-Morales","year":"2002","unstructured":"Kuri-Morales, \u00c1.F., Guti\u00e9rrez-Garc\u00eda, J.O.: Penalty function methods for constrained optimization with genetic algorithms: a statistical analysis. In: Coello Coello, C.A., de Albornoz, \u00c1., Sucar, L., Battistutti, O.C. (eds.) MICAI 2002. LNCS (LNAI), vol. 2313, pp. 108\u2013117. Springer, Heidelberg (2002)"},{"issue":"1","key":"29_CR28","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.engappai.2008.04.003","volume":"22","author":"A Kuri-Morales","year":"2009","unstructured":"Kuri-Morales, A., Rodr\u00edguez-Erazo, F.: A search space reduction methodology for data mining in large databases. Eng. Appl. Artif. Intell. 22(1), 57\u201365 (2009)","journal-title":"Eng. Appl. Artif. Intell."},{"key":"29_CR29","unstructured":"Lichman, M.: UCI Machine Learning Repository. http:\/\/archive.ics.uci.edu\/ml\/datasets\/Gisette . University of California, School of Information and Computer Science, Irvine (2013)"}],"container-title":["Lecture Notes in Computer Science","Advances in Artificial Intelligence and Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-27060-9_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,12]],"date-time":"2024-06-12T15:20:12Z","timestamp":1718205612000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-27060-9_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319270593","9783319270609"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-27060-9_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"30 December 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}