{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,24]],"date-time":"2025-04-24T05:26:37Z","timestamp":1745472397861,"version":"3.28.0"},"reference-count":31,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012,6]]},"DOI":"10.1109\/cec.2012.6252963","type":"proceedings-article","created":{"date-parts":[[2012,8,6]],"date-time":"2012-08-06T16:51:10Z","timestamp":1344271870000},"page":"1-8","source":"Crossref","is-referenced-by-count":18,"title":["Structural transfer using EDAs: An application to multi-marker tagging SNP selection"],"prefix":"10.1109","author":[{"given":"Roberto","family":"Santana","sequence":"first","affiliation":[]},{"given":"Alexander","family":"Mendiburu","sequence":"additional","affiliation":[]},{"given":"Jose A.","family":"Lozano","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1038\/sj.ejhg.5201751"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1007\/s00439-006-0182-5"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1101\/gr.4138406"},{"key":"15","doi-asserted-by":"crossref","first-page":"567","DOI":"10.1007\/978-3-540-45167-9_41","article-title":"Exploiting task relatedness for multiple task learning","author":"ben-david","year":"2003","journal-title":"Learning Theory and Kernel Machines"},{"key":"16","first-page":"30","article-title":"Using optimal dependency-trees for combinatorial optimization: Learning the structure of the search space","author":"baluja","year":"1997","journal-title":"Proceedings of the 14th International Conference on Machine Learning"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1023\/A:1007379606734"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-5529-2"},{"key":"11","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1007\/978-3-540-74976-9_23","article-title":"Domain adaptation of conditional probability models via feature subsetting","author":"satpal","year":"2007","journal-title":"Proceeding of the Knowledge Discovery in Databases Conference PKDD-2007"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1145\/1273496.1273507"},{"key":"21","first-page":"213","article-title":"Schemata, distributions and graphical models in evolutionary optimization","volume":"5","author":"mu?hlenbein","year":"1999","journal-title":"Journal of Heuristics"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1101\/gr.5741407"},{"key":"22","first-page":"368","article-title":"The factorized distribution algorithm and the junction tree: A learning perspective","author":"ochoa","year":"1999","journal-title":"Proceedings of the Second Symposium on Artificial Intelligence (CIMAF-99)"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-34954-9_9"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-71783-6_24"},{"key":"25","doi-asserted-by":"publisher","DOI":"10.1145\/1389095.1389172"},{"journal-title":"Network Measures for Re-using Problem Information in EDAs","year":"2010","author":"santana","key":"26"},{"key":"27","article-title":"Network measures for information extraction and transfer learning in evolutionary algorithms","author":"santana","year":"2011","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"28","doi-asserted-by":"publisher","DOI":"10.1111\/j.1469-1809.2008.00457.x"},{"key":"29","doi-asserted-by":"publisher","DOI":"10.1126\/science.296.5566.261b"},{"key":"3","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1007\/3-540-61723-X_982","article-title":"From recombination of genes to the estimation of distributions I. Binary parameters","volume":"1141","author":"mu?hlenbein","year":"1996","journal-title":"Lectures Notes in Computer Science"},{"key":"2","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-32494-1","author":"lozano","year":"2006","journal-title":"Towards a New Evolutionary Computation Advances on Estimation of Distribution Algorithms"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1145\/1538902.1538906"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-1539-5"},{"key":"30","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pgen.0020215"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1016\/S0378-3758(00)00115-4"},{"key":"6","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1007\/978-3-540-74976-9_31","article-title":"Bridged refinement for transfer learning","author":"xing","year":"2007","journal-title":"Proceeding of the Knowledge Discovery in Databases Conference PKDD-2007"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2009.191"},{"key":"31","doi-asserted-by":"publisher","DOI":"10.1038\/nature06258"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1016\/j.artmed.2010.05.010"},{"key":"9","first-page":"1633","article-title":"Transfer learning for reinforcement learning domains: A survey","volume":"10","author":"taylor","year":"2009","journal-title":"The Journal of Machine Learning Research"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1145\/1390156.1390182"}],"event":{"name":"2012 IEEE Congress on Evolutionary Computation (CEC)","start":{"date-parts":[[2012,6,10]]},"location":"Brisbane, Australia","end":{"date-parts":[[2012,6,15]]}},"container-title":["2012 IEEE Congress on Evolutionary Computation"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6241678\/6252855\/06252963.pdf?arnumber=6252963","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,20]],"date-time":"2017-06-20T18:31:03Z","timestamp":1497983463000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6252963\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,6]]},"references-count":31,"URL":"https:\/\/doi.org\/10.1109\/cec.2012.6252963","relation":{},"subject":[],"published":{"date-parts":[[2012,6]]}}}