CULTURAL ALGORITHMS A TUTORIAL - Artificial Intelligence 文化算法教程-人工智能.ppt

CULTURAL ALGORITHMS:A TUTORIAL DR. ROBERT G. REYNOLDS WAYNE STATE UNIVERSITY DETROIT, MICHIGAN OUTLINE I. Ideational Theories of Cultural Evolution II. Cultural Algorithms: A Computational Framework III. General Features IV. Suitable Problems V. Designing Cultural Algorithms Embedding a weak method into the Cultural Algorithm Framework: A Genetic Algorithm Example IV. Example Applications V. Future Directions Ideational Approaches to Cultural Evolution Ideational Approaches Continued General Features Suitable Problems II. Designing Cultural Algorithms Designing Cultural Algorithms: Embedding a Weak Method The Genetic Algorithm(Davis,1991) A Classification Problem Classification Example A Construction Problem Population Component Adding Constraint Knowledge Cultural Algorithm Configuration: Embedding Other Methods Knowledge Models Used Evolution of the State Future Directions A Selected Bibliography of Cultural Algorithms Comparison: Genetic Algorithms Often population model has an inherent knowledge structure associated with it. Genetic Algorithms exploit schemata. The VGA model described earlier is nothing more than the explicit use of binary schemata to guide the generation of examples by the Genetic Algorithm population. Exploits building blocks. In hierarchical problems building blocks at one level can be exploited and combined at the next level. Need to allow our representation scheme to emerge based upon the level of complexity achieved in the mined building blocks. Once we acquire building blocks at one level we can Re-size the version space to exploit them Can move up and down the hierarchy of bases depending Upon how well two adjacent bases do. REAL-VALUED SCHEMA IN THE BELIEF SPACE Domain Range constraints Mutation Influence Function for Interval Schemata With the addition of constraint knowledge, n one dimensional interval schemata are combined to produce an n-dimensional region. Regional schemata result from imposing a gr