{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,3]],"date-time":"2023-09-03T02:16:27Z","timestamp":1693707387383},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2010,2,12]],"date-time":"2010-02-12T00:00:00Z","timestamp":1265932800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2011,5]]},"DOI":"10.1007\/s00500-010-0557-3","type":"journal-article","created":{"date-parts":[[2010,2,11]],"date-time":"2010-02-11T06:07:53Z","timestamp":1265868473000},"page":"907-915","source":"Crossref","is-referenced-by-count":4,"title":["Using selfish gene theory to construct mutual information and entropy based clusters for bivariate optimizations"],"prefix":"10.1007","volume":"15","author":[{"given":"Feng","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhiyi","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cheng","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuanxiang","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,2,12]]},"reference":[{"issue":"3","key":"557_CR1","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1109\/TEVC.2007.902856","volume":"12","author":"CW Ahn","year":"2008","unstructured":"Ahn CW, Ramakrishna RS (2008) On the scalability of real-coded bayesian optimization algorithm. IEEE Trans Evol Comput 12(3):307\u2013322","journal-title":"IEEE Trans Evol Comput"},{"key":"557_CR2","unstructured":"Baluja S (1994) Population-based incremental learning: a method for integrating genetic search based function optimization and competitive learning. Technical Report CMU-CS-94-163, Carnegie Mellon University, Pittsburgh"},{"key":"557_CR3","unstructured":"Baluja S, Davies S (1997) Using optimal dependency-trees for combinational optimization. In: ICML \u201997: Proceedings of the fourteenth international conference on machine learning, San Francisco, pp 30\u201338"},{"key":"557_CR4","unstructured":"Baluja S, Davies S (1998) Fast probabilistic modeling for combinatorial optimization. In: Proceedings of 15th national conference on artificial intelligence (AAAI), pp 469\u2013476"},{"key":"557_CR5","unstructured":"Bonet J, Isbell CL, Viola P (1997) Mimic: finding optima by estimating probability densities. In: Advances in neural information processing systems, vol 9. MIT Press, Cambridge, pp 424\u2013430"},{"key":"557_CR6","doi-asserted-by":"crossref","unstructured":"Corno F, Reorda MS, Squillero G (1998a) A new evolutionary algorithm inspired by the selfish gene theory. In ICEC\u201998: IEEE international conference on evolutionary computation, pp 575\u2013580","DOI":"10.1145\/330560.330838"},{"key":"557_CR8","doi-asserted-by":"crossref","unstructured":"Corno F, Reorda M, Squillero G (1998b) The selfish gene algorithm: a new evolutionary optimization strategy. In SAC98: 13th annual ACM symposium on applied computing, Atlanta, pp 349\u2013355","DOI":"10.1145\/330560.330838"},{"key":"557_CR7","unstructured":"Cover TM, Thomas JA (2006) Elements of information theory, 2nd edn. Wiley series in telecommunications and signal processing. Wiley, New York"},{"key":"557_CR16","unstructured":"Dawkins R (1989) The selfish gene\u2014new edition. Oxford University Press, Oxford"},{"key":"557_CR10","unstructured":"Harik G (1999) Linkage learning via probabilistic modeling in the ecga. Technical report, University of Illinois at Urbana-Champaign"},{"issue":"4","key":"557_CR9","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1109\/4235.797971","volume":"3","author":"GR Harik","year":"1999","unstructured":"Harik GR, Lobo FG, Goldberg DE (1999) The compact genetic algorithm. IEEE Trans Evol Comput 3(4):287\u2013297","journal-title":"IEEE Trans Evol Comput"},{"key":"557_CR17","doi-asserted-by":"crossref","unstructured":"Harik GR, Lobo FG, Sastry K (2006) Linkage learning via probabilistic modeling in the extended compact genetic algorithm(ecga). In: Scalable optimization via probabilistic modeling, pp 39\u201361","DOI":"10.1007\/978-3-540-34954-9_3"},{"key":"557_CR21","doi-asserted-by":"crossref","unstructured":"Hong Y, Kwong S, Wang H, Xie ZH, Ren Q (2008) Svpcga: Selection on virtual population based compact genetic algorithm. In: IEEE Congress on evolutionary computation, pp 265\u2013272","DOI":"10.1109\/CEC.2008.4630809"},{"key":"557_CR12","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 (2002) Estimation of distribution algorithms: a new tool for evolutionary computation. Kluwer, Boston"},{"key":"557_CR11","unstructured":"Muhlenbein H, Paass G (1996) From recombination of genes to the estimation of distributions i. binary parameters. In PPSN IV: Proceedings of the 4th international conference on parallel problem solving from nature, London, pp 178\u2013187"},{"key":"557_CR14","unstructured":"Pelikan M, Muhlenbein H (1998) Marginal distribution in evolutionary algorithms. In In Proceedings of the international conference on genetic algorithms Mendel\u201998, pp 90\u201395"},{"key":"557_CR15","doi-asserted-by":"crossref","unstructured":"Pelikan M, Muhlenbein H (1999) The bivariate marginal distribution algorithm. In: Advances in soft computing: engineering design and manufacturing. Springer, London, pp 521\u2013535","DOI":"10.1007\/978-1-4471-0819-1_39"},{"key":"557_CR13","unstructured":"Pelikan M, Goldberg DE, Cantu-Paz E (1999) Boa: the bayesian optimization algorithm. In Proceedings of the genetic and evolutionary computation conference (GECCO-99). Morgan Kaufmann, pp 525\u2013532"},{"issue":"5","key":"557_CR20","doi-asserted-by":"crossref","first-page":"542","DOI":"10.1109\/TEVC.2007.913070","volume":"12","author":"S Yang","year":"2008","unstructured":"Yang S, Yao X (2008) Population-based incremental learning with associative memory for dynamic environments. IEEE Trans Evol Comput 12(5):542\u2013561","journal-title":"IEEE Trans Evol Comput"},{"issue":"4","key":"557_CR19","doi-asserted-by":"crossref","first-page":"1601","DOI":"10.1109\/TMAG.2006.892112","volume":"43","author":"SY Yang","year":"2007","unstructured":"Yang SY, Ho SL, Ni GZ, Machado JM, Wong KF (2007) A new implementation of population based incremental learning method for optimizations in electromagnetics. IEEE Trans Mag 43(4):1601\u20131604","journal-title":"IEEE Trans Mag"},{"key":"557_CR22","unstructured":"Yu T-L, Goldberg DE (2004) Dependency structure matrix analysis: offline utility of the dependency structure matrix genetic algorithm. In GECCO (2), pp 355\u2013366"},{"key":"557_CR23","unstructured":"Yu T-L, Sastry K, Goldberg DE, Pelikan M (2007) Population sizing for entropy-based model building in discrete estimation of distribution algorithms. In GECCO, pp 601\u2013608"},{"issue":"1","key":"557_CR24","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1109\/TEVC.2007.894202","volume":"12","author":"Q Zhang","year":"2008","unstructured":"Zhang Q, Zhou A, Jin Y (2008) Rm-meda: A regularity model-based multiobjective estimation of distribution algorithm. IEEE Trans Evol Comput 12(1):41\u201363","journal-title":"IEEE Trans Evol Comput"},{"issue":"2","key":"557_CR18","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1360\/aas-007-0113","volume":"33","author":"SD Zhou","year":"2007","unstructured":"Zhou SD, Sun ZQ (2007) A survey on estimation of distribution algorithms. Acta Autom Sin 33(2):113\u2013124","journal-title":"Acta Autom Sin"},{"key":"557_CR25","doi-asserted-by":"crossref","unstructured":"Zhou A, Zhang Q, Jin Y, Sendhoff B (2008) Combination of eda and de for continuous biobjective optimization. In: IEEE congress on evolutionary computation, pp 1447\u20131454","DOI":"10.1109\/CEC.2008.4630984"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-010-0557-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-010-0557-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-010-0557-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,30]],"date-time":"2023-05-30T05:16:29Z","timestamp":1685423789000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-010-0557-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,2,12]]},"references-count":25,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2011,5]]}},"alternative-id":["557"],"URL":"https:\/\/doi.org\/10.1007\/s00500-010-0557-3","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,2,12]]}}}