{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,24]],"date-time":"2025-03-24T06:54:59Z","timestamp":1742799299808},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540410560"},{"type":"electronic","value":"9783540453567"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-45356-3_77","type":"book-chapter","created":{"date-parts":[[2007,8,28]],"date-time":"2007-08-28T23:33:28Z","timestamp":1188344008000},"page":"787-796","source":"Crossref","is-referenced-by-count":9,"title":["A Factorized Distribution Algorithm Using Single Connected Bayesian Networks"],"prefix":"10.1007","author":[{"given":"Alberto","family":"Ochoa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Heinz","family":"Muehlenbein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marta","family":"Soto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"77_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/BFb0035946","volume-title":"Advances in Intelligent Computing","author":"S. Acid","year":"1995","unstructured":"S. Acid, L. M. de Campos. (1995). Approximations of causal networks by polytrees: an empirical study. Advances in Intelligent Computing. 149\u2013158. B. Bouchon-Meunier, R. R. Yager, L. A. Zadeh. Lecture Notes in Computer Science 945. Springer Verlag, Berlin."},{"key":"77_CR2","unstructured":"S. Baluja and S. Davies. (1997). Using Optimal Dependency-Trees for Combinatorial Optimization: Learning the structure of the Search Space, (Carnegie Mellon Report, CMU-CS-97-107, 1997a)."},{"key":"77_CR3","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1109\/TIT.1968.1054142","volume":"14","author":"C. K. Chow","year":"1968","unstructured":"C. K. Chow, C. N. Liu. (1968). Approximating discrete probability distribution with dependence trees. IEEE Transantions on Information Theory 14. 462\u2013467.","journal-title":"IEEE Transantions on Information Theory"},{"key":"77_CR4","unstructured":"L. M. de Campos. (1998). Independency relationships and learning algorithms for singly connected networks. Journal of Experimental and Theoretical Ar-tifiacial Intelligence. 511\u2013549. (Also DECSAI-TR-960204)."},{"key":"77_CR5","unstructured":"J.S. De Bonet, C. L. Isbell, and P. Viola. (1997) MIMIC: Finding Optima by Estimating Probability Densities, in M. Jordan and Th. Petsche, eds, Advances in Neural Information Processing Systems, Vol. 9. 424\u2013431."},{"key":"77_CR6","unstructured":"R. Etxeberria, P. Larranaga. (1999). Global optimization using Bayesian networks. CIMAF 1999, Second International Symposium on Artificial Intelligence, Adaptive Systems. 332\u2013339."},{"key":"77_CR7","unstructured":"I. J. Good. (1965). The estimation of probabilities. MIT Press."},{"key":"77_CR8","first-page":"317","volume":"2","author":"M. Henrion","year":"1988","unstructured":"M. Henrion. (1988). Propagating uncertainty in Bayesian networks by probabilistic logic sampling. Uncertainty in Artificial Intelligence 2. 317\u2013324.","journal-title":"Uncertainty in Artificial Intelligence"},{"key":"77_CR9","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1162\/evco.1997.5.3.303","volume":"5","author":"H. Muehlenbein","year":"1997","unstructured":"H. Muehlenbein. (1997). The equation for response to selection and its use for prediction. Evolutionary Computation 5. 303\u2013346.","journal-title":"Evolutionary Computation"},{"key":"77_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/3-540-61723-X_982","volume-title":"Parallel Problem Solving from Nature-PPSN IV","author":"H. Muehlenbein","year":"1996","unstructured":"H. Muehlenbein, G. Pass. (1996). From recombination of genes to estimation of distribution I. Binay parameters. Lecture Notes in Computer Science 1411. Parallel Problem Solving from Nature-PPSN IV. 178\u2013187."},{"issue":"2","key":"77_CR11","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1023\/A:1009689913453","volume":"5","author":"H. Muehlenbein","year":"1999","unstructured":"H. Muehlenbein, T. Mahnig, A. Ochoa. (1999). Schemata, distributions and graphical models in evolutionay optimization. Journal of Heuristics 5(2). 215\u2013247.","journal-title":"Journal of Heuristics"},{"issue":"4","key":"77_CR12","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1162\/evco.1999.7.4.353","volume":"7","author":"H. Muehlenbein","year":"1999","unstructured":"H. Muehlenbein, T. Mahnig. (1999). FDA: A scalable evolutionary algorithm for the optimization of additively decomposed functions. Evolutionary Computation 7(4). 353\u2013376.","journal-title":"Evolutionary Computation"},{"key":"77_CR13","first-page":"137","volume-title":"Theoretical Aspects of Evolutionary Computing","author":"H. Muehlenbein","year":"2000","unstructured":"H. Muehlenbein, Th. Mahnig. (2000). Evolutionary Algorithms: From Recombination to Search Distributions. in: Theoretical Aspects of Evolutionary Computing. eds. L. Kallel, B. Naudts, A. Rogers, 137\u2013176. Springer Verlag Berlin."},{"key":"77_CR14","unstructured":"A. Ochoa, M. Soto, R. Santana, J. C. Madera, N. Jorge. (1999). The factorized distribution algorithm and the junction tree: a learning perspective. CIMAF 1999, Second International Symposium on Artificial Intelligence, Adaptive Systems. 368\u2013377."},{"key":"77_CR15","unstructured":"J. Pearl. (1988). Probabilistic reasoning in intelligent systems: networks of plausible inference. Ronald J. Brachman (AT&T Bell Laboratories). Morgan and Kaufmann."},{"key":"77_CR16","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1007\/978-1-4471-0819-1_39","volume-title":"Advances in Soft Computing-Engineering Design and Manufacturing","author":"M. Pelican","year":"1999","unstructured":"M. Pelican, H. Muehlenbein. (1999). BMDA: The Bivariate Marginal Distribution Algorithm, in R. Roy, T. Furuhashi, P, K. Chandhory eds., Advances in Soft Computing-Engineering Design and Manufacturing, (1999), London: Springer Verlag, 521\u2013535."},{"key":"77_CR17","first-page":"525","volume":"1","author":"M. Pelican","year":"1999","unstructured":"M. Pelican, D. E. Goldberg, E. Cantu-Paz. (1999). BOA: The Bayesian optimization algorithm. Proceedings of the Genetic and Evolutionary Computation Conference GECCO-99 1. 525\u2013532.","journal-title":"Proceedings of the Genetic and Evolutionary Computation Conference GECCO-99"},{"key":"77_CR18","unstructured":"M. Soto, A. Ochoa, S. Acid, L. M. de Campos.(1999). Introducing the poly-tree aproximation distribution algorithm. CIMAF 1999, Second International Symposium on Artificial Intelligence, Adaptive Systems. 360\u2013367."}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature PPSN VI"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45356-3_77","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,13]],"date-time":"2023-05-13T19:11:44Z","timestamp":1684005104000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45356-3_77"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540410560","9783540453567"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-45356-3_77","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}