EMBIO – Cambridge Particle Swarm Optimization applied to Automated Docking Automated docking of a ligand to a macromolecule Particle Swarm Optimization.

Slides:



Advertisements
Similar presentations
Particle swarm optimization for parameter determination and feature selection of support vector machines Shih-Wei Lin, Kuo-Ching Ying, Shih-Chieh Chen,
Advertisements

Multi-objective optimization multi-criteria decision-making.
PARTICLE SWARM OPTIMISATION (PSO) Perry Brown Alexander Mathews Image:
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 A hybrid particle swarm optimization algorithm for optimal task assignment in distributed system Peng-Yeng Yin and Pei-Pei Wang Department of Information.
The Pareto fitness genetic algorithm: Test function study Wei-Ming Chen
K-means Clustering. What is clustering? Why would we want to cluster? How would you determine clusters? How can you do this efficiently?
Motion Planning in Dynamic Environments Two Challenges for Optimal Path planning.
Nonlinear Equations in Biomedical Engineering
Evaluating Performance for Data Mining Techniques
CSM6120 Introduction to Intelligent Systems Other evolutionary algorithms.
Improved Search for Local Optima in Particle Swarm Optimization May 6, 2015 Huidae Cho Water Resources Engineer, Dewberry Consultants Part-Time Assistant.
A Comparison of Nature Inspired Intelligent Optimization Methods in Aerial Spray Deposition Management Lei Wu Master’s Thesis Artificial Intelligence Center.
Particle Filters for Shape Correspondence Presenter: Jingting Zeng.
Particle Swarm Optimization (PSO) Algorithm and Its Application in Engineering Design Optimization School of Information Technology Indian Institute of.
DRILL Answer the following question’s in your notebook: 1.How does ACO differ from PSO? 2.What does positive feedback do in a swarm? 3.What does negative.
Clustering Methods K- means. K-means Algorithm Assume that K=3 and initially the points are assigned to clusters as follows. C 1 ={x 1,x 2,x 3 }, C 2.
PSO and its variants Swarm Intelligence Group Peking University.
(Particle Swarm Optimisation)
The Particle Swarm Optimization Algorithm Nebojša Trpković 10 th Dec 2010.
2010 IEEE International Conference on Systems, Man, and Cybernetics (SMC2010) A Hybrid Particle Swarm Optimization Considering Accuracy and Diversity.
Robin McDougall Scott Nokleby Mechatronic and Robotic Systems Laboratory 1.
Controlling the Behavior of Swarm Systems Zachary Kurtz CMSC 601, 5/4/
Particle Swarm Optimization James Kennedy & Russel C. Eberhart.
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.
DRILL Answer the following question’s in your notebook: 1.How does ACO differ from PSO? 2.What does positive feedback do in a swarm? 3.What does negative.
Machine Learning Queens College Lecture 7: Clustering.
1 Motion Fuzzy Controller Structure(1/7) In this part, we start design the fuzzy logic controller aimed at producing the velocities of the robot right.
Faculty of Information Engineering, Shenzhen University Liao Huilian SZU TI-DSPs LAB Aug 27, 2007 Optimizer based on particle swarm optimization and LBG.
DRILL Answer the following question’s about yesterday’s activity in your notebook: 1.Was the activity an example of ACO or PSO? 2.What was the positive.
Application Development in Engineering Optimization with Matlab and External Solvers Aalto University School of Engineering.
Mean Field Theory and Mutually Orthogonal Latin Squares in Peptide Structure Prediction N. Gautham Department of Crystallography and Biophysics University.
Given a set of data points as input Randomly assign each point to one of the k clusters Repeat until convergence – Calculate model of each of the k clusters.
Fitness Guided Fault Localization with Coevolutionary Automated Software Correction Case Study ISC Graduate Student: Josh Wilkerson, Computer Science ISC.
Genetic Algorithms for clustering problem Pasi Fränti
1st EELA-2 Grid School 2-15 November Jérôme Verleyen Juan Manuel Hurtado Rámirez Enrique Merino Pérez META-DOCK.
On the Computation of All Global Minimizers Through Particle Swarm Optimization IEEE Transactions On Evolutionary Computation, Vol. 8, No.3, June 2004.
 Introduction  Particle swarm optimization  PSO algorithm  PSO solution update in 2-D  Example.
Swarm Intelligence. Content Overview Swarm Particle Optimization (PSO) – Example Ant Colony Optimization (ACO)
Evolutionary Algorithms Jim Whitehead
Particle Swarm Optimization with Partial Search To Solve TSP
USING MICROBIAL GENETIC ALGORITHM TO SOLVE CARD SPLITTING PROBLEM.
Cluster formation based comparison of Genetic algorithm and Particle Swarm Optimization in Wireless Sensor Network Ms.Amita Yadav.
Adnan Quadri & Dr. Naima Kaabouch Optimization Efficiency
Particle Swarm Optimization
Particle Swarm Optimization
PSO -Introduction Proposed by James Kennedy & Russell Eberhart in 1995
Dr. Ashraf Abdelbar American University in Cairo
آموزش شبکه عصبی با استفاده از روش بهینه سازی PSO
Multi-objective Optimization Using Particle Swarm Optimization
Multi-band impedance matching using an evolutionary algorithm
Design Space Exploration
Assignment I TSP with Simulated Annealing
AIM: Clustering the Data together
Current Status at BioChemtek
KMeans Clustering on Hadoop Fall 2013 Elke A. Rundensteiner
Heuristic Optimization Methods Pareto Multiobjective Optimization
Ligand Docking to MHC Class I Molecules
Shih-Wei Lin, Kuo-Ching Ying, Shih-Chieh Chen, Zne-Jung Lee
Xin-She Yang, Nature-Inspired Optimization Algorithms, Elsevier, 2014
Multi-objective Optimization Using Particle Swarm Optimization
Building and using sequence‐expression‐activity maps (SEAMAPs) AThe RBS Library Calculator designs a synthetic RBS library to efficiently search a multi‐dimensional.
Figure 1 Within-groups sum of squares vs number of clusters Within-groups sum of squares vs number of clusters to determine the number needed for k-means.
Mr.Halavath Ramesh 16-MCH-001 Dept. of Chemistry Loyola College University of Madras-Chennai.
Mr.Halavath Ramesh 16-MCH-001 Dept. of Chemistry Loyola College University of Madras-Chennai.
Mr.Halavath Ramesh 16-MCH-001 Dept. of Chemistry Loyola College University of Madras-Chennai.
Mr.Halavath Ramesh 16-MCH-001 Dept. of Chemistry Loyola College University of Madras-Chennai.
Multiobjective Optimization
Presentation transcript:

EMBIO – Cambridge Particle Swarm Optimization applied to Automated Docking Automated docking of a ligand to a macromolecule Particle Swarm Optimization Multi-objective PSO + Clustering Docking experiments Conclusion

EMBIO – Cambridge Automated Docking Predict binding of a ligand molecule to a receptor macromolecule Minimize resulting binding energy

EMBIO – Cambridge Energy Evaluation [Morris et al.]

EMBIO – Cambridge Autodock 3.05 Determine energies using trilinear interpolation on precalculated grid maps Minimize docking energy with various optimization techniques  Simulated Annealing  Genetic Algorithm with Local Search Sum of energies is minimized

EMBIO – Cambridge Particle Swarm Optimization Multi-dimensional, numerical optimization by a swarm of particles Each particle has current position, best position and velocity Attracted by personal best position and neighbourhood best position

EMBIO – Cambridge PSO Algorithm

EMBIO – Cambridge Clustering Particles are clustered into K separate swarm K-means Clustering m data-vectors are clustered into k clusters Iteratively calculate centroids of each cluster

EMBIO – Cambridge Multiple Objectives Optimize, simultaneously Find dominating solutions Non-Dominated Front

EMBIO – Cambridge Clust-MPSO Update personal best position Each swarm has non-dominated front  is dominated if no particle is in  Dominated swarms are relocated Neighbourhood best particle  Picked for several iterations

EMBIO – Cambridge

1hvr Docking

EMBIO – Cambridge 4cha Docking

EMBIO – Cambridge Convergence – 1hvr

EMBIO – Cambridge Convergence – 4cha

EMBIO – Cambridge Conclusions Application of PSO to Automated Docking Optimization of two objectives Clustering to divide the search space