Mô tả

Nature offers a wide range of inspirations for biological processes to be incorporated into technology and computing. Some of these processes and patterns have been inspiring the development of algorithms that can be used to solve real-world problems. They are called bio-inspired algorithms, whose inspiration in nature allows for applications in various optimization and classification problems.

In this course, you will learn the theoretical and mainly the practical implementation of the main and mostly used bio-inspired algorithms! By the end of the course you will have all the tools you need to build artificial intelligence solutions that can be applied to your own problems! The course is divided into six sections that cover different algorithms applied in real-world case studies. See below the projects that will be implemented step by step:


  1. Genetic Algorithms (GA): It is one of the most used and well-known bio-inspired algorithm to solve optimization problems. It is based on biological evolution in which populations of individuals evolve over generations through mutation, selection, and crossing over. We will solve the flight schedule problem and the goal is to minimize the price of air line tickets and the time spend waiting at the airport.

  2. Differential Evolution (DE): It is also inspired in biological evolution and the case study we will solve step by step is the creation of menus, correctly balancing the amount of carbohydrates, proteins and fats.

  3. Neural Networks (ANN): It is based on how biological neurons work and is considered one of the most modern techniques to solve complex problems, such as: chatbots, automatic translators, self driving cars, voice recognition, among many others. The case study will be the creation of a neural network for image classification.

  4. Clonal Selection Algorithm (CSA): It is based on the functioning of the optimization of the antibody response against an antigen, resembling the process of biological evolution. These concepts will be used in practice for digit identification and digit generation.

  5. Particle Swarm Optimization (PSO): It relies on the social behavior of animals, in which the swarm tries to find the best solution to a specific problem. The problem to be solved will be the timetable: there is a course, people who want to take it and different timetables. In the end, the algorithm will indicate the best times for each class to take the course.

  6. Ant Colony Optimization (ACO): It is based on concepts of how ants search for food in nature. The case study will be one of the most classic in the area, which is the choice of the shortest path.

Each type of problem requires different techniques for its solution. When you understand the intuition and implementation of bio-inspired algorithms, it is easier to identify which techniques are the best to be applied in each scenario. During the course, all the code will be implemented step by step using the Python programming language! We are going to use Google Colab, so you do not have to worry about installing libraries on your machine, as everything will be developed online using Google's GPUs!

Bạn sẽ học được gì

Understand the theory and practice of the main bio-inspired artificial intelligence algorithms

Solve real-world optimization problems using bio-inspired algorithms

Minimize the price of airline tickets using Genetic Algorithms

Create custom menus using Differential Evolution

Classify handwritten digits using Artificial Neural Networks

Adapt antibodies and antigens with the Clonal Selection algorithm, applied in digit recognition

Optimize course schedules using Particle Swarm Optimization

Solve shortest paths problems using Ant Colony Optimization

Yêu cầu

  • Programming logic
  • Basic Python programming

Nội dung khoá học

8 sections

Introduction

2 lectures
Couse content
04:32
Course materials
00:11

Genetic Algorithms

13 lectures
Case study - flight schedule
04:54
Creating the variables
05:10
Flights dataset
12:30
Printing the schedule
16:53
Hours to minutes
05:14
Fitness function 1
11:55
Fitness function 2
08:08
Genetic algorithm - intuition
11:13
Part 1 - mutation
13:26
Part 2 - crossover
06:38
Part 3 - complete genetic algorithm
08:25
Part 4 - complete genetic algorithm
09:24
Part 5 - complete genetic algorithm
14:34

Differential Evolution

13 lectures
Introduction to the algorithm
04:04
General structure of the algorithm
05:03
The variation operator and the generation of new vectors
06:53
Main differences between DE and GA
03:14
Application: nutrient allocation problem
03:45
Part 1 - Candidate solution
02:52
Part 2 - Population of vectors
02:16
Part 3 - Objective/fitness function
06:33
Part 4 - selecting three other vectors
04:05
Part 5 - variation operator
04:17
Part 6 - selecting the best vector from each population
02:03
Part 7 - running the algorithm
03:26
Part 8 - solution graph
03:11

Artificial Neural Networks

13 lectures
Biological fundamentals
05:42
Single layer perceptron
19:23
Multi-layer networks – sum and activation functions
14:20
Multi-layer networks – error calculation
05:19
Gradient descent
09:49
Delta parameter
08:09
Adjusting the weights with backpropagation
14:03
Bias, error, stochastic gradient descent, and more concepts
17:56
Part 1 - digits dataset
12:04
Part 2 - pre-processing the images
10:56
Part 3 - training
12:22
Part 4 - evaluating
10:19
Part 5 - classifying one single image
09:50

Clonal Selection Algorithm

14 lectures
Clonal Selection Algorithm
05:31
General structure of the algorithm
03:04
Calculating the cloning factor
04:51
Calculation of hypermutation
03:50
Application - Digit generation/recognition
03:47
Part 1 - antibody function
02:11
Part 2 - antibody population
01:41
Part 3 - fitness function
02:29
Part 4 - antibody affinity list
02:34
Part 5 - selecting the N best antibodies
03:06
Part 6 - cloning the best antibodies
04:26
Part 7 - Hypermutation of the antibodies
04:17
Part 8 - Running the algorithm
04:35
Part 9 - Solution graph
01:40

Particle Swarm Optimization

16 lectures
Introduction to the algorithm
05:36
General structure of the algorithm
03:44
Particles and the population (swarm)
02:22
Individual best particle and Global best particle
02:08
Updating the position and velocity of the particles
04:01
Graphical/vectorial representation of position/velocity update
03:19
Case study
06:47
Part 1 - Particle
05:00
Part 2 - Population
01:22
Part 3 - Fitness function
04:42
Part 4 - Personal best position (pbest)
02:53
Part 5 - Global best position (gbest)
04:00
Part 6 - Updating the position and velocity of the particle
03:44
Part 7 - New position/particle
02:43
Part 8 - Running the algorithm
02:52
Part 9 - Solution graph
01:33

Ant Colony Optimization

15 lectures
Foraging behavior of ants
01:57
Foraging behavior of ants: part 2
06:12
Update of pheromone deposition
06:18
Probability of edge selection
04:07
Ants and the TSP problem
06:05
Case study
03:31
Part 1 - Edges
03:42
Part 2 - Edge selection probability
04:21
Part 3 - Function that chooses edges
04:46
Part 4 - Generating paths/ants
03:21
Part 5 - Path length function
01:37
Part 6 - Pheromone update
03:51
Part 7 - Running the algorithm
02:20
Part 8 - 5 nodes
02:32
Part 9 - Running the algorithm with 5 nodes
05:28

Final remarks

2 lectures
Final remarks
02:05
BONUS
01:32

Đánh giá của học viên

Chưa có đánh giá
Course Rating
5
0%
4
0%
3
0%
2
0%
1
0%

Bình luận khách hàng

Viết Bình Luận

Bạn đánh giá khoá học này thế nào?

image

Đăng ký get khoá học Udemy - Unica - Gitiho giá chỉ 50k!

Get khoá học giá rẻ ngay trước khi bị fix.