Design of a Learning Classifier System for … … Distributed Max-Flow Algorithm Fault Detection.

Slides:



Advertisements
Similar presentations
Rules, page 1 CSI 4106, Winter 2005 Representing knowledge with rules Points Definitions Production systems Conflict resolution strategies Examples A financial.
Advertisements

The Scientific Method.
1 Hypothesis Testing Chapter 8 of Howell How do we know when we can generalize our research findings? External validity must be good must have statistical.
Genetic Programming: Hypothesis Evolution By Nam Nguyen Greg Nelson.
Evaluating Diagnostic Accuracy of Prostate Cancer Using Bayesian Analysis Part of an Undergraduate Research course Chantal D. Larose.
SBSE Course 3. EA applications to SE Analysis Design Implementation Testing Reference: Evolutionary Computing in Search-Based Software Engineering Leo.
Biologically Inspired AI (mostly GAs). Some Examples of Biologically Inspired Computation Neural networks Evolutionary computation (e.g., genetic algorithms)
Termination Detection. Goal Study the development of a protocol for termination detection with the help of invariants.
Integrating Bayesian Networks and Simpson’s Paradox in Data Mining Alex Freitas University of Kent Ken McGarry University of Sunderland.
Mechanics of Genetic Programming
Evaluation.
Learning Classifier Systems to Intrusion Detection Monu Bambroo 12/01/03.
An LCS for Stock Market Analysis Christopher Mark Gore Computer Science 401 Evolutionary Computation.
1 The Basics of Regression Regression is a statistical technique that can ultimately be used for forecasting.
Decision Trees Chapter 18 From Data to Knowledge.
Statement of the Problem Goal Establishes Setting of the Problem hypothesis Additional information to comprehend fully the meaning of the problem scopedefinitionsassumptions.
Experimental Evaluation
Introduction to Computer Technology
Cover Letters for Survey Research Studies
Computer Vision Lecture 8 Performance Evaluation.
EVALUATION David Kauchak CS 451 – Fall Admin Assignment 3 - change constructor to take zero parameters - instead, in the train method, call getFeatureIndices()
Genetic Algorithm.
Chapter 16 Can Computers Think (now or in the future)? Can Computers Think (now or in the future)?
Theory Revision Chris Murphy. The Problem Sometimes we: – Have theories for existing data that do not match new data – Do not want to repeat learning.
Intro. ANN & Fuzzy Systems Lecture 36 GENETIC ALGORITHM (1)
Data Mining – Algorithms: Prism – Learning Rules via Separating and Covering Chapter 4, Section 4.4.
Boltzmann Machine (BM) (§6.4) Hopfield model + hidden nodes + simulated annealing BM Architecture –a set of visible nodes: nodes can be accessed from outside.
Experimental Evaluation of Learning Algorithms Part 1.
Fault Detection Sathish S. Vadhiyar Source/Credits: From Referenced Papers.
 2003, G.Tecuci, Learning Agents Laboratory 1 Learning Agents Laboratory Computer Science Department George Mason University Prof. Gheorghe Tecuci 5.
Problem Solving Techniques. Compiler n Is a computer program whose purpose is to take a description of a desired program coded in a programming language.
1 Chapter 10: Introduction to Inference. 2 Inference Inference is the statistical process by which we use information collected from a sample to infer.
CSC 211 Data Structures Lecture 13
Confidence intervals and hypothesis testing Petter Mostad
Agenda Fail Stop Processors –Problem Definition –Implementation with reliable stable storage –Implementation without reliable stable storage Failure Detection.
CS294, Yelick Consensus revisited, p1 CS Consensus Revisited
Using Social Network Analysis Methods for the Prediction of Faulty Components Gholamreza Safi.
AP Statistics Semester One Review Part 2 Chapters 4-6 Semester One Review Part 2 Chapters 4-6.
Finding frequent and interesting triples in text Janez Brank, Dunja Mladenić, Marko Grobelnik Jožef Stefan Institute, Ljubljana, Slovenia.
Franciszek Seredynski, Damian Kurdej Polish Academy of Sciences and Polish-Japanese Institute of Information Technology APPLYING LEARNING CLASSIFIER SYSTEMS.
Change Analysis in Spatial Datasets by Interestingness Comparison Vadeerat Rinsurongkawong, and Christoph F. Eick Department of Computer Science, University.
Automatic Discovery and Processing of EEG Cohorts from Clinical Records Mission: Enable comparative research by automatically uncovering clinical knowledge.
Using Bayesian Nets to Predict Software Defects in Arbitrary Software Lifecycles Martin Neil Agena Ltd London, UK Web:
T Test for Two Independent Samples. t test for two independent samples Basic Assumptions Independent samples are not paired with other observations Null.
CSCI 347, Data Mining Evaluation: Training and Testing, Section 5.1, pages
Probabilistic Model-Driven Recovery in Distributed Systems Kaustubh R. Joshi, Matti A. Hiltunen, William H. Sanders, and Richard D. Schlichting May 2,
Software Quality Assurance and Testing Fazal Rehman Shamil.
Sai Zhang Michael D. Ernst Google Research University of Washington
CSE SW Metrics and Quality Engineering Copyright © , Dennis J. Frailey, All Rights Reserved CSE8314M13 8/20/2001Slide 1 SMU CSE 8314 /
Bootstrapped Optimistic Algorithm for Tree Construction
Copyright , Dennis J. Frailey CSE Software Measurement and Quality Engineering CSE8314 M00 - Version 7.09 SMU CSE 8314 Software Measurement.
Genetic Algorithm Dr. Md. Al-amin Bhuiyan Professor, Dept. of CSE Jahangirnagar University.
Machine Learning in Practice Lecture 9 Carolyn Penstein Rosé Language Technologies Institute/ Human-Computer Interaction Institute.
240 Battle of the Critical thinker – Took many electives Effective Writer – Took college writing Able to learn and apply knowledge – Took major requirements/
Christoph F. Eick: Thoughts on Designing Michigan-style Classifier Systems Thoughts on Selection Methods in Michigan-style Classifier Systems  When solving.
Sampling Distributions Chapter 18. Sampling Distributions A parameter is a number that describes the population. In statistical practice, the value of.
Genetic Programming. What is Genetic Programming? GP for Symbolic Regression Other Representations for GP Example of GP for Knowledge Discovery Outline.
Test Loads Andy Wang CIS Computer Systems Performance Analysis.
Machine Learning in Practice Lecture 9 Carolyn Penstein Rosé Language Technologies Institute/ Human-Computer Interaction Institute.
UC Marco Vieira University of Coimbra
Profiling: What is it? Notes and reflections on profiling and how it could be used in process mining.
Dept of ECE, Concordia University, Montreal, Canada
IEEE Std 1074: Standard for Software Lifecycle
Chapter 9 Recursion.
Lecture 2d1: Quality of Measurements
An evolutionary approach to solving complex problems
LESSON 11 – WHILE LOOPS UNIT 5 – 1/10/17.
Boltzmann Machine (BM) (§6.4)
Week 7 Advanced Research Design
Evaluation David Kauchak CS 158 – Fall 2019.
Presentation transcript:

Design of a Learning Classifier System for … … Distributed Max-Flow Algorithm Fault Detection

Overview Why only Design? XCS Framework S-classifiers Training the LCS The Reward Mechanism Rule Discovery Conclusion/Questions

Why only Design? Complexity and volatility of the design phase The design took a while to become stable Injected fault runs are not yet available Mike is working on this – I didn’t want to rush him Reluctance to implement half-baked ideas I like to feel confident before investing lots of time Other obligations and personal issues Thesis – it’s almost done, I hope Mid-life crisis – let’s not go into this, ok?

XCS Framework Michigan Model: population = rule set Individual = Rule Evaluation Cycle Update this, update that Rule Discovery Cycle Recombine and/or mutate (condition:action) pairs

S-classifiers Use s-expressions in the rules Parse tree to represent a condition which detects a fault with AND and NOT operators. Action = the diagnosis TRUE at first. Later, try to classify various types of faults. Default rule diagnosing FALSE (no fault detected) if no other rule matches the state.

Training the LCS Each run of the Max-Flow algorithm produces a history file collected by each processor. Input to the LCS for Rule Evaluation = state of the environment = sliding window of message history from one processor’s perspective So, I am trying to see if one processor can learn to detect faults based on its perspective

The Reward Mechanism Current plan: Run an entire history file (about 1500 events) through the LCS. For each file, monitor whether the LCS ever detects a fault. If so, the Diagnosis is TRUE. Allocate a reward at the end of the file based on whether the Diagnosis was accurate. Repeat for many history files, and stop training when a certain level of accuracy is obtained.

Rule Discovery Since all the rules have actions which are positive (TRUE) diagnoses, just alter the conditions by normal parse tree operations. There is some room for experimentation in this phase of the LCS, but I have some ideas Use more recombination than mutation. Initialize with simple depth 1 trees. Mutate by replacing subtrees with terminals.

Conclusion/Questions LCS is a powerful but complicated concept. Probably requires more expert knowledge than ordinary EA, also more prone to failure. Most significant contribution is probably what I did not do rather than what I did. Did not try to process the actual partial-order of causally-related events – this is not my expertise. Wanted to work with one history file at a time. Did not implement something that had little chance of being successful.