Christoph F. Eick: Thoughts on Designing Michigan-style Classifier Systems Thoughts on Selection Methods in Michigan-style Classifier Systems  When solving.

Slides:



Advertisements
Similar presentations
Welcome Sophomore Parents Were glad youre here! West Chicago Community High School District 94.
Advertisements

The Five Finger Method Who ? Wha t? How ? Whe re? Whe n? Wha t? Who ? Whe n? Whe re? How ? SAT Math – A Strategic Approach Rational Routes.
Tetris and Genetic Algorithms Math Club 5/30/2011.
On the Genetic Evolution of a Perfect Tic-Tac-Toe Strategy
1 Psych 5500/6500 Measures of Central Tendency Fall, 2008.
Tuesday, May 14 Genetic Algorithms Handouts: Lecture Notes Question: when should there be an additional review session?
EC: Lecture 17: Classifier Systems Ata Kaban University of Birmingham.
Programming 1 Feedback Session. The unit has improved my understanding of programming. 1.Strongly Agree 2.Agree 3.Neutral 4.Disagree 5.Strongly Disagree.
CS503: First Lecture, Fall 2008 Michael Barnathan.
Evolutionary Computation Application Peter Andras peter.andras/lectures.
Design of a Learning Classifier System for … … Distributed Max-Flow Algorithm Fault Detection.
CS Bayesian Learning1 Bayesian Learning. CS Bayesian Learning2 States, causes, hypotheses. Observations, effect, data. We need to reconcile.
Decision Making What? Art of choosing between two or more courses of action. Always there cannot be a correct decision but … better decision.
Decision Making. Decision making can be regarded as an outcome of mental processes leading to the selection of a course of action among several alternatives.
Discussion examples Andrea Zhok.
Christoph F. Eick: Applying EC to TSP(n) Example: Applying EC to the TSP Problem  Given: n cities including the cost of getting from on city to the other.
Technology in the Classroom: A View from the Trenchant Trenches.
Lecture 7 Page 1 CS 236 Online Password Management Limit login attempts Encrypt your passwords Protecting the password file Forgotten passwords Generating.
Introduction to Statistical Inferences
Thinking Actively in a Social Context T A S C.
CHAPTER 8 SOLVING PROBLEMS.
The Incredible 5 Point Scale February, 2011 A Simple Strategy.
Ch. Eick: Evolutionary Machine Learning Classifier Systems n According to Goldberg [113], a classifier system is “a machine learning system that learns.
Decision Making.
Genetic Algorithms CS121 Spring 2009 Richard Frankel Stanford University 1.
Slides are based on Negnevitsky, Pearson Education, Lecture 12 Hybrid intelligent systems: Evolutionary neural networks and fuzzy evolutionary systems.
Basketball Higher P.E. Structures & Strategies. Learning Objectives During the course of this lesson you will learn about: Methods of gathering data Methods.
Knowledge based Humans use heuristics a great deal in their problem solving. Of course, if the heuristic does fail, it is necessary for the problem solver.
GATree: Genetically Evolved Decision Trees 전자전기컴퓨터공학과 데이터베이스 연구실 G 김태종.
Ch. Eick: Evolutionary Machine Learning n Different Forms of Learning: Learning agent receives feedback with respect to its actions (e.g. from a teacher)
Design of a real time strategy game with a genetic AI By Bharat Ponnaluri.
Presenter: Chih-Yuan Chou GA-BASED ALGORITHMS FOR FINDING EQUILIBRIUM 1.
Eick: LCS-Review Bull-Paper Review1 1.Holland (1986): “Classifier systems … rule-based systems with general mechanisms to process rules in parallel, for.
GAs: why do they sometimes not work? n The coding moves the GA to operate on a different search space --- bad coding might deceive the GA or might slow.
Christoph F. Eick: Using EC to Solve Transportation Problems On Initialization and Mutation 1.Values t ij have to be between 0 and min(source(i),distination(j))
Christoph F. Eick: Using EC to Solve Transportation Problems Transportation Problems.
Ch. Eick: Evolutionary Machine Learning n Different Forms of Learning: Learning agent receives feedback with respect to its actions (e.g. from a teacher)
TIPS FOR ANSWERING LONGER ANSWER QUESTIONS Which command word is used? These tell you what to do. Explain, Describe, Discuss, Compare Check you know what.
Algorithms & FlowchartsLecture 10. Algorithm’s CONCEPT.
©2005, Pearson Education/Prentice Hall CHAPTER 2 Choosing Topics and Methods for Research.
Genetic Programming Part 2 Jay Shaffstall. Genetic Programming Review of Part 1 Program graphing Program breeding Program mutation Fitness functions Development.
Christoph Eick: Learning Models to Predict and Classify 1 Learning from Examples Example of Learning from Examples  Classification: Is car x a family.
Article Summary of The Structural Complexity of Software: An Experimental Test By Darcy, Kemerer, Slaughter and Tomayko In IEEE Transactions of Software.
CSIRO Insert presentation title, do not remove CSIRO from start of footer Experimental Design Why design? removal of technical variance Optimizing your.
Learning Classifier Systems (Introduction) Muhammad Iqbal Evolutionary Computation Research Group School of Engineering and Computer Science Victoria University.
Stacy Keyte EDCI 538 Dr. Stetson. Rules and Procedures What I learned:  I learned the difference between rules and procedures as well as the way to effectively.
How to write a Great Manifesto GCU Students’ Association Elections 2015.
Purple Finch Bird Feeder Digital Design Portfolio M. Francis Grade 9 Tech Ed.
Educational Methods The bag of tricks Direct Instruction/Lecture ä Advantages ä Teacher controlled ä Many objectives can be mastered in a short amount.
Brainstorm Brainstorming involves bringing a group of people together to generate many different ideas. 9 Communicate Results Design Process 2 Brainstorm.
Pen Turning on a Lathe Digital Design Portfolio M. Francis Grade 9 Tech Ed.
Christoph F. Eick: Thoughts on the Rook Project Challenges of Playing Bridge Well 
Practicum: Learning Object Design and Development Instructional Design for eLearning Instructor: Tanveer Makhani.
EuResist? EuResist is an international project designed to improve the treatment of HIV patients by developing a computerized system that can recommend.
Genetic Algorithms And other approaches for similar applications Optimization Techniques.
GENETIC ALGORITHM By Siti Rohajawati. Definition Genetic algorithms are sets of computational procedures that conceptually follow steps inspired by the.
 Presented By: Abdul Aziz Ghazi  Roll No:  Presented to: Sir Harris.
 Negnevitsky, Pearson Education, Lecture 12 Hybrid intelligent systems: Evolutionary neural networks and fuzzy evolutionary systems n Introduction.
Choosing a Major NOTE: To change the image on this slide, select the picture and delete it. Then click the Pictures icon in the placeholder to insert.
Password Management Limit login attempts Encrypt your passwords
WebQuest: Where you design your own Space Exploration Mission
The role of benefits communication
Example: Applying EC to the TSP Problem
Teaching Styles Learning Objectives:
Example: Applying EC to the TSP Problem
Example: Applying EC to the TSP Problem
Stat Mech of Non-Ideal Gases: Equations of State
How to Get Your Paper Rejected
Method Results Discussion
Thoughts Concerning the King+Rook_vs_Rook Problem
Presentation transcript:

Christoph F. Eick: Thoughts on Designing Michigan-style Classifier Systems Thoughts on Selection Methods in Michigan-style Classifier Systems  When solving optimization problems it is desirable to replace good solutions whereas in LCS replacing a very good classifier is quite dangerous, because the system’s real-time performance might drop significantly after a “few good” rules have been replaced.  Usually, the amount of change in LCS is significantly less compared to to EC systems that solve optimization problems, especially after the system has evolved over a certain amount of time, and the environment is somewhat stable.  Niche methods are much more attractive for LCS style system, because designing a classifier systems can be viewed as “finding a good set of collaborating rules; rules can be viewed as experts on what to do if a particular situation occurs”. You are looking for a team not super-fit individuals.  Coverage is another important aspect of classifier systems that does not exist in tradition EC systems: a rule set has to be evolved that covers many different situations. Having a few good rules with narrow expertise might result in a system that guesses for most inputs.

Christoph F. Eick: Thoughts on Designing Michigan-style Classifier Systems Other Problems in Designing Classifier Systems 1. What strength/fitness value should be given to new rules? Giving them average values or slightly below average values seems to be a good strategy. Another problem with new rules is that they might get deleted prior to being used often enough to evaluate their usefulness. 2. What about duplicate rules? No clear answer to this question. For example in systems in which decisions are made using voting redundancy is desirable. Moreover, redundancy makes it less likely that “good genetic material” is lost. On the other hand, copy of the same rule can produce a significant overhead and might reduce “situation coverage”. 3. How often should we learn, and how much change should we apply to the current rule-set if we learn? I am afraid that this is a question that can only answered empirically. 4. What should I do if there is no rule that covers a given input? Obviously, you do not know what action to take. Moreover, generating a new rule that covers this situation might not be a bad idea in an XCS-style system.

Christoph F. Eick: Thoughts on Designing Michigan-style Classifier Systems Other Problems in Designing Classifier Systems (cont.) 5. How should a generate my initial rule-set? What mutation operator should I use? Generate the don’t cares dependent on the rule-set size, the number of possible inputs, and how much coverage for a given input you might like to have. 6. How should actions be selected, if rules with different actions match the input? Many approaches are possible here including: random selection (might not be a bad strategy at the beginning of the evolution process), strength based (classifiers with higher past payoffs are preferred), accuracy based (classifiers whose performance is predictable are preferred), simple voting (each classifier has one vote), strength-weighted, accuracy-weighted,… voting,… 7. How should I evolve strength, fitness, and other values based on system feedback? In my opinion, the strategies employed in XCS seem to be a good choice. Initially, set your learning rate between 0.1 and 0.3 and adjust it based on experimental results. In general, if the experiment is short or the environment is changing a lot higher learning rates are useful.

Christoph F. Eick: Thoughts on Designing Michigan-style Classifier Systems Other Problems in Designing Classifier Systems (cont.)  The learning period seems to be short for my system to learn something; what should I do? Either adjust your system parameters, or if you demonstrate that the performance of your system improves over longer learning (e.g. you ran it for 4x1200 examples) periods this is also good enough for the course project.  How complex should the system be a should I design? Don’t make your system to complicated unless you are a very fast programmer, because this will give you enough time for fine tuning based on experimental results. Moreover, if you understand what your system is doing, it might be easier to enhance it.  Do I have to write a large report? No just a short description of the strategies your system employs is sufficient.