INTRODUCTION TO ARTIFICIAL INTELLIGENCE

BCA, 2 YEAR, 4 SEMESTER

SECTION-A

SUBMITTED TO
PROF. SHAHAB SAQUIB SOHAIL
(ASSISTANT PROFESSOR)

SUBMITTED BY
ANJANA RAJAN (ROLL NO.- 14)
2019-301-016

JAMIA HAMDARD
DEPARTMENT OF COMPUTER SCIENCE AND TECHNOLOGY
SCHOOL OF ENGINEERING SCIENCES AND TECHNOLOGY
NEW DELHI-110062
1. Markov chain?
What is a Markov Chain?

Markov chains are used to model probabilities using information that can be encoded

in the current state. Something transitions from one state to another semi-randomly, or
stochastically.  Each state has a certain probability of transitioning to each other state,
so each time you are in a state and want to transition, a markov chain can predict
outcomes based on pre-existing probability data. More technically, information is put
into a matrix and a vector - also called a column matrix - and with many iterations, a
collection of probability vectors makes up Markov chains.  To determine the
transition probabilities, you have to "train" your Markov Chain on some input corpus. 

Markov Model

A Markov model is a stochastic model with the property that future states are
determined only by the current state -- in other words, the model has no memory; it
only knows what state it's in now, not any of the states which occurred previously.

An Example of Markov Chain

In this example, we can see we have two states: “sunny” and “rainy”. Let’s say the
day is sunny, and we want to know what the chances are that it will be sunny the next
day. Evidently, Markov chain indicates that there is a .9, or 90%, chance it will be
sunny. Following this pattern, we can see that there will probably be many sunny days
lumped together followed by a shorter string of rainy days. It is not certain, but likely. 

2. How n-gram character model is designed with the help of Markov chain?
An n-gram is a contiguous sequence of n items from a given sample of text or speech.
3. Write short notes on Natural Language processing and Decision Tree
Natural Language Processing
NLP can be characterized as a set of algorithms designed to explore, recognize and utilize text-
based information and identify insights for the benefit of the business operation. As such, natural
language processing and generation algorithms form a backbone for the majority of
computerized processes. NLP gives the computer the skills to understand informally written
queries, extract the meaning out of it, generate the responses of its own, perform requested tasks.
Decision Tree
A Decision tree is the denotative representation of a decision-making process. Decision trees in
artificial intelligence are used to arrive at conclusions based on the data available from decisions
made in the past. Further, these conclusions are assigned values, deployed to predict the course
of action likely to be taken in the future.
Decision trees are statistical, algorithmic models of machine learning that interpret and learn
responses from various problems and their possible consequences. As a result, decision trees
know the rules of decision-making in specific contexts based on the available data. The learning
process is continuous and based on feedback. This improves the outcome of learning over time.
This kind of learning is called supervised learning. Therefore, decision tree models are support
tools for supervised learning.
Thus, decision trees provide a scientific decision-making process based on facts and values
rather than intuition. In business, organizations use this process to make significant business
decisions.