Leiden University. The university to discover. Enhancing Search Space Diversity in Multi-Objective Evolutionary Drug Molecule Design using Niching 1. Leiden.

Slides:



Advertisements
Similar presentations
Topic Outline ? Black-Box Optimization Optimization Algorithm: only allowed to evaluate f (direct search) decision vector x objective vector f(x) objective.
Advertisements

Ali Husseinzadeh Kashan Spring 2010
Leiden University. The university to discover. Desirability Indexes for Soft Constraint Modeling in Drug Design Johannes Kruisselbrink
MOEAs University of Missouri - Rolla Dr. T’s Course in Evolutionary Computation Matt D. Johnson November 6, 2006.
Multi-objective optimization multi-criteria decision-making.
Optimal Design Laboratory | University of Michigan, Ann Arbor 2011 Design Preference Elicitation Using Efficient Global Optimization Yi Ren Panos Y. Papalambros.
Biologically Inspired AI (mostly GAs). Some Examples of Biologically Inspired Computation Neural networks Evolutionary computation (e.g., genetic algorithms)
Date:2011/06/08 吳昕澧 BOA: The Bayesian Optimization Algorithm.
Spring, 2013C.-S. Shieh, EC, KUAS, Taiwan1 Heuristic Optimization Methods Pareto Multiobjective Optimization Patrick N. Ngatchou, Anahita Zarei, Warren.
Two Examples of Docking Algorithms With thanks to Maria Teresa Gil Lucientes.
1 Simulation Modeling and Analysis Session 13 Simulation Optimization.
1 Autonomous Controller Design for Unmanned Aerial Vehicles using Multi-objective Genetic Programming Choong K. Oh and Gregory J. Barlow U.S. Naval Research.
Evolutionary Computation Introduction Peter Andras s.
Luddite: An Information Theoretic Library Design Tool Jennifer L. Miller, Erin K. Bradley, and Steven L. Teig July 18, 2002.
1 Incremental Evolution of Autonomous Controllers for Unmanned Aerial Vehicles using Multi-objective Genetic Programming Gregory J. Barlow, Choong K. Oh,
Effective gradient-free methods for inverse problems Jyri Leskinen FiDiPro DESIGN project.
Introduction to Evolutionary Computation  Genetic algorithms are inspired by the biological processes of reproduction and natural selection. Natural selection.
Automating Keyphrase Extraction with Multi-Objective Genetic Algorithms (MOGA) Jia-Long Wu Alice M. Agogino Berkeley Expert System Laboratory U.C. Berkeley.
Fast Evolutionary Optimisation Temi avanzati di Intelligenza Artificiale - Lecture 6 Prof. Vincenzo Cutello Department of Mathematics and Computer Science.
EC Awards Lecture ~ Spring 2008 Advances in Parameterless Evolutionary Algorithms Lisa Guntly André Nwamba Research Advisor: Dr. Daniel Tauritz Natural.
MOEA/D: A Multiobjective Evolutionary Algorithm Based on Decomposition
Evolutionary Computational Intelligence Lecture 8: Memetic Algorithms Ferrante Neri University of Jyväskylä.
The Pareto fitness genetic algorithm: Test function study Wei-Ming Chen
RAPID: Randomized Pharmacophore Identification for Drug Design PW Finn, LE Kavraki, JC Latombe, R Motwani, C Shelton, S Venkatasubramanian, A Yao Presented.
A New Algorithm for Solving Many-objective Optimization Problem Md. Shihabul Islam ( ) and Bashiul Alam Sabab ( ) Department of Computer Science.
Portfolio-Optimization with Multi-Objective Evolutionary Algorithms in the case of Complex Constraints Benedikt Scheckenbach.
On comparison of different approaches to the stability radius calculation Olga Karelkina Department of Mathematics University of Turku MCDM 2011.
Similarity Methods C371 Fall 2004.
A genetic algorithm for structure based de-novo design Scott C.-H. Pegg, Jose J. Haresco & Irwin D. Kuntz February 21, 2006.
Multimodal Optimization (Niching) A/Prof. Xiaodong Li School of Computer Science and IT, RMIT University Melbourne, Australia
Constrained Evolutionary Optimization Yong Wang Associate Professor, PhD School of Information Science and Engineering, Central South University
Lecture 8: 24/5/1435 Genetic Algorithms Lecturer/ Kawther Abas 363CS – Artificial Intelligence.
What is Genetic Programming? Genetic programming is a model of programming which uses the ideas (and some of the terminology) of biological evolution to.
Use of Machine Learning in Chemoinformatics Irene Kouskoumvekaki Associate Professor December 12th, 2012 Biological Sequence Analysis course.
Distributed Genetic Algorithms with a New Sharing Approach in Multiobjective Optimization Problems Tomoyuki HIROYASU Mitsunori MIKI Sinya WATANABE Doshisha.
Locating Multiple Optimal Solutions Based on Multiobjective Optimization Yong Wang
Artificial Intelligence Chapter 4. Machine Evolution.
Virtual Screening C371 Fall INTRODUCTION Virtual screening – Computational or in silico analog of biological screening –Score, rank, and/or filter.
Kanpur Genetic Algorithms Laboratory IIT Kanpur 25, July 2006 (11:00 AM) Multi-Objective Dynamic Optimization using Evolutionary Algorithms by Udaya Bhaskara.
DIVERSITY PRESERVING EVOLUTIONARY MULTI-OBJECTIVE SEARCH Brian Piper1, Hana Chmielewski2, Ranji Ranjithan1,2 1Operations Research 2Civil Engineering.
Genetic Algorithms Genetic algorithms provide an approach to learning that is based loosely on simulated evolution. Hypotheses are often described by bit.
1 Effect of Spatial Locality on An Evolutionary Algorithm for Multimodal Optimization EvoNum 2010 Ka-Chun Wong, Kwong-Sak Leung, and Man-Hon Wong Department.
Exploiting Group Recommendation Functions for Flexible Preferences.
Evolutionary Design (2) Boris Burdiliak. Topics Representation Representation Multiple objectives Multiple objectives.
EE749 I ntroduction to Artificial I ntelligence Genetic Algorithms The Simple GA.
2/29/20121 Optimizing LCLS2 taper profile with genetic algorithms: preliminary results X. Huang, J. Wu, T. Raubenhaimer, Y. Jiao, S. Spampinati, A. Mandlekar,
Robot Intelligence Technology Lab. Generalized game of life YongDuk Kim.
CITS7212: Computational Intelligence An Overview of Core CI Technologies Lyndon While.
Multiobjective Optimization for Locating Multiple Optimal Solutions of Nonlinear Equation Systems and Multimodal Optimization Problems Yong Wang School.
Neural and Evolutionary Computing - Lecture 9 1 Evolutionary Multiobjective Optimization  Particularities of multiobjective optimization  Multiobjective.
1 Autonomic Computer Systems Evolutionary Computation Pascal Paysan.
Evolutionary multi-objective algorithm design issues Karthik Sindhya, PhD Postdoctoral Researcher Industrial Optimization Group Department of Mathematical.
Application of the GA-PSO with the Fuzzy controller to the robot soccer Department of Electrical Engineering, Southern Taiwan University, Tainan, R.O.C.
Evolutionary Computing Chapter 12. / 26 Chapter 12: Multiobjective Evolutionary Algorithms Multiobjective optimisation problems (MOP) -Pareto optimality.
Principles in the Evolutionary Design of Digital Circuits J. F. Miller, D. Job, and V. K. Vassilev Genetic Programming and Evolvable Machines.
1 ParadisEO-MOEO for a Bi-objective Flow-Shop Scheduling Problem May 2007 E.-G. Talbi and the ParadisEO team
Ch 20. Parameter Control Ch 21. Self-adaptation Evolutionary Computation vol. 2: Advanced Algorithms and Operators Summarized and presented by Jung-Woo.
Computational Approach for Combinatorial Library Design Journal club-1 Sushil Kumar Singh IBAB, Bangalore.
ZEIT4700 – S1, 2016 Mathematical Modeling and Optimization School of Engineering and Information Technology.
Intelligent Database Systems Lab 國立雲林科技大學 National Yunlin University of Science and Technology 1 Intelligent Exploration for Genetic Algorithms Using Self-Organizing.
Haploid-Diploid Evolutionary Algorithms
C.-S. Shieh, EC, KUAS, Taiwan
Haploid-Diploid Evolutionary Algorithms
Virtual Screening.
Artificial Intelligence Chapter 4. Machine Evolution
Heuristic Optimization Methods Pareto Multiobjective Optimization
Packet Classification with Evolvable Hardware Hash Functions
Artificial Intelligence Chapter 4. Machine Evolution
RM-MEDA: A Regularity Model-Based Multiobjective Estimation of Distribution Algorithm BISCuit EDA Seminar
MOEA Testing and Analysis
Presentation transcript:

Leiden University. The university to discover. Enhancing Search Space Diversity in Multi-Objective Evolutionary Drug Molecule Design using Niching 1. Leiden Institute of Advanced Computer Science (LIACS) 2. Leiden/Amsterdam Center for Drug Research (LACDR) 3. NuTech Solutions, Inc. A. Aleman 1 A.P. IJzerman 2 E. van der Horst 2 M.T.M Emmerich 1 T. Bäck 1,3 J.W. Kruisselbrink 1 A. Bender 2

Leiden University. The university to discover. -Search for molecular structures with specific pharmacological or biological activity that influence the behavior of certain targeted cells -Objectives: Maximization of potency of drug (and minimization of side-effects) -Constraints: Stability, synthesizability, drug-likeness, etc. -A huge search space: drug-like molecules -Aim: provide the medicinal chemist a set of molecular structures that can be promising candidates for further research Scope: drug design and development

Leiden University. The university to discover. Molecule Evolution Fragments extracted from From Drug Databases While not terminate do Generate offspring O from P P t+1 = select from (P U O) Evaluate O Initialize population P 0 -‘Normal’ evolution cycle -Graph based mutation and recombination operators -Deterministic elitistic (μ+λ) parent selection (NSGA-II)

Leiden University. The university to discover. Molecule Evolution

Leiden University. The university to discover. Fitness Objectives: -activity predictors based on support vector machines: -f 1 : activity predictor based on ECFP6 fingerprints -f 2 : activity predictor based on AlogP2 Estate Counts -f 3 : activity predictor based on MDL Constraints: -a fuzzy constraint score based on Lipinski’s rule of five and bounds on the minimal energy confirmation:

Leiden University. The university to discover. Desirability indexes for modeling fuzzy constraints The degree of satisfaction can be measured on a scale between 0 and 1 Constraints can be modeled in the form of desirability values

Leiden University. The university to discover. Diversity for Molecule Evolution -A ‘normal’ search yields very similar molecular structures -Aim for a set of diverse candidate structures because: -Vague objective functions may result in finding structures that fail in practice -The chemist desires a set of promising structures rather than only one single solution -Explicit methods are required to enforce diversity in the search space; i.e. niching

Leiden University. The university to discover. All molecules are variations of the same theme! Typical output of a ‘normal’ evolutionary search

Leiden University. The university to discover. Niching in Multi-Objective EA -Explicitly aim for diversity in the decision space -Different than aiming for diversity in the objective space -Points that lie far apart in the objective space do not necessarily also lie far apart in the decision space

Leiden University. The university to discover. Niching-based NSGA-II A Niching-based NSGA-II algorithm as proposed by Shir et al.

Leiden University. The university to discover. Dynamic Niche Identification Peak individuals q=3 Individuals that do not belong to niche B.L. Miller, Shaw, M.J.: Genetic algorithms with dynamic niche sharing for multimodal function optimization, Proceedings of IEEE International Conference on EC, May 1996, Pages:

Leiden University. The university to discover. Similarity in Molecular Spaces -Molecules are represented by bitstrings identifying certain structural properties -A ‘1’ at position i denotes the presence of property i in the molecule, and ‘0’ at position i denotes the absence of property i -How to define a similarity measure for the graph-like molecular structures? -Idea: use molecular fingerprints

Leiden University. The university to discover. Distance based on fingerprints -The distance between two molecules A and B can be based on the four terms: -a: the number of properties only present in A -b: the number of properties only present in B -c: the number of properties present in both A and B -d: the number of properties not present in A and B -One possible distance measure can be created using the Jaccard coefficient (also known as Tanimoto coefficient): The Jaccard distance fullfills the triangular equation, as opposed to for example the cosine-distance!

Leiden University. The university to discover. Triangle inequality

Leiden University. The university to discover. Triangle inequality Why do we want to have a dissimilarity (distance) measure that obeys the triangle inequality? If we have very similar molecules, say molecule A is similar to B and molecule A is also similar to C, then we want to be able to say that B is similar to C.

Leiden University. The university to discover. Triangle inequality

Leiden University. The university to discover. Molecule Evolution with Niching

Leiden University. The university to discover. Experiments Aim: Compare the niching-based NSGA-II method with the normal NSGA-II method Two test-cases: -Find ligands for the Neuropeptide Y2 receptor (NPY2) -Find inhibitors for the Lipoxygenase (LOX) Two objectives: -Aggregated fitness score based on activity predictors -Aggregated constraints score function

Leiden University. The university to discover. Experimental setup -5 runs for each method on each test-case generations per runs -Normal NSGA-II: -50 parents -150 offspring -Niching-based NSGA-II: -10 niches -5 parents per niche -150 offspring -niche radius set to 0.85 (empirically set)

Leiden University. The university to discover. Average Pareto Fronts NPY2: LOX:

Leiden University. The university to discover. Average distance between the individuals in the final populations NPY2: LOX:

Leiden University. The university to discover. Output sets of a NPY2 run without and with niching

Leiden University. The university to discover. Output sets of a LOX run without and with niching

Leiden University. The university to discover. Multi-dimensional Scaling Plots No NichingNiching

Leiden University. The university to discover. The chemist’s view on the output Regarding the niching: -The molecules found with the niching method are clearly more diverse than the molecules found by the non- niching approach In general: -The molecules look reasonable overall, but: -Most molecules still possess unstable and/or toxic features that are not easy to synthesize in practice -Similar types of uncommon features seem to appear

Leiden University. The university to discover. Conclusions and Outlook Conclusions: -Applying niching using the Jaccard distance based on molecular fingerprints and is a way to enhance search space diversity in molecule evolution -It yields more diverse sets of molecules than a normal evolutionary algorithm for molecule evolution Future research: -Applying these methods on other (more sophisticated) models as well -In vitro testing of selected molecules found using this method -Incorporate more sophisticated measures for testing the synthesizability of candidate molecules

Leiden University. The university to discover. Thank you! Alexander Aleman Natural Computing Group LIACS, Universiteit Leiden