Holczer Balazs
This course is about the fundamental concepts of artificial intelligence. This topic is getting very hot nowadays because these learning algorithms can be used in several fields from software engineering to investment banking. Learning algorithms can recognize patterns which can help detecting cancer for example. We may construct algorithms that can have a very good guess about stock price movement in the market.
Section 1:
path findinf algorithms
graph traversal (BFS and DFS)
enhanced search algorihtms
A* search algorithm
Section 2:
basic optimization algorithms
brute–force search
stochastic search and hill climbing algorithm
Section 3:
heuristics and meta–heuristics
tabu search
simulated annealing
genetic algorithms
particle swarm optimization
Section 4:
minimax algorithm
game trees
applications of game trees in chess
Tic Tac Toe game and its implementation
In the first chapter we are going to talk about the basic graph algorithms. Several advanced algorithms can be solved with the help of graphs, so as far as I am concerned these algorithms are the first steps.
Second chapter is about local search: finding minimum and maximum or global optimum in the main. These searches are used frequently when we use regression for example and want to find the parameters for the fit. We will consider basic concepts as well as the more advanced algorithms: heuristics and meta–heuristics.
Instructor Details
Courses : 24
Specification: Artificial Intelligence I: Basics and Games in Java
|
9 reviews for Artificial Intelligence I: Basics and Games in Java
Add a review
| Price | $12.99 |
|---|---|
| Provider | |
| Duration | 7.5 hours |
| Year | 2020 |
| Level | All |
| Language | English |
| Certificate | Yes |
| Quizzes | No |
$12.99
Jaime Mu oz Baena –
Muy completo. Explica muy bien todos los algor tmos b sicos
DeMarcus McCall –
Nice!!
J. Emmett Condon –
Great course!! I cannot wait to start the next section.
Shin Hin –
Outdated course.The instructor is not clear on what he is teaching.Most of the question are not answered.Not recommended.
Adolfo Terr n –
Good theoretical explanations of algorithms. Support of graphs make them much more visual and understandable. But it fails when it comes into the practice, He writes Java samples as if he had learnt them by heart instead of following an iterative process. That way, you get lost frequently since you don’t have the final picture.
Tosolini Tomaso –
in the example of bfs only a tree has been presented, i would expect to see it running on a graph also. in such a context what would be the meaning of scanning row by row? Most of the functions to be minimized have only one minimum, it would be good to make examples with multiminimum functions as well
Manas –
Its good but if you provide coding as well then it will excellent
Roberto Ambrosio –
Very good course for an introductory overview of some basic artificial intelligence concepts and algorithms (especially if you have some Java back ground). I’ve see a lot of people comment about the presenters accent and yes, it is a bit hard to follow at first, but you get use to it quickly enough and I did not find it detracted from his ability to explain an convey the concepts.
Shehzan Pervez Workingboxwalla –
Yes, it was a good match. Only problem was that for someone who only knows the basic search, etc. algorithms, the complicated terms were a bit baffling at first. But thanks to the teacher’s detailed explanation, I understood very well. Overall, had a good experience.