Applicability Issues of the (Real-valued) Negative Selection Algorithms Zhou Ji, Dipankar Dasgupta The University of Memphis GECCO 2006: July 11, 2006.

Slides:



Advertisements
Similar presentations
Logical and Artificial Intelligence in Games Lecture 14
Advertisements

Augmented Negative Selection Algorithm with Variable-Coverage Detectors Zhou Ji, Zhou Ji, St. Jude Childrens Research Hospital Dipankar Dasgupta, Dipankar.
Analysis of Dental Images using Artificial Immune Systems Zhou Ji 1, Dipankar Dasgupta 1, Zhiling Yang 2 & Hongmei Teng 1 1: The University of Memphis.
Estimating the detector coverage in a negative selection algorithm Zhou Ji St. Jude Childrens Research Hospital Dipankar Dasgupta The University of Memphis.
Negative Selection Algorithms at GECCO /22/2005.
V-Detector: A Negative Selection Algorithm Zhou Ji, advised by Prof. Dasgupta Computer Science Research Day The University of Memphis March 25, 2005.
Real-valued negative selection algorithms Zhou Ji
Applications of one-class classification
Artificial Immune Systems. CBA - Artificial Immune Systems Artificial Immune Systems: A Definition AIS are adaptive systems inspired by theoretical immunology.
Particle Swarm Optimization (PSO)
Computational Intelligence Winter Term 2009/10 Prof. Dr. Günter Rudolph Lehrstuhl für Algorithm Engineering (LS 11) Fakultät für Informatik TU Dortmund.
Artificial Intelligence
The story beyond Artificial Immune Systems Zhou Ji, Ph.D. Center for Computational Biology and Bioinformatics Columbia University Wuhan, China 2009.
Constraint Optimization We are interested in the general non-linear programming problem like the following Find x which optimizes f(x) subject to gi(x)
Machine Learning Instance Based Learning & Case Based Reasoning Exercise Solutions.
Sensor-Based Abnormal Human-Activity Detection Authors: Jie Yin, Qiang Yang, and Jeffrey Junfeng Pan Presenter: Raghu Rangan.
Tetris and Genetic Algorithms Math Club 5/30/2011.
Biologically Inspired AI (mostly GAs). Some Examples of Biologically Inspired Computation Neural networks Evolutionary computation (e.g., genetic algorithms)
Anomaly Detection in Data Docent Xiao-Zhi Gao
Quadtrees, Octrees and their Applications in Digital Image Processing
WRSTA, 13 August, 2006 Rough Sets in Hybrid Intelligent Systems For Breast Cancer Detection By Aboul Ella Hassanien Cairo University, Faculty of Computer.
Some Technical Considerations In negative selection algorithms 4/15/2005.
Chapter 4 DECISION SUPPORT AND ARTIFICIAL INTELLIGENCE
Complex Networks for Representation and Characterization of Object For CS790g Project Bingdong Li 11/9/2009.
The Decision-Making Process IT Brainpower
1 Lecture 8: Genetic Algorithms Contents : Miming nature The steps of the algorithm –Coosing parents –Reproduction –Mutation Deeper in GA –Stochastic Universal.
1 Learning to Detect Objects in Images via a Sparse, Part-Based Representation S. Agarwal, A. Awan and D. Roth IEEE Transactions on Pattern Analysis and.
CS 590M Fall 2001: Security Issues in Data Mining Lecture 3: Classification.
1 Negative selection algorithms: from the thymus to V-detector Dissertation defense Zhou Ji Major professor: Prof. Dasgupta Advisory committee: Dr. Lin,
Artificial Intelligence Genetic Algorithms and Applications of Genetic Algorithms in Compilers Prasad A. Kulkarni.
Evolutionary Computational Intelligence Lecture 8: Memetic Algorithms Ferrante Neri University of Jyväskylä.
Artificial Immune Systems Our body’s immune system is a perfect example of a learning system. It is able to distinguish between good cells and potentially.
Genetic Algorithm Genetic Algorithms (GA) apply an evolutionary approach to inductive learning. GA has been successfully applied to problems that are difficult.
Smart Traveller with Visual Translator for OCR and Face Recognition LYU0203 FYP.
Computer Science Genetic Algorithms10/13/10 1 An Investigation of Niching and Species Formation in Genetic Function Optimization Kalyanmoy Deb David E.
By : Anas Assiri.  Introduction  fraud detection  Immune system  Artificial immune system (AIS)  AISFD  Clonal selection.
Distributed Network Intrusion Detection An Immunological Approach Steven Hofmeyr Stephanie Forrest Patrik D’haeseleer Dept. of Computer Science University.
A Genetic Algorithms Approach to Feature Subset Selection Problem by Hasan Doğu TAŞKIRAN CS 550 – Machine Learning Workshop Department of Computer Engineering.
Introduction to AI Michael J. Watts
Slides are based on Negnevitsky, Pearson Education, Lecture 12 Hybrid intelligent systems: Evolutionary neural networks and fuzzy evolutionary systems.
Ensemble of ensemble of tree and neural network Louis Duclos-Gosselin.
Genetic algorithms Prof Kang Li
Lecture 8: 24/5/1435 Genetic Algorithms Lecturer/ Kawther Abas 363CS – Artificial Intelligence.
110/19/2015CS360 AI & Robotics AI Application Areas  Neural Networks and Genetic Algorithms  These model the structure of neurons in the brain  Humans.
APPLICATION OF THE METHOD AND COMBINED ALGORITHM ON THE BASIS OF IMMUNE NETWORK AND NEGATIVE SELECTION FOR IDENTIFICATION OF TURBINE ENGINE SURGING Lytvynenko.
Big Ideas Differentiation Frames with Icons. 1. Number Uses, Classification, and Representation- Numbers can be used for different purposes, and numbers.
Hyper-heuristics. 2 Outline Hyper-heuristics Hyper-heuristics for strip packing Hyper-heuristics for Stock forecasting Conclusion.
Genetic Algorithms. Evolutionary Methods Methods inspired by the process of biological evolution. Main ideas: Population of solutions Assign a score or.
A Passive Approach to Sensor Network Localization Rahul Biswas and Sebastian Thrun International Conference on Intelligent Robots and Systems 2004 Presented.
ANALOGY “A Program for the Solution of a Class of Geometric-Analogy Intelligence-Test Questions” Thomas G. Evans 1968.
Intelligent Database Systems Lab 國立雲林科技大學 National Yunlin University of Science and Technology A modified version of the K-means algorithm with a distance.
Chapter 12 FUSION OF FUZZY SYSTEM AND GENETIC ALGORITHMS Chi-Yuan Yeh.
Machine Learning A Quick look Sources: Artificial Intelligence – Russell & Norvig Artifical Intelligence - Luger By: Héctor Muñoz-Avila.
October 1, 2013Computer Vision Lecture 9: From Edges to Contours 1 Canny Edge Detector However, usually there will still be noise in the array E[i, j],
Artificial Intelligence: Research and Collaborative Possibilities a presentation by: Dr. Ernest L. McDuffie, Assistant Professor Department of Computer.
Intelligent Database Systems Lab 國立雲林科技大學 National Yunlin University of Science and Technology 2005.ACM GECCO.8.Discriminating and visualizing anomalies.
Organic Evolution and Problem Solving Je-Gun Joung.
Presentation By SANJOG BHATTA Student ID : July 1’ 2009.
The article written by Boyarshinova Vera Scientific adviser: Eltyshev Denis THE USE OF NEURO-FUZZY MODELS FOR INTEGRATED ASSESSMENT OF THE CONDITIONS OF.
Pattern Classification All materials in these slides were taken from Pattern Classification (2nd ed) by R. O. Duda, P. E. Hart and D. G. Stork, John Wiley.
Surface Defect Inspection: an Artificial Immune Approach Dr. Hong Zheng and Dr. Saeid Nahavandi School of Engineering and Technology.
George Yauneridge.  Machine learning basics  Types of learning algorithms  Genetic algorithm basics  Applications and the future of genetic algorithms.
Introduction to genetic algorithm
Classifier Representation in LCS
Challenges in Creating an Automated Protein Structure Metaserver
C.-S. Shieh, EC, KUAS, Taiwan
Advanced Artificial Intelligence Evolutionary Search Algorithm
K Nearest Neighbor Classification
Multi-Objective Optimization
Immunocomputing and Artificial Immune Systems
Presentation transcript:

Applicability Issues of the (Real-valued) Negative Selection Algorithms Zhou Ji, Dipankar Dasgupta The University of Memphis GECCO 2006: July 11, Seattle.

outline Background Background Applicable or not? Applicable or not? Whether and when Whether and when Issue by issue Issue by issue Conclusion Conclusion

Background Artificial Intelligence … Biology-inspired methods … Neural network Evolutionary computation Artificial immune system (AIS) … Immune network Clonal selection Negative selection algorithms Other models

Basic idea of negative selection algorithms (NSA): The problem to solve: anomaly detection or one-class classification

Basic idea of negative selection algorithms (NSA): Possible detectors are generated randomly.

Basic idea of negative selection algorithms (NSA): Those that cover self region are eliminated.

Variety of NSA Data and detector representation Data and detector representation Binary (or string) representation Binary (or string) representation Real-valued representation; detectors as hypersphere, or hyper-rectangle Real-valued representation; detectors as hypersphere, or hyper-rectangle Hybrid representation Hybrid representation Generate/elimination mechanism Generate/elimination mechanism Random generation + censoring Random generation + censoring Genetic algorithm Genetic algorithm Greedy algorithm or other deterministic algorithm Greedy algorithm or other deterministic algorithm Matching rule Matching rule Rcb (r contiguous bits) for binary representation Rcb (r contiguous bits) for binary representation Euclidean distance-based for real-valued representation Euclidean distance-based for real-valued representation

Is NSA appropriate at all? What we know: What we know: NSA is unique in its process and representation scheme NSA is unique in its process and representation scheme There are some scenarios that NSA has advantage There are some scenarios that NSA has advantage Large number of normal samples Large number of normal samples Negative database to hide sample instances Negative database to hide sample instances What we dont know: What we dont know: What are the applications that NSA always do best in? What are the applications that NSA always do best in?

Is real-valued representation appropriate? It is important to choose proper data representation to make it possible to differentiate between classes. It is important to choose proper data representation to make it possible to differentiate between classes. It is application specific. It is application specific. The issue is general in all learning or classification methods. The issue is general in all learning or classification methods. It is NSAs strength that different data representations can fit in. It is NSAs strength that different data representations can fit in.

Matching rules influence It is linked with the choice of data representation. It is linked with the choice of data representation. The issues are similar with those of data representation: The issues are similar with those of data representation: It is also application specific. There is no panacea. It is also application specific. There is no panacea. Matching threshold is a real difficulty. Matching threshold is a real difficulty.

Positive selection or negative selection? Advantage of positive selection is being more straightforward in many problems. Advantage of positive selection is being more straightforward in many problems. For the same reason, negative selection is more convenient in some cases. For example, the large amount to self samples. For the same reason, negative selection is more convenient in some cases. For example, the large amount to self samples. Common foundation of various negative selection algorithms is better explained with the biological metaphor. Common foundation of various negative selection algorithms is better explained with the biological metaphor. Naïve Self-detector is not a solution. Naïve Self-detector is not a solution.

General difficulties not specific in NSA One-class classification One-class classification Without counter examples, the boundary between the two classes is more sensitive to the threshold. Without counter examples, the boundary between the two classes is more sensitive to the threshold. With NSA, a good strategy like boundary-aware V- detector could handle this issue very well in some cases. With NSA, a good strategy like boundary-aware V- detector could handle this issue very well in some cases. High dimensionality High dimensionality 1. How to represent high-dimensional space effectively 2. How many samples are necessary to represent a class With NSA, the first difficulty is to some extent alleviated With NSA, the first difficulty is to some extent alleviated

False criticisms of NSA NSA is useless because it doesnt solve curse of dimensionality. NSA is useless because it doesnt solve curse of dimensionality. NSA doesnt work because it failed this experiment. NSA doesnt work because it failed this experiment. NSA make no sense because positive selection is more straightforward in such-and-such case. NSA make no sense because positive selection is more straightforward in such-and-such case. …… ……

Experiments 1. The difference between algorithm variations 2. Flexibility of NSA: different distance measure 3. NSAs behavior at high dimensionality

Difference between algorithm variations

Flexibility of NSA: different distance measure Generalize Euclidean Distance to Minkowski distance of order m (m-norm distance or L-m distance)

Different detector shapes resulted

NSAs behavior at high dimensionality Setting-up of the experiment Self region A detector

N/A N/A N/A N/A N/A N/A SDNumber of detectors SDFalse alarm rate SDDetection rate dimensionality NSAs behavior at high dimensionality The results

Conclusion Negative selection algorithms include many variations that are different in many ways. Negative selection algorithms include many variations that are different in many ways. Negative selection algorithms apply to certain scenarios. Negative selection algorithms apply to certain scenarios. There are still many questions to be answered in NSA. There are still many questions to be answered in NSA. Other alternatives exist, but do not replace NSA. Other alternatives exist, but do not replace NSA.

Questions and comments? Thank you!