Why Are Clonal Selection Algorithms Markov?

by Khiria E . El-Nady, Usama H. Abou El-Enien, and Amr A. Badr.

Abstract: 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.

Key Words: Clonal selection algorithms, lumped Markov chains, Classification, central limit theorem, Stationary multivariate normal distribution, Unique chromosomes

Khiria E . El-Nady, pr_dr_kh_elnady@yahoo.com
Usama H. Abou El-Enien, ossama.hanafy77@gmail.com
Amr A. Badr, pr.dr.a.badr@gmail.com

Editor: Di Lorenzo, Renato, rdlea@libero.it

READING THE ARTICLE: You can read the article in portable document (.pdf) format (160675 bytes.)

NOTE: The content of this article is the intellectual property of the authors, who retains all rights to future publication.

This page has been accessed 1708 times since APRIL 22, 2010.

Return to the InterStat Home Page.