Scribd
Upload
4 views

AI Algorithms and Logic (6 Hours) 1. AI Algorithms 2. Popular Search Algorithm 3. Means end analysis Algorithm 4. Fuzzy Logic System 5. Natural Language Processing 6. Expert System 7. Neural Network 8. AI termino

The document outlines various AI algorithms, including popular search algorithms and their applications in problem-solving categories such as classification, regression, and clustering. It defines AI algorithms as sets of instructions that enable computers to learn and operate autonomously. Additionally, it discusses specific algorithms like Naive Bayes, Decision Trees, and the components of search algorithms.

Uploaded by

Arpan Bhattacharya
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
4 views

AI Algorithms and Logic (6 Hours) 1. AI Algorithms 2. Popular Search Algorithm 3. Means end analysis Algorithm 4. Fuzzy Logic System 5. Natural Language Processing 6. Expert System 7. Neural Network 8. AI termino

The document outlines various AI algorithms, including popular search algorithms and their applications in problem-solving categories such as classification, regression, and clustering. It defines AI algorithms as sets of instructions that enable computers to learn and operate autonomously. Additionally, it discusses specific algorithms like Naive Bayes, Decision Trees, and the components of search algorithms.

Uploaded by

Arpan Bhattacharya
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 13

AI Algorithms and Logic (6

Hours)
1. AI Algorithms
2. Popular Search Algorithm
3. Means end analysis Algorithm
4. Fuzzy Logic System
5. Natural Language Processing
6. Expert System
7. Neural Network
8. AI terminology
What is an AI algorithm?
So then what is an AI algorithm? The definition of an algorithm is
“a set of instructions to be followed in calculations or other
operations.” This applies to both mathematics and computer
science. So, at the essential level, an AI algorithm is the
programming that tells the computer how to learn to operate on
its own.
Types Of Problems Solved Using Artificial Intelligence
Algorithms

Algorithms in each category, in essence, perform the same task of


predicting outputs given unknown inputs, however, here data is the
key driver when it comes to picking the right algorithm.

What follows is an outline of categories of Machine Learning problems


with a brief overview of the same:
Classification
Regression
Clustering
Artificial Intelligence Algorithms
As mentioned above, different Artificial Intelligence algorithms can be
used to solve a category of problems. In the below section we’ll see the
different types of algorithms that fall under Classification, Regression
and Clustering problems.
Classification uses an array of algorithms, a few of
them listed below

Naive Bayes
Decision Tree
Random Forest
Logistic Regression
Support Vector Machines
K Nearest Neighbours
Naive Bayes

Naive Bayes algorithm follows the Bayes theorem, which unlike all the other
algorithms in this list, follows a probabilistic approach. This essentially means,
that instead of jumping straight into the data, the algorithm has a set of prior
probabilities set for each of the classes for your target.
Decision Tree
Random Forest
Search Algorithm Terminologies:

Search: Searchingis a step by step procedure to solve a search-problem in a


given search space. A search problem can have three main factors:
Search Space: Search space represents a set of possible solutions, which a
system may have.
Start State: It is a state from where agent begins the search.
Goal test: It is a function which observe the current state and returns whether the
goal state is achieved or not.
Search tree: A tree representation of search problem is called Search tree. The root
of the search tree is the root node which is corresponding to the initial state.
Actions: It gives the description of all the available actions to the agent.
Transition model: A description of what each action do, can be represented as a
transition model.
Path Cost: It is a function which assigns a numeric cost to each path.
Solution: It is an action sequence which leads from the start node to the goal node.
Optimal Solution: If a solution has the lowest cost among all solutions.
AI - Popular Search Algorithms
Means end analysis Algorithm

You might also like