A Cooperative Coevolutionary Genetic Algorithm for Learning Bayesian Network Structures Arthur Carvalho

Slides:



Advertisements
Similar presentations
Modeling of Data. Basic Bayes theorem Bayes theorem relates the conditional probabilities of two events A, and B: A might be a hypothesis and B might.
Advertisements

CS188: Computational Models of Human Behavior
A Tutorial on Learning with Bayesian Networks
Image Modeling & Segmentation
Using Parallel Genetic Algorithm in a Predictive Job Scheduling
The IMAP Hybrid Method for Learning Gaussian Bayes Nets Oliver Schulte School of Computing Science Simon Fraser University Vancouver, Canada
Introduction of Probabilistic Reasoning and Bayesian Networks
Probabilistic Inference Lecture 1
Optimizing genetic algorithm strategies for evolving networks Matthew Berryman.
Integrating Bayesian Networks and Simpson’s Paradox in Data Mining Alex Freitas University of Kent Ken McGarry University of Sunderland.
Non-Linear Problems General approach. Non-linear Optimization Many objective functions, tend to be non-linear. Design problems for which the objective.
Date:2011/06/08 吳昕澧 BOA: The Bayesian Optimization Algorithm.
1 Lecture 8: Genetic Algorithms Contents : Miming nature The steps of the algorithm –Coosing parents –Reproduction –Mutation Deeper in GA –Stochastic Universal.
Data Mining Techniques Outline
Regulatory Network (Part II) 11/05/07. Methods Linear –PCA (Raychaudhuri et al. 2000) –NIR (Gardner et al. 2003) Nonlinear –Bayesian network (Friedman.
A new crossover technique in Genetic Programming Janet Clegg Intelligent Systems Group Electronics Department.
Evolution of descent directions Alejandro Sierra Escuela Politécnica Superior Universidad Autónoma de Madrid Iván Santibáñez Koref Bionik und Evolutionstechnik.
Descriptive statistics Experiment  Data  Sample Statistics Experiment  Data  Sample Statistics Sample mean Sample mean Sample variance Sample variance.
Goal: Reconstruct Cellular Networks Biocarta. Conditions Genes.
Learning from Experience: Case Injected Genetic Algorithm Design of Combinational Logic Circuits Sushil J. Louis Genetic Algorithm Systems Lab(gaslab)
Intro to AI Genetic Algorithm Ruth Bergman Fall 2002.
Genetic Algorithms Nehaya Tayseer 1.Introduction What is a Genetic algorithm? A search technique used in computer science to find approximate solutions.
Artificial Intelligence Term Project #3 Kyu-Baek Hwang Biointelligence Lab School of Computer Science and Engineering Seoul National University
Genetic Algorithm What is a genetic algorithm? “Genetic Algorithms are defined as global optimization procedures that use an analogy of genetic evolution.
國立陽明大學生資學程 陳虹瑋. Genetic Algorithm Background Fitness function ……. population selection Cross over mutation Fitness values Random cross over.
Summary of the Bayes Net Formalism David Danks Institute for Human & Machine Cognition.
Parallel Genetic Algorithms with Distributed-Environment Multiple Population Scheme M.Miki T.Hiroyasu K.Hatanaka Doshisha University,Kyoto,Japan.
A Brief Introduction to Graphical Models
Genetic Approximate Matching of Attributed Relational Graphs Thomas Bärecke¹, Marcin Detyniecki¹, Stefano Berretti² and Alberto Del Bimbo² ¹ Université.
Estimation of Distribution Algorithms (EDA)
1 1 Stanford University 2 MPI for Biological Cybernetics 3 California Institute of Technology Inferring Networks of Diffusion and Influence Manuel Gomez.
Coevolutionary Models A/Prof. Xiaodong Li School of Computer Science and IT, RMIT University Melbourne, Australia April.
1 CS 391L: Machine Learning: Bayesian Learning: Beyond Naïve Bayes Raymond J. Mooney University of Texas at Austin.
Optimal resource assignment to maximize multistate network reliability for a computer network Yi-Kuei Lin, Cheng-Ta Yeh Advisor : Professor Frank Y. S.
Kansas State University Department of Computing and Information Sciences Ben Perry – M.S. thesis defense Benjamin B. Perry Laboratory for Knowledge Discovery.
Aprendizagem Computacional Gladys Castillo, UA Bayesian Networks Classifiers Gladys Castillo University of Aveiro.
Genetic Algorithms Genetic Algorithms – What are they? And how they are inspired from evolution. Operators and Definitions in Genetic Algorithms paradigm.
Learning Bayesian Networks with Local Structure by Nir Friedman and Moises Goldszmidt.
Introduction to Bayesian Networks
Lectures 2 – Oct 3, 2011 CSE 527 Computational Biology, Fall 2011 Instructor: Su-In Lee TA: Christopher Miles Monday & Wednesday 12:00-1:20 Johnson Hall.
Siddhartha Shakya1 Estimation Of Distribution Algorithm based on Markov Random Fields Siddhartha Shakya School Of Computing The Robert Gordon.
Inference Complexity As Learning Bias Daniel Lowd Dept. of Computer and Information Science University of Oregon Joint work with Pedro Domingos.
Module networks Sushmita Roy BMI/CS 576 Nov 18 th & 20th, 2014.
Learning the Structure of Related Tasks Presented by Lihan He Machine Learning Reading Group Duke University 02/03/2006 A. Niculescu-Mizil, R. Caruana.
Learning With Bayesian Networks Markus Kalisch ETH Zürich.
A Passive Approach to Sensor Network Localization Rahul Biswas and Sebastian Thrun International Conference on Intelligent Robots and Systems 2004 Presented.
Computing & Information Sciences Kansas State University Data Sciences Summer Institute Multimodal Information Access and Synthesis Learning and Reasoning.
A novel approach in CSP with GA by Juhos Istvan, Phillip Tann, Toth Attila, Tezuka Masaru.
 Genetic Algorithms  A class of evolutionary algorithms  Efficiently solves optimization tasks  Potential Applications in many fields  Challenges.
Robot Intelligence Technology Lab. Generalized game of life YongDuk Kim.
Lecture 2: Statistical learning primer for biologists
Routing and Scheduling in Multistage Networks using Genetic Algorithms Advisor: Dr. Yi Pan Chunyan Ji 3/26/01.
Solving BCSP using GA and PBIL Constraint Satisfaction Problem Group Sana Benhamida Andrea Roli Belgasem Ali Problem leader J.V.Hemert Jorge Tavares Group.
Agenda  INTRODUCTION  GENETIC ALGORITHMS  GENETIC ALGORITHMS FOR EXPLORING QUERY SPACE  SYSTEM ARCHITECTURE  THE EFFECT OF DIFFERENT MUTATION RATES.
1 1 Stanford University 2 MPI for Biological Cybernetics 3 California Institute of Technology Inferring Networks of Diffusion and Influence Manuel Gomez.
Bayesian Brain Probabilistic Approaches to Neural Coding 1.1 A Probability Primer Bayesian Brain Probabilistic Approaches to Neural Coding 1.1 A Probability.
CS 2750: Machine Learning Bayesian Networks Prof. Adriana Kovashka University of Pittsburgh March 14, 2016.
Genetic Algorithm(GA)
Advanced AI – Session 7 Genetic Algorithm By: H.Nematzadeh.
Hirophysics.com The Genetic Algorithm vs. Simulated Annealing Charles Barnes PHY 327.
Evolutionary Computation Evolving Neural Network Topologies.
Using GA’s to Solve Problems
CS 2750: Machine Learning Review
Qian Liu CSE spring University of Pennsylvania

A Short Tutorial on Causal Network Modeling and Discovery
CS498-EA Reasoning in AI Lecture #20
An Algorithm for Bayesian Network Construction from Data
Learning Probabilistic Graphical Models Overview Learning Problems.
Genetic algorithms: case study
Presentation transcript:

A Cooperative Coevolutionary Genetic Algorithm for Learning Bayesian Network Structures Arthur Carvalho

Outline Bayesian Networks CCGA Experiments Conclusion

Bayesian Networks AI technique –Diagnosis, predictions, modelling knowledge Graphical model –Represents a joint distribution over a set of random variables –Exploits conditional independence –Concise, natural representation

Bayesian Networks X1X1 X1X1 X2X2 X2X2 X3X3 X3X3 TT TF FT FF

X1X1 X1X1 X2X2 X2X2 X3X3 X3X3 T F

Directed acyclic graph (DAG) –Nodes: random variables –Edges: direct influence of one variable on another Each node is associated with a conditional probability distribution (CPD)

Bayesian Networks Learning the structure of the network (DAG) –Structure learning problem Learning parameters that define the CPDs –Parameter estimation –Maximum Likelihood estimation

Bayesian Networks Structure learning problem in fully observable datasets –Find a DAG that maximizes P(DAG | Data) –[Cooper & Herskovits, 92]

Bayesian Networks NP-Hard [Chickering et al, 1994] –The number of possible structures is superexponential in the number of nodes [Robinson, 1977] –For a network with n nodes, the number of different structures is:

Outline Bayesian Networks CCGA Experiments Conclusion

CCGA Structure learning task can be decomposed into two dependent subtasks –To find an optimal ordering of the nodes –To find an optimal connectivity matrix

CCGA D D A A B B C C DABC 110 D

D D A A B B C C DABC 110 D

D D A A B B C C DABC 110 D

D D A A B B C C DABC 110 D

D D A A B B C C DABC A

D D A A B B C C DABC A

D D A A B B C C DABC A

D D A A B B C C DABC B 1

D D A A B B C C D110A01B1C DABC

Two subpopulations –Binary (edges) –Permutation (nodes) Cooperative Coevolutionary Genetic Algorithm (CCGA) –Each subpopulation is coevolve using a canonical GA

CCGA Evaluating individual species –Each subpopulation member is combined with both the best known individual and a random individual from the other subpopulation –The fitness function is applied to the two resulting solutions The highest value is the fitness CCGA-2 [Potter & De Jong, 1994]

CCGA OperatorBinaryPermutation SelectionTournament selection CrossoverTwo-point crossoverCycle crossover MutationBit-flip mutationSwap mutation ReplacementPreserve the best solution

Outline Bayesian Networks CCGA Experiments Conclusion

Experiments Setup –K2 algorithm [Cooper & Herskovits, 1992] –Alarm network 37 nodes and 46 edges –Insurance network 27 nodes and 52 edges –Three datasets 1000, 3000, and 5000 instances –100 executions

Experiments Parameters: ParameterValue Generations250 Population size100 Probability crossover0.6 Probability mutation: binary population 1 / max # of edges Probability mutation: permutation population0.5

Experiments Alarm network DatasetAlgorithmAverage Standard Deviation p-value Alarm 1000 −11, CCGA−12, K2−12, Alarm 3000 −33, CCGA−35, K2−35, Alarm 5000 −55, CCGA−57, < K2−57,

Experiments Insurance network DatasetAlgorithmAverage Standard Deviation p-value Insurance 1000 −15, CCGA−15, < K2−16, Insurance 3000 −43, CCGA−45, < K2−45, Insurance 5000 −72, CCGA−74, < K2−75, ,249.83

Outline Bayesian Networks CCGA Experiments Conclusion

New algorithm to solve the structure learning problem –Novel representation –Good performance Future work –Incomplete datasets –Graph-related problems

Thank you! Source code and datasets available at: Arthur Carvalho