메뉴 건너뛰기




Volumn 1917, Issue , 2000, Pages 787-796

A factorized distribution algorithm using single connected Bayesian networks

Author keywords

[No Author keywords available]

Indexed keywords

POPULATION STATISTICS;

EID: 23044524193     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45356-3_77     Document Type: Conference Paper
Times cited : (10)

References (18)
  • 1
    • 84927733112 scopus 로고
    • Approximations of causal networks by polytrees: An empirical study
    • B. Bouchon-Meunier, R. R. Yager, L. A. Zadeh. Lecture Notes in Computer Science, Springer Verlag, Berlin
    • S. Acid, L. M. de Campos. (1995). Approximations of causal networks by polytrees: an empirical study. Advances in Intelligent Computing. 149-158. B. Bouchon-Meunier, R. R. Yager, L. A. Zadeh. Lecture Notes in Computer Science 945. Springer Verlag, Berlin.
    • (1995) Advances in Intelligent Computing , vol.945 , pp. 149-158
    • Acid, S.1    De Campos, L.M.2
  • 3
    • 84933530882 scopus 로고
    • Approximating discrete probability distribution with dependence trees
    • C. K. Chow, C. N. Liu. (1968). Approximating discrete probability distribution with dependence trees. IEEE Transantions on Information Theory 14. 462-467.
    • (1968) IEEE Transantions on Information Theory , vol.14 , pp. 462-467
    • Chow, C.K.1    Liu, C.N.2
  • 4
    • 0542396542 scopus 로고    scopus 로고
    • Independency relationships and learning algorithms for singly connected networks
    • (Also DECSAI- TR-960204)
    • L. M. de Campos. (1998). Independency relationships and learning algorithms for singly connected networks. Journal of Experimental and Theoretical Ar-tifiacial Intelligence. 511-549. (Also DECSAI- TR-960204).
    • (1998) Journal of Experimental and Theoretical Ar-Tifiacial Intelligence , pp. 511-549
    • De Campos, L.M.1
  • 5
    • 78049265488 scopus 로고    scopus 로고
    • MIMIC: Finding Optima by Estimating Probability Densities
    • in M. Jordan and Th. Petsche
    • 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-431.
    • (1997) Advances in Neural Information Processing Systems , vol.9 , pp. 424-431
    • De Bonet, J.S.1    Isbell, C.L.2    Viola, P.3
  • 8
    • 0001247275 scopus 로고
    • Propagating uncertainty in Bayesian networks by probabilistic logic sampling
    • M. Henrion. (1988). Propagating uncertainty in Bayesian networks by probabilistic logic sampling. Uncertainty in Artificial Intelligence 2. 317-324.
    • (1988) Uncertainty in Artificial Intelligence , vol.2 , pp. 317-324
    • Henrion, M.1
  • 9
    • 0031215849 scopus 로고    scopus 로고
    • The equation for response to selection and its use for prediction
    • H. Muehlenbein. (1997). The equation for response to selection and its use for prediction. Evolutionary Computation 5. 303-346.
    • (1997) Evolutionary Computation , vol.5 , pp. 303-346
    • Muehlenbein, H.1
  • 10
    • 84958959530 scopus 로고    scopus 로고
    • From recombination of genes to estimation of distribution I. Binay parameters. Lecture Notes in Computer Science 1411
    • 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-187.
    • (1996) Parallel Problem Solving from Nature-Ppsn IV , pp. 178-187
    • Muehlenbein, H.1    Pass, G.2
  • 11
    • 0345504778 scopus 로고    scopus 로고
    • Schemata, distributions and graphical models in evolutionay optimization
    • H. Muehlenbein, T. Mahnig, A. Ochoa. (1999). Schemata, distributions and graphical models in evolutionay optimization. Journal of Heuristics 5(2). 215-247.
    • (1999) Journal of Heuristics , vol.5 , Issue.2 , pp. 215-247
    • Muehlenbein, H.1    Mahnig, T.2    Ochoa, A.3
  • 12
    • 0033258156 scopus 로고    scopus 로고
    • FDA: A scalable evolutionary algorithm for the optimization of additively decomposed functions
    • H. Muehlenbein, T. Mahnig. (1999). FDA: A scalable evolutionary algorithm for the optimization of additively decomposed functions. Evolutionary Computation 7(4). 353-376.
    • (1999) Evolutionary Computation , vol.7 , Issue.4 , pp. 353-376
    • Muehlenbein, H.1    Mahnig, T.2
  • 13
    • 0002932917 scopus 로고    scopus 로고
    • Evolutionary Algorithms: From Recombination to Search Distributions
    • eds. L. Kallel, B. Naudts, A. Rogers, Springer Verlag Berlin
    • 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-176. Springer Verlag Berlin.
    • (2000) Theoretical Aspects of Evolutionary Computing , pp. 137-176
    • Muehlenbein, H.1    Mahnig, T.H.2
  • 16
    • 0001787552 scopus 로고    scopus 로고
    • BMDA: The Bivariate Marginal Distribution Algorithm
    • in R. Roy, T. Furuhashi, P, K. Chandhory eds., London:Springer Verlag
    • 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-535.
    • (1999) Advances in Soft Computing-Engineering Design and Manufacturing, (1999) , pp. 521-535
    • Pelican, M.1    Muehlenbein, H.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.