{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:45:30Z","timestamp":1742913930244,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540223436"},{"type":"electronic","value":"9783540248552"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"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":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24855-2_14","type":"book-chapter","created":{"date-parts":[[2010,9,14]],"date-time":"2010-09-14T08:20:59Z","timestamp":1284452459000},"page":"150-161","source":"Crossref","is-referenced-by-count":2,"title":["New Epistasis Measures for Detecting Independently Optimizable Partitions of Variables"],"prefix":"10.1007","author":[{"given":"Dong-Il","family":"Seo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sung-Soon","family":"Choi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Byung-Ro","family":"Moon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"14_CR1","first-page":"1","volume-title":"Local Search in Combinatorial Optimization","author":"E.H. Aarts","year":"1997","unstructured":"Aarts, E.H., Lenstra, J.K.: Introduction. In: Local Search in Combinatorial Optimization, pp. 1\u201317. John Wiley & Sons, Chichester (1997)"},{"key":"14_CR2","unstructured":"Papadimitriou, C.H., Steiglitz, K.: Combinatorial Optimization: Algorithms and Complexity. Dover Publications (1998)"},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"Seo, D.I., Moon, B.R.: A survey on chromosomal structures and operators for exploiting topological linkages of genes. In: Genetic and Evolutionary Computation Conference (2003)","DOI":"10.1007\/3-540-45110-2_10"},{"issue":"1","key":"14_CR4","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1013500812258","volume":"21","author":"M. Pelikan","year":"2002","unstructured":"Pelikan, M., Goldberg, D.E., Lobo, F.: A survey of optimization by building and using probabilistic models. Computational Optimization and Applications\u00a021(1), 5\u201320 (2002)","journal-title":"Computational Optimization and Applications"},{"key":"14_CR5","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. Larra\u00f1aga","year":"2002","unstructured":"Larra\u00f1aga, P., Lozano, J.A.: Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation. Kluwer Academic Publishers, Dordrecht (2002)"},{"key":"14_CR6","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198522195.001.0001","volume-title":"Graphical models","author":"S.L. Lauritzen","year":"1996","unstructured":"Lauritzen, S.L.: Graphical models. Clarendon Press, Oxford (1996)"},{"key":"14_CR7","volume-title":"Graphical Models for Machine Learning and Digital Communication","author":"B.J. Fery","year":"1998","unstructured":"Fery, B.J.: Graphical Models for Machine Learning and Digital Communication. MIT Press, Cambridge (1998)"},{"key":"14_CR8","first-page":"369","volume":"4","author":"Y. Davidor","year":"1990","unstructured":"Davidor, Y.: Epistasis variance: Suitability of a representation to genetic algorithms. Complex Systems\u00a04, 369\u2013383 (1990)","journal-title":"Complex Systems"},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"Seo, D.I., Kim, Y.H., Moon, B.R.: New entropy-based measures of gene significance and epistasis. In: Genetic and Evolutionary Computation Conference (2003)","DOI":"10.1007\/3-540-45110-2_9"},{"key":"14_CR10","unstructured":"Seo, D.I., Choi, S.S., Kim, Y.H., Moon, B.R.: New epistasis measures based on Shannon\u2019s entropy for combinatorial optimization problems (2004) (in preparation)"},{"key":"14_CR11","first-page":"7","volume":"3","author":"C.R. Reeves","year":"1995","unstructured":"Reeves, C.R., Wright, C.C.: An experimental design perspective on genetic algorithms. Foundations of Genetic Algorithms\u00a03, 7\u201322 (1995)","journal-title":"Foundations of Genetic Algorithms"},{"key":"14_CR12","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1002\/j.1538-7305.1948.tb01338.x","volume":"27","author":"C.E. Shannon","year":"1948","unstructured":"Shannon, C.E.: A mathematical theory of communication. Bell System Technical Journal\u00a027, 379\u2013423, 623\u2013656 (1948)","journal-title":"Bell System Technical Journal"},{"key":"14_CR13","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611","volume-title":"Elements of Information Theory","author":"T. Cover","year":"1991","unstructured":"Cover, T., Thomas, J.: Elements of Information Theory. John Wiley & Sons, Chichester (1991)"},{"key":"14_CR14","unstructured":"Seo, D.I., Choi, S.S., Moon, B.R.: The epistasis and problem decomposition for combinatorial optimization problems (2004) (in preparation)"},{"key":"14_CR15","unstructured":"Holland, J.: Adaptation in Natural and Artificial Systems. The University of Michigan Press (1975)"},{"issue":"4","key":"14_CR16","doi-asserted-by":"publisher","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 \u2014 A scalable evolutionary algorithm for the optimization of additively decomposed functions. Evolutionary Computation\u00a07(4), 353\u2013376 (1999)","journal-title":"Evolutionary Computation"},{"key":"14_CR17","first-page":"109","volume":"2","author":"S. Forrest","year":"1993","unstructured":"Forrest, S., Mitchell, M.: Relative building-block fitness and the building-block hypothesis. Foundations of Genetic Algorithms\u00a02, 109\u2013126 (1993)","journal-title":"Foundations of Genetic Algorithms"},{"key":"14_CR18","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)"}],"container-title":["Lecture Notes in Computer Science","Genetic and Evolutionary Computation \u2013 GECCO 2004"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24855-2_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,30]],"date-time":"2024-03-30T12:03:14Z","timestamp":1711800194000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-24855-2_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540223436","9783540248552"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24855-2_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}