Unit 1
Unit 1
Noida
INTRODUCTION TO ARTIFICIAL
INTELLIGENCE
Unit: I
INTRODUCTION TO ARTIFICIAL
INTELLIGENCE (ACSAI-301)
Ms. Bhawna Wadhwa
Course Details Assistant Professor and
(B Tech - AI 3rd Sem) HOD (CS Deptt.)
Introduction
• Bhawna Wadhwa
BE and M. Tech in CSE with 16 Years Teaching
Experience
*1= Low *2= Medium *3= High
S. Course PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
No Outcome
1 ACSAI-301.1
2
*3= High
ACSAI-301.2
*2= Medium *1 = Low
3 ACSAI-301.3
4 ACSAI-301.4
5 ACSAI-301.5
AVG
• https://www.youtube.com/watch?v=4jmsHaJ7xEA
• https://www.youtube.com/watch?v=oV74Najm6Nc
• https://www.youtube.com/watch?v=y5swZ2Q_lBw
• https://www.youtube.com/watch?v=ptWmh0ocveM
Definition of AI
• Combination of 2 words:
• What is AI?
Ability of machines to
–Learn
–Think
–Behave
Like humans
Formal Definition: branch of computer science which
emphasizes on creation of intelligent machines that work
and act like humans.
Year 1943: The first work which is now recognized as AI was done by Warren
McCulloch and Walter pits in 1943. They proposed a model of artificial neurons.
Year 1950: The Alan Turing who was an English mathematician and pioneered
Machine learning in 1950. Alan Turing publishes "Computing Machinery and
Intelligence" in which he proposed a test. The test can check the machine's
ability to exhibit intelligent behavior equivalent to human intelligence, called
a Turing test.
Year 1955: An Allen Newell and Herbert A. Simon created the "first
artificial intelligence program"Which was named as "Logic
Theorist". This program had proved 38 of 52 Mathematics
theorems, and find new and more elegant proofs for some theorems.
Year 1956: The word "Artificial Intelligence" first adopted by
American Computer scientist John McCarthy at the Dartmouth
Conference. For the first time, AI coined as an academic field.
At that time high-level computer languages such as FORTRAN,
LISP, or COBOL were invented. And the enthusiasm for AI was
very high at that time.
A boom of AI (1980-1987)
Year 1980: After AI winter duration, AI came back with "Expert
System". Expert systems were programmed that emulate the
decision-making ability of a human expert.
In the Year 1980, the first national conference of the American
Association of Artificial Intelligence was held at Stanford
University.
The second AI winter (1987-1993)
The duration between the years 1987 to 1993 was the second AI
Winter duration.
Again Investors and government stopped in funding for AI research
as due to high cost but not efficient result. The expert system such as
XCON was very cost effective.
09/28/22 Bhawna Wadhwa ACSAI-301 AI Unit 01 45
History of AI
Year 1997: In the year 1997, IBM Deep Blue beats world chess
champion, Gary Kasparov, and became the first computer to beat a
world chess champion.
Year 2002: for the first time, AI entered the home in the form of
Roomba, a vacuum cleaner.
Year 2006: AI came in the Business world till the year 2006.
Companies like Facebook, Twitter, and Netflix also started using AI.
4) Implementation
Organizations often have analytics engines working with them by
the time they choose to upgrade to AI. Integrating newer AI
methodologies into existing methodologies is a complicated task.
Maintaining proper interpretation and documentation goes a long
way to easing implementation. Partnering with an
implementation partner can make the implementation of services
like anomaly detection, predictive analysis, and ensemble
modeling much easier.
6. Ethical challenges
One of the major AI problems that are yet be tackled are the ethics and
morality. The way how the developers are technically grooming the AI
bots to perfection where it can flawlessly imitate human conversations,
making it increasingly tough to spot a difference between a machine and
a real customer service rep.
Artificial intelligence algorithm predicts based on the training given to it.
The algorithm will label things as per the assumption of data it is trained
on. Hence, it will simply ignore the correctness of data, for example- if
the algorithm is trained on data that reflects racism or sexism, the result
of prediction will mirror back it instead of correcting it automatically.
There are some current algorithms that have mislabeled black people as
‘gorillas’. Therefore, we need to make sure that the algorithms are fair,
especially when it is used by private and corporate individuals.
8. Legal Challenges
An AI application with an erroneous algorithm and data governance can
cause legal challenges for the company. This is yet again one of the
biggest Artificial Intelligence problems that a developer faces in a real
world. Flawed algorithm made with an inappropriate set of data can
leave a colossal dent in an organization’s profit. An erroneous algorithm
will always make incorrect and unfavorable predictions. Problems like
data breach can be a consequence of weak & poor data governance–
how? To an algorithm, a user’s PII (personal identifiable information)
acts as a feed stock which may slip into the hands of hackers.
Consequently, the organization will fall into the traps of legal challenges.
Learning: A Definition
• Definition: A computer program is said to learn from
experience E with respect to some class of tasks T and
performance measure P, if its performance at tasks in
T, as measured by P, improves with experience E.
Problem
representation paradigms
■ Goal Formulation:
– Problem solving is about having a goal we want to reach, (e.i: I
want to travel from ‘A’ to ‘E’).
– Goals have the advantage of limiting the objectives the agent is
trying to achieve.
– We can say that goal is a set of environment states in which our
goal is satisfied.
■ Problem Formulation:
– A problem formulation is about deciding what actions and
states to consider, we will come to this point it shortly.
– We will describe our states as “in(CITYNAME)”
where CITYNAME is the name of the city in which we are currently
in.
■ Once our agent has found the sequence of cities it should pass by to reach its
goal it should start following this sequence.
■ The process of finding such sequence is called search, a search algorithm is
like a black box which takes problem as input returns a solution, and once
the solution is found the sequence of actions it recommends is carried out
and this is what is called the execution phase.
■ We now have a simple (formulate, search, execute) design for our problem
solving agent, so lets find out precisely how to formulate a problem.
■ Goal Test:
– we should be able to decide whether the current state is a goal state {e.i: is
the current state is in(E)?}.
■ Path cost:
– a function that assigns a numeric value to each path, each step we take in
solving the problem should be somehow weighted, so If I travel from A to
E our agent will pass by many cities, the cost to travel between two
consecutive cities should have some cost measure, {e.i: Traveling from ‘A’
to ‘B’ costs 20 km or it can be typed as c(A, 20, B)}.
■ A solution to a problem is path from the initial state to a goal state, and
solution quality is measured by the path cost, and the optimal solution
has the lowest path cost among all possible solutions.
EXAMPLE
PROBLEMS
Toy Problem
Vacuum
World
– Initial state:
■Our vacuum can be in any state of the 8 states shown in the picture.
– State description:
■Successor function generates legal states resulting from applying the
three actions {Left, Right, and Suck}.
■The states space is shown in the picture, there are 8 world states.
– Goal test:
■Checks whether all squares are clean.
– Path cost:
■Each step costs 1, so the path cost is the sum of steps in the path.
15
EXAMPLE
PROBLEMS
8 Puzzle
11
8
8-
Puzzle
■ Initial state:
– Our board can be in any state resulting from making it in any configuration.
■ State description:
– Successor function generates legal states resulting from applying the three actions {move blank Up, Down, Left, or
Right}.
– State description specifies the location of each of the eight titles and the blank.
■ Goal test:
– Checks whether the states matches the goal configured in the goal state shown in the picture.
■ Path cost:
– Each step costs 1, so the path cost is the sum of steps in the path.
11
9
12
0
EXAMPLE
PROBLEMS
8-Queens Problem
12
1
8-Queens Problem
■ States: ???
■ Initial State: ???
■ Successor Function: ???
■ Goal Test: ???
12
2
EXAMPLE
PROBLEMS
Real World Problem
12
3
Real World
Problems
■ Airline Travelling Problem
■ States:
– Each is represented by a location and the current time.
■ Initial State:
– This is specified by the problem.
■ Successor Function:
– This returns the states resulting from taking any scheduled flight, leaving later than the current time plus
the within airport transit time, from the current airport to another.
■ Goal Test:
– Are we at the destination by some pre-specified time?
■ Path Cost:
– This depends on the monetary cost, waiting time, flight time, customs and immigration procedures, seat
quality, time of day, type of air place, frequent-flyer mileage awards and so on. 12
4
Continue…
■ Touring problems
■ Traveling
salesperson problem
■ Robot navigation
■ Automatic assembly
sequencing
12
5
SEARCHING FOR
SOLUTIONS
■ After formulating our problem we are ready to solve it, this can be done by
searching through the state space for a solution, this search will be applied on a
search tree or generally a graph that is generated using the initial state and the
successor function.
■ Searching is applied to a search tree which is generated through state expansion,
that is applying the successor function to the current state, note that here we
mean by state a node in the search tree.
■ Generally, search is about selecting an option and putting the others aside for
later in case the first option does not lead to a solution, The choice of which
option to expand first is determined by the search strategy used.
12
6
12
7
Continue
…
■ The structure of a node in the search tree can be as follows:
– State: the state in the state space to which this state corresponds
– Parent-Node: the node in the search graph that generated this node.
– Action: the action that was applied to the parent to generate this node.
– Path-Cost: the cost of the path from the initial state to this node.
– Depth: the number of steps along the path from the initial state.
■ It is important to make a distinction between nodes and states, A node in the search tree
is a data structure holds a certain state and some info used to represent the search tree,
where state corresponds to a world configuration, that is more than one node can hold the
same state, this can happened if 2 different paths lead to the same state.
12
8
Measuring problem-solving
performance
■ Search as a black box will result in an output that is either failure or a solution,
We will evaluate a search algorithm`s performance in four ways:
– Completeness: is it guaranteed that our
algorithmalways finds a solution when there is one ?
– Optimality: Does our algorithm always find the optimal solution ?
– Time complexity: How much time our search
algorithmtakes to find a solution ?
– Space complexity: How much memory required to run the search algorithm?
■ Time and Space in complexity analysis are measured with respect to the number
of nodes the problem graph has in terms of asymptotic notations.
12
9
Continue
…
■ In AI, complexity is expressed by three factors b, d and
m:
1. b the branching factor is the maximum number of successors of any node.
2. d the depth of the deepest goal.
3. m the maximum length of any path in the state space.
13
0
Problem Solving
By Search
■ Missionaries and Cannibals
– Three missionaries and cannibals are on one side of a
river, along with a boat that can hold one or two people.
Find a way to get everyone to the other side, without ever
leaving a group of missionaries outnumbered by cannibals.
– How do we transport them other side of the river?
13
1
RECA
P
30
Recap
■ Before an agent can start searching for solutions, a goal must be
identified and a well defined problem must be formulated.
■ A problem consists of five parts: the initial state, a set of actions, a
transition model describing the results of those actions, a goal test
function, and a path cost function.
■ The environment of the problem is represented by a state space. A path
through the state space from the initial state to a goal state is a solution.
■ Search algorithms are judged on the basis of completeness, optimality,
time complexity, and space complexity. Complexity depends on b, the
branching factor in the state space, and d, the depth of the shallowest
solution.
13
3
Problem solving
■ We want:
– To automatically solve a problem
■ We need:
– A representation of the problem
– Algorithms that use some strategy to solve the problem defined in that
representation
13
4
09/28/22 134
Bhawna Wadhwa ACSAI-301 AI Unit 01
Example
Problem representation
■ General:
– State space: a problem is divided into a set of resolution steps from the initial state
to the goal state
– Reduction to sub-problems: a problem is arranged into a hierarchy of sub-
problems
■ Specific:
– Game resolution
– Constraints satisfaction
13
5
What are the core components of Learning System? What do you mean by well
defined Learning System?
What are the basic attributes of types of training in a Learning System?
How is machine learning related to AI?
How will artificial intelligence change the future?
What do you mean by well-defined Learning System? Explain the steps to design a
well- defined Learning System.
Explain Knowledge Pyramid.
Explain the Goal of Artificial Intelligence?
What is the future of Artificial intelligence?
Distinguish between strong and weak artificial intelligence?
What are the three features of well-posed learning problem?
Elaborate on the History of Artificial Intelligence.
Explain the different steps to design a well- defined Learning System in detail.
Explain well defined or well posed Learning System with one example.
data on their own, leading machines to learn for themselves and improve
from learned experiences.
General Instructions:
All questions are compulsory. Answers should be brief and to the point.
This Question paper consists of 2 pages & 5 questions.
It comprises of three Sections, A, B, and C. You are to attempt all the sections.
Section A -Question No- 1 is objective type questions carrying 1 mark each, Question No- 2 is very short
answer type carrying 2 mark each. You are expected to answer them as directed.
Section B - Question No-3 is Short answer type question s carrying 5 marks each. You need to attempt
any two out of three question s given.
Section C -Question No. 4 & 5are Long answer type (within unit choice) questions carrying 6marks
each. You need to attempt any one part a or b.
Students are in structed to cross the blank sheets before handing over the answer sheet to the invigilator.
No sheet should be left blank. Any written material after a blank sheet will not be evaluated/ checked.
SECTION – A [8]
b. The primary interactive method of communication used by humans is: (1) CO2
a. Reading
b. Writing
c. Speaking
d. All of the above
• What are the core components of Learning System? What do you mean by
well defined Learning System?
• What are the three features of well-posed learning problem?
• Elaborate on the History of Artificial Intelligence.
• What is a Chatbot?
• What are the different areas where AI has a great impact?
• What is Artificial Intelligence? Give an example of where AI is used on a
daily basis.
• Explain the different steps to design a well- defined Learning System in
detail.
• Write down the following
– Machine Learning
– Speech Recognition
– Deep Learning
– Artificial Intelligence