메뉴 건너뛰기




Volumn 16, Issue 3, 2006, Pages 239-249

A Markov Chain Monte Carlo version of the genetic algorithm Differential Evolution: Easy Bayesian computing for real parameter spaces

Author keywords

Block updating; Evolutionary Monte Carlo; Metropolis algorithm; Population Markov Chain Monte Carlo; Simulated Annealing; Simulated Tempering; Theophylline Kinetics

Indexed keywords


EID: 33745603720     PISSN: 09603174     EISSN: None     Source Type: Journal    
DOI: 10.1007/s11222-006-8769-1     Document Type: Article
Times cited : (851)

References (26)
  • 3
    • 0002388372 scopus 로고    scopus 로고
    • Strategies for improving MCMC
    • Gilks W. R., Richardson S. and Spiegelhalter D. J., (eds.), London, Chapman & Hall
    • Gilks W. R. and Roberts G. O.1996. Strategies for improving MCMC. In Markov chain monte carlo in practice. Gilks W. R., Richardson S. and Spiegelhalter D. J., (eds.), London, Chapman & Hall, pp. 89-114.
    • (1996) Markov Chain Monte Carlo in Practice , pp. 89-114
    • Gilks, W.R.1    Roberts, G.O.2
  • 5
    • 0038563932 scopus 로고    scopus 로고
    • An adaptive Metropolis algorithm
    • Haario H., Saksman E. and Tamminen J. 2001. An adaptive Metropolis algorithm. Bernoulli 7: 223-242.
    • (2001) Bernoulli , vol.7 , pp. 223-242
    • Haario, H.1    Saksman, E.2    Tamminen, J.3
  • 7
    • 0011861529 scopus 로고    scopus 로고
    • On stagnation of the Differential Evolution algorithm
    • 6th International Mendel Conference on Soft Computing, Brno
    • Lampinen J. and Zelinka I. 2000. On stagnation of the Differential Evolution algorithm. Proceedings of MENDEL 2000, 6th International Mendel Conference on Soft Computing, Brno, pp. 76-83.
    • (2000) Proceedings of MENDEL 2000 , pp. 76-83
    • Lampinen, J.1    Zelinka, I.2
  • 8
    • 0037266164 scopus 로고    scopus 로고
    • Population markov chain monte carlo
    • Laskey K. B. and Myers J. W. 2003. Population Markov Chain Monte Carlo. Machine Learning 50: 175-196.
    • (2003) Machine Learning , vol.50 , pp. 175-196
    • Laskey, K.B.1    Myers, J.W.2
  • 9
    • 0036744537 scopus 로고    scopus 로고
    • Dynamically weighted importance sampling in Monte Carlo computation
    • Liang F. 2002. Dynamically weighted importance sampling in Monte Carlo computation. Journal of the American Statistical Association 97: 807-821.
    • (2002) Journal of the American Statistical Association , vol.97 , pp. 807-821
    • Liang, F.1
  • 10
    • 1542573405 scopus 로고    scopus 로고
    • Real-parameter evolutionary Monte Carlo with applications to Bayesian mixture models
    • Liang F. M. and Wong W. H. 2001. Real-parameter evolutionary Monte Carlo with applications to Bayesian mixture models. Journal of the American Statistical Association 96: 653-666.
    • (2001) Journal of the American Statistical Association , vol.96 , pp. 653-666
    • Liang, F.M.1    Wong, W.H.2
  • 12
    • 0006407254 scopus 로고    scopus 로고
    • WinBUGS - A Bayesian modelling framework: Concepts, structure, and extensibility
    • Lunn D. J., Thomas A., Best N. and Spiegelhalter D. 2000. WinBUGS - A Bayesian modelling framework: Concepts, structure, and extensibility. Statistics and Computing 10: 325-337.
    • (2000) Statistics and Computing , vol.10 , pp. 325-337
    • Lunn, D.J.1    Thomas, A.2    Best, N.3    Spiegelhalter, D.4
  • 13
    • 11244283143 scopus 로고    scopus 로고
    • IID sampling using self-avoiding population Monte Carlo: The pinball sampler
    • Bernardo J. M., Bayarri M. J., Berger J. O., Dawid A. P., Heckerman D., Smith A. F. M. and West M. (eds.), Oxford, Clarendon Press
    • Mengersen K. and Robert C. P. 2003. IID sampling using self-avoiding population Monte Carlo: the pinball sampler. In Bernardo J. M., Bayarri M. J., Berger J. O., Dawid A. P., Heckerman D., Smith A. F. M. and West M. (eds.), Bayesian Statistics 7, Oxford, Clarendon Press, pp. 277-292.
    • (2003) Bayesian Statistics , vol.7 , pp. 277-292
    • Mengersen, K.1    Robert, C.P.2
  • 14
    • 0030551974 scopus 로고    scopus 로고
    • Rates of convergence of the Hastings and Metropolis algorithms
    • Mengersen K. L. and Tweedie R. L. 1996. Rates of convergence of the Hastings and Metropolis algorithms. Annals of Statistics 24: 101-121.
    • (1996) Annals of Statistics , vol.24 , pp. 101-121
    • Mengersen, K.L.1    Tweedie, R.L.2
  • 16
    • 0042163579 scopus 로고    scopus 로고
    • An introduction to differential evolution
    • Corne D., Dorigo M. and Glover F. (eds.), London, McGraw-Hill
    • Price K. 1999. An introduction to differential evolution. In Corne D., Dorigo M. and Glover F. (eds.), New Ideas in Optimization, London, McGraw-Hill, pp. 79-108.
    • (1999) New Ideas in Optimization , pp. 79-108
    • Price, K.1
  • 17
    • 0003054892 scopus 로고    scopus 로고
    • Differential evolution
    • Price K. and Storn R. 1997. Differential Evolution. Dr Dobb's Journal 264: 18-24.
    • (1997) Dr Dobb's Journal , vol.264 , pp. 18-24
    • Price, K.1    Storn, R.2
  • 18
    • 1842607847 scopus 로고    scopus 로고
    • Vienna, Austria, R Foundation for Statistical Computing
    • R Development Core Team 2003. R: A language and environment for statistical computing. Vienna, Austria, R Foundation for Statistical Computing, www.r-project.org.
    • (2003) R: A Language and Environment for Statistical Computing
  • 20
    • 0013037129 scopus 로고    scopus 로고
    • Optimal scaling for various Metropolis-Hastings algorithms
    • Roberts G. O. and Rosenthal J. S. 2001. Optimal scaling for various Metropolis-Hastings algorithms. Statistical Science 16: 351-367.
    • (2001) Statistical Science , vol.16 , pp. 351-367
    • Roberts, G.O.1    Rosenthal, J.S.2
  • 21
    • 0242440265 scopus 로고    scopus 로고
    • Theory of genetic algorithms II: Models for genetic operators over string-tensor representation of populations and convergence to global optima for arbitrary fitness function under scaling
    • Schmitt L. M. 2004. Theory of genetic algorithms II: models for genetic operators over string-tensor representation of populations and convergence to global optima for arbitrary fitness function under scaling. Theoretical Computer Science 310: 181-231.
    • (2004) Theoretical Computer Science , vol.310 , pp. 181-231
    • Schmitt, L.M.1
  • 24
    • 0142000477 scopus 로고    scopus 로고
    • Differential Evolution - A simple and efficient heuristic for global optimization over continuous spaces
    • Storn R. and Price K. 1997. Differential Evolution - a simple and efficient heuristic for global optimization over continuous spaces. Journal of Global Optimisation 11: 341-359.
    • (1997) Journal of Global Optimisation , vol.11 , pp. 341-359
    • Storn, R.1    Price, K.2
  • 26
    • 0035297748 scopus 로고    scopus 로고
    • A tutorial on reversible jump MCMC with a view toward applications in QTL-mapping
    • Waagepetersen R. and Sorensen D. 2001. A tutorial on reversible jump MCMC with a view toward applications in QTL-mapping. International Statistical Review 69: 49-61.
    • (2001) International Statistical Review , vol.69 , pp. 49-61
    • Waagepetersen, R.1    Sorensen, D.2


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