首页    期刊浏览 2024年11月24日 星期日
登录注册

文章基本信息

  • 标题:Why are Clonal Selection Algorithms Markov?
  • 本地全文:下载
  • 作者:Khiria E . El-Nady ; Usama H. Abou El-Enien ; Amr A. Badr
  • 期刊名称:Interstat
  • 印刷版ISSN:1941-689X
  • 出版年度:2010
  • 期号:APR
  • 出版社:Virginia Tech
  • 摘要:

    Clonal selection algorithms are considered. Two algorithms are designed and executed to obtain purely empirical analysis conclusions in order to turn to purely theoretical analysis results about the behavior of clonal selection algorithms as a finite dimensional Markov and lumped Markov chains, which confirm the conjectures from these experiments and in order to introduce a complete framework toward a new philosophy of machine intelligence. First, we model clonal selection algorithms using a finite dimensional Markov and lumped Markov chains. Second, we carry on a particle analysis (the basic component) and analyze the convergence properties of these algorithms. Third, we produce two unified Markov and lumped Markov approaches for analysis for a complete framework and propose unique chromosomes for a purely successful optimization of these algorithms. Furthermore, for the Markov approach, we obtain purely theoretical analysis for a classification and Stationary distributions of chains. For the lumped Markov approach, we obtain purely theoretical analysis for all possible conditional multivariate normal distributions of transition probability matrices and stationary multivariate normal distributions of chains.

  • 关键词:Clonal selection algorithms; lumped Markov chains; Classification; central limit theorem; Stationary multivariate normal distribution; Unique chromosomes
国家哲学社会科学文献中心版权所有