Machine Learning Techniques SQ-1L(cSAT-Sem-5)

Introduction
UNIT
(2 Marks Questions)

1.1. Define machine learning

n Machine learning is an application of artificial intelligence that
provides systems the ability to automatically learn and improve
from experience without being explicitly programmed.
1.2. What the different
are
types of machine learning
algorithm?
Ans Different types of machine learning algorithm are:
1. Supervised machine
learning algorithm
2. Unsupervised machine
learning algorithm
3. Semi-supervised machine learning
algorithm
Reinforcement machine learning algorithm
1.3. What are the
applications of machine learning?
Ans Applications of machine learning aare:
1. Image recognition
ne learning re:

2. Speech recognition
3. Medical diagnosis
4. Statistical arbitrage
5. Learning association

14. What are the advantages of machine learning ?

Ana1. Advantages of machine learning :
Easily identifies trends and patterns.
2. No human intervention is needed.
3. Continuous improvement.
4. Handling multi-dimensional and
multi-variety data.
15. What are the disadvantages of machine learning ?
A Disadvantages of machine learning:
1. Data acquisition
2 Time and resources
3. Interpretation of results
4. High error-susceptibility
s Q - 2 L ( C S / M T - S e m - 5 )
2 Marks Questions

learning role of machine in human life ?

1.6.
What is the
Role of machine learning
in human life:
Ans.
1. Learning
2. Reasoning
3. Problem solving
4. Language understanding

?
What are the components of machine learning system
17,
mponents of machine learning system are :
ns
1. Sensing
2. Segmentation
3. Feature extraction

4. Classification

5. Post processing
machine learning ?
the classes of problem in
1.8. What are
machine learning are:

Ans Classes of problem in

1. Classification

2. Regression
3. Clustering
4. Rule extraction
?
with machine learning
1.9. What are the issues related
with machine learning are:
Ans Issues related
1. Data quality
2. Transparency
3. Traceability
results
4. Reproduction of

learning.
1.10. Define supervised associative learning,
in which
is also known as and matching
Ans Supervised learning it with input
network is trained by providing
the
output patterns.
learning?
in which
1.11. Define unsupervised known a s
self-organization,
also within the
learning is c l u s t e r s of pattern
ADs Unsupervised respond to
a n output unit
is trained to

input.
learning problem.
Define well
defined
from experience E
with respect
12. program
is said to learn
measure P, if its
performance
Acomputer and improves with
tasks T
to some class of measured by P,
in T, as
performance at tasks
experience E.
 SQ-3 L(CS/IT-Sem.
Machine Learning Techniques

features of learning problems ?

1.13. What are the
are:
problems
Ans Features of learning
1. The class of tasks (T).
be improved (P).
performance to
2. The m e a s u r e of
3. The source of experience (E).

1.14. Define decision tree

learning.
Ans Decision tree learning is the predictive modeling approaches.used
in statistics, data mining and machine learning. It uses a decisin
item to conclusions about #
from observations about an
tree to go he
item's target values.

1.15. What is decision tree ?

Ans. Adecision tree is a decision support tool that uses a tree-like model
of decisions and their possible consequences, including chance event
outcomes, resource costs and utility.

1.16. What are the types of decision tree ?

Ans There are two types of decision tree:
1. Classification tree
2. Regression tree

1.17. Define classification tree and regression tree.

Ans Classification tree : A classification tree is an algorithm
the target variable is fixed. This algorithm is used where
to identify the
class within which a target variable would
fall.
Regression tree : A regression tree is an algorithm where
target variable is not fixed and this algorithm is used to predictthe
1s
value.

1.18. Name different

decision tree algorithm.
Ans Different
1. ID3
decision tree algorithms are:
2. C4.5
3. CART

1.19. What are the issues

related with the decision tree
sQ4LCS/IT-Sem-5) 2 Marks Questions

Issues related with decision tree are:

1. Missing data
2 Multi-valued attribute

Continuous and integer valued input

attributes
3
Continuous-valued output attributess
4.

used in decision
are the attribute selection measures

120. What
tree ?
are:
used in decision tree
Attribute selection
measures

AN
1. Entropy
2. Information gain
3. Gain ratio
Machine Learning Techniques SQ-5L(CS/AT-Sem.

2
UNIT (2 Marks Questions
Regressio-

regression.
2.1. Define the term
in finance, investina and
Ans Regression is a statistical method used
determine the strength and
to
other disciplines that attempts
character of the relationship
between one dependent variable and
a series of other
variables (known as independent variables).

2.2. What are the types of regression ?

Ans Following are the types of regression:

1. Linear regression
2. Logistic regression

2.3. Define logistic regression.

Ans Logistic regression is a supervised learning classification algorithm
used to predict the probability of a target variable. The nature o

target or dependent variable is dichotomous, which means there

would be only two possible classes.

2.4. What are the

types of logistic regression ?
Ans Following are the types of logistie regression:
1. Binary or Binomial logistic regression
2. Multinomial logistic regression
3. Ordinal logistie
regression
2.5. Define Bayesian
decision theory.
Anss Bayesian to
decision
the problem of theory is a fundamental statistical approd
oach

b a s e do n

pattern classification. This

quantifying the tradeoffs between various approaach deciso
us classificati
s i o n s

using probability and

costs that ecisions.

accompany sucn a
sQ-6L (CS/TT-Sem-5) 2 Marks Questions

Bayesian belief network.

2.6. Define

Ans
Bayesian belief networks specify joint conditional probability
distributions. They are also known as Belief Networks, Bayesian
Networks, or Probabilistic Networks.

EM algorithm.
2.7. Define
is an iterative way
The Expectation-Maximization (EM) algorithm
An model parameters when
tofind maximum-likelihood estimates for has
has some missing data points or
the data is incomplete
or

some hidden variables.

the usages of EM algorithm

?
2.8. What are

are:
Usages of EM algorithm
A data in a sample.
1. It be used to fill the missing
can
of clusters.
used a s the basis of
unsupervised learning
2. It c a n be of
for the purpose of estimating the parameters
3. It can be used
(HMM).
Hidden Markov Model variables.

4.It can be used for discovering

the values of latent
?
of EM algorithm
2.9. What are the advantages
are:

Ans Advantages of EM algorithm

likelihood will increase with each
that
I. It is always guaranteed
iteration.
implementation.
are easy
2. The E-step and M-step closed form.
exist in the
3. Solutions to the M-steps

?
disadvantages
of EM algorithm
210. What are the
are:
algorithm
Disadvantages of EM
A
1. It has slow convergence.
to the
local optima only. (numerical
backward
t makes convergence

forward and
probabilities,
ltrequires both the forward
probability).

optimization requires only

machine. learningg
support vector
machine

Define supervised data for

machine
is a analyzes
sorts,
A upport vector and
S data
looks at
that analysis.
EOithm
Classification and regression
Machine Learning Techniques
SQ-7L(CSIT-SSem-
machine ?
vector machir
of s u p p o r t
are
the types
What are:
212 machine
vector
GTypes ofsupport machine
vector
Linear support
1. machine
vector
Non-linear support
2

SVM?
the applications of
2.13. What are

Aa Applications of SVM:
classification
1. Text and hypertext
2 Image classification
characters
3. Recognizing handwritten
4. Biological sciences, including protein classification
SQ-8L Cs/IT-Sem-5)
2 Marks Questions

3
UNIT
Decision Tree Learning
(2 Marks Questions)

1, What is instance-based learming ?

Instance-Based Learning (IBIL) is an
neighbour or KNN classification algorithmsextension of nearest
that do not maintain
a set of abstraction of model
created from the instances.
3.2. What are the advantages of KNN algorithm ?
ANE Advantages of KNN algorithm are
1. Notraining period.
2. Since the KNN algorithm requires no
training before making
predictions, new data can be added seamlessly which will not impact
the accuracy of the algorithm.
3. KNN is easy to implement.

33. What are the disadvantages of KNN algorithm ?

AunE1. Disadvantages of KNN algorithm are

It is does not work well with large dataset.
2. It is does not work well with high dimensions.
3. It need feature scaling.
4. It is sensitive to noisy data, missing values and outliers.

34. Define locally weighted regression.

method
Locally Weighted Regression (LWR) is a memory-based
that performs a regression around a point of interest using training
data that are local to that point.

3.5. Define radial basis function.

a real
a function that assigns
A Radial Basis Function (RBF) is
is a real-value function), and
value to each input from its domain (it it is
an absolute value i.e.,
the value produced by the RBFis always
a measure of distance and cannot
be negative.

algorithms.
Define case-based learning input
as a sequence of
contain
ase-based learning algorithms a concept description, whichc a n be

a n i n g cases and as output

Machine Learning Techniques

used to generate predictions ofgoal feature

sQ-9L(CSIT-Sem.em-5)
lues for subs
presented cases. iently
3.7. What are the disadvantages of CBL (Caso
Learning) ? Based
Disadvantage of case-based learning algorithm:
1. They are computationally expensive because they save and com.
similarities to all training cases. npute
2. They are intolerant of noise and irrelevant features.
3. They are sensitive to the choice
of the algorithm's similarity funeti.
4. There is no simple way they can
process symbolic ction.
valued featun
values. ture

3.8. What the functions

are
of CBL?
AnS Functions of
1. Pre-processor
case-based learming algorithm are:
2. Similarity
3. Prediction
4. Memory updating

3.9. What the

ANS
are
processing stages of CBL ?
1.
Case-based
Case retrievallearning algorithm processing stages are:
2. Case adaptation
3. Solution evaluation
4. Case-base updating

3.10. What are the benefits of CBL as lazy problem solving

method?
The benefits of CBL
as a
1. Ease of lazy Problem solving method are
2. Absenceknowledge
of
elicitation.
problem-solving bias.
3. Incremental learning
4.
Suitability for complex and
5.
Suitability for sequential not-fully formalized solution space
explanation. problem solving.
6. Ease of
7. Ease of
maintenance.
3.11. What are the
1. Applications ofapplications
Interpretation CBL: of CBL ?
2. Classification
3. Desigm
4. Planning
5. Advising
- 1 0 L( C S A T - S e m - 4
2 Marks Questions

What are
advantages of instance-based learning?
are the
the
19
12.
What
of instance-based learning:
Advantages
trivial
Learning is
1.
2 Works efficiently
3. Noise r e s i s t a n t
surfaces
arbitrary decision
ARich representation,
understand
to
5. Easy
learning?
a r e the
disadvantages ofinstance-based
13. What instance-based
learning:
D i s a d v a n t a g e s of
data.
Need lots of
cost is high.
Computational
2 R".
e
Restricted to x normalization).
3. attributes (need
weights of
ie., require large
memory.
4. Implicit for storage
5. Need large
space
time.
application
6. Expensive
Machine Learning Techniques sQ-11L(CSAT-Sen

4
UNIT
Artificial Neura
(2 Marks Questions
Network

4.1. What are neurons?

signals f
Ans Aneuron is small cell that receives electro-chemical
a

its various sources and in

return responds by transmitting electriesl
impulses to other neurons.
?
4.2. What is artificial neural network
Ans Artificial neural network are computational algorithm that intended
to simulate the behaviour of biological systems composed of neurons

4.3. Give the difference between supervised and unsupervised

learning in artificial neural network.
Ans

S. No. Supervised learning Unsupervised learning

1. It uses known and labeled It uses unknown data as input.
data as input.
2. It uses offline analysis. It uses real time analysis of data.
3. umber of classes
known.
is Number of classes is not know
4 Accurate and reliable
Moderate accurate and
results. rena
results.

4.4. Define
activation function.
Ans An
used for activation function is the basic element in Itis

limiting the amplitude of the neural

called squashing function. output of a neu
4.5. Give
types of activation function.
A Types of
activation function:
1. Signum function
sQ-12L(CSTT-Sem
IT-Sem-5) 2 Marks Questions

2. Sigmoidal function

3. Identity function

step function
4. Binary
step function
5. Bipolar

advantages of neural network.

4.6. Give

AnS
Advantages of neural network:
network can perform tasks that a linear program cannot.
1. A neural
be implemented in any application.
2. It can
need to be reprogrammed.
neural network learns and does not
3. A

network (NN)?
are disadvantages of neural
4.7. What
network:
Ans.
Disadvantages of neural
needs training to operate.
neural network
1. The
processing time
for large NN.
2. It requires high
techniques
and
soft computing
various types of network.
4.8. List the
neural for
areas
some
application
mention
techniques:
computing
Ans Types of soft
control
1. Fuzzy logic
2. Neural network

3. Genetic algorithms
machine
vector
4. Support network:

Application
areas for neural
1. Speech recognition
2. Character recognition
application
verification

3. Signature
recognition
4. Human face
the parts.
explain
N N and
biological
4.9. Drawa
n e u r o n s

biological

Ans are
made up ofreal system.
n e t w o r k s n e r v o u s
of
group
neural peripheral of a
in the
composed
1ological
c o n n e c t e d
network
is n e u r o n s .

nat are neural a s s o c i a t e d

biological f u n c t i o n a l l y

2. In general a
c o n n e c t e d
or

emically
M a c h i n e L e a r n i n g T e c h n i q u e s
SQ-13L(CST..
sQ-14 L (CS/IT-Se

Axon Dendrites
Cell body (Soma)

Fig. 4.9.1.

network has
three major parts:
biological neural
A
cell's nucleus and o
It contains the sther vità
Soma o r cell body:
1. which perform specialized
called organelles
components
tasks
It forms a tree like structure that pread out
2 A set of dendrites: 4.13. What
from the cell. The neuron receives its input electrical signal.along
Neur=
these set of dendrites. into
extension from the cell (Soma) that carriesm funct
3 Axon: It is tabular
electrical signal away from Soma to another neuron for processine the
tran

4.10. What is single layer feed forward network?

4.14. Wh
Single layer feed forward network is the simplest form of a layered Fo
network where an input layer of source nodes that projects onto an
1. Sin
output layer of neurons, but not vice versa.
2. Mu
3. Si
4.11. Write different
applications of neural networks (NN). 4. Si
Applications of NN are: 5. M
1. Image recognition

2. Data mining 4.15.

3. Machine translation
4. Spell checking
5. Stock and sport bet
6. Statistical modeling prediction 4.16.

4.12. Draw an
artificial neural 2.
An
Artificial network.
based Neuron del
3
structure Network a a computational moua
on the
(ANN)
and function
actions of
is
compuut networ

biologicali Ineural
4-14L (CSAT-Sem-5)

2 Marks Questions

Hidden
Input

Output

Fig. 4.12.1.

4.13. What do you mean by neural network architecture ?

Neural network architecture refers to the
into arrangement of neurons
layers and the connection patterns between layers, activation
functions, and learning methods. The neural network model and
the architecture of a neural network determine how a network
transforms its input into an output.

4.14. What are the types of neuron connection ?

Ans Following are the types of neuron connection
1. Single-layer feed forward network

2 Multilayer feed forward network

3. Single node with its own feedback
4. Single-layer recurrent network
5. Multilayer recurrent network

4.16. What is gradient descent ?

used to minimize
AE Gradient descent is an optimization algorithm
in the direction of steepest
function by iteratively moving
Some the gradient.
esCent a s defined by
the negative of

descent ?
What are the types of gradient
are:
Types of gradient descent
Batch gradient descent
2 Stochastic gradient descent
3. Mini-batch gradient descent
Machine Learning Techniques
sQ-15 L(CSAT-Sem- s4
?
organizing map (SOM)
4.17. What is self

(SOM) provides a visualization teeh.

data
1. SelfOrganizing Map
which helps to understand high dimensional data by reducine
dimensions of data to a map.
2. SOM also represents clustering concept by grouping similar data
together.
sQ-16 L(CS/IT-Sem-5)
2 Marks Questions

5 UNITT
Reinforcement
Learning
(2 Marks Questions)

5.1. Define genetic algorithm.

Ans Genetic algorithms are
computerized search and
algorithm based on mechanics of natural genetics optimization
and natural
selection. These algorithms mimic the
principle of natural genetics
and natural selection to construct search and
optimization procedure.
5.2. Give the benefits of genetic
algorithm.
Benefits of genetic algorithm are:
1. They are Robust.
2. They provide optimization over large space state.
3. They do not break on slight change in input or presence of noise.

5.3. What are the applications of genetic algorithm ?

AR Following are the applications of genetic algorithms :
1. Recurrent neural network
2. Mutation testing
3. Code breaking
4. Filtering and signal processing
5. Learning fuzzy rule base

54. What are the disadvantages of genetie algorithm ?

Disadvantages of genetie algorithm:

1. Identification of the fitness function is difficult as it depends on the

problem.
2. The selection of suitable genetic operators isdifficult.

5.5. Define genetic programming.

Machine Learning Techniques
sQ-17L(CSAT-SerSem-g
Programming (GP)is
a
type of Evolutiono
Genetic
a subset of
machine As are nary Algorit)
learning. EA
used to
(EA),
solution to problems that human do not know howta discoy
solve.
5.6. What are the advantages ot genetic programmine ,
ing ?
An Advantages of genetie programming are:
1. In GP, the number of possible programs that can be c
the algorithm is immense. ructed by
2. Although GP uses machine code which helps in providino.
very fast but if any of the high level language is used
which ne esult
to be compile, and can generate errors and can make our
slow. prog
3. There is high probability that even a
a
very small variation has
disastrous effect on fitness of the solution generated. has.a

5.7. What the

disadvantages of genetic programming ?
are

AnsDisadvantages of geneticprogramming are

1. It does impose any fixed
length of solution, so the maximum
can be extended
up hardware limits.
to length
2. In genetic
programming
it is not necessary for an
have maximum
knowledge of the problem and theirindividual
solutions.
to

5.8. What are different types of genetic

A Different types programming?
of
1. Tree-based genetic genetic programming are:
2. Stack-based genetie
programming8
3. Linear genetic programming
4. programming
Grammatical evolution
5. Cartesian Genetic
6. Genetic Programming (CGP)
Improvement Programming (GIP)
5.9. What are the functions
of learning in
Funetion of learning in evolution
1. It
allows individuals to adaptevolution
oCcur in the
life span of changes in the that

2. It allows an
individual or acrossenviroatjons
few gene
3. It can
environmentevolution to use information extracte
thereby channeling
xtracted from the

help and guide evolutionary searci

evolution.
sQ-18L (CSAT-Sem-5) 2 Marks Questions

5.10. What are the disadvantages of learning in evolution ?

Ans Disadvantages of learning in evolution are:

1. A delay in the ability to acquire fitness.
2. Increased unreliability.

5.11. Define learnable evolution model.

Ans Learnable Evolution Model (LEM) is a non-Darwinian methodology
for evolutionary computation that employs machine learning to
guide the generation of new individuals (candidate problem
solutions).

5.12. What are different phases of genetic algorithm?

ANs Different phases of genetic algorithm a

1. Initial population
2. FA(Factor Analysis) fitness function

3. Selection
4. Crossover
5. Mutation
6. Termination

5.13. Define sequential covering algorithm.

Ans Sequential covering algorithm is a general procedure that repeatedly
learns a single rule to create a decision list (or set) that covers the
entire dataset rule by rule.

5.14. Define Beam search.

Beam search is a heuristic search algorithm that explores a graph
in a limited set.
by expanding the most promising node

5.15. What are the properties of heuristic search ?

search
AN Properties of heuristic
are:

1. Admissibility condition
2. Completeness condition
3. Dominance properties
4. Optimality property

5.16. What are different types ofreinforcement learning?

Machine Learning Techniques sQ-19L (CSAT-Sem-5)
Ans Different types of reinforcement learning are:

1. Positive reinforcement learning

2. Negative reinforcement learning

.17. What are the elements of reinforcement learning ?

Ans Elements of reinforcement learning are:

1. Policy (T) 2. Reward function (r)
3. Value function (V) 4. Transition model (M)

5.18. Define Q-learning.

Ans Reinforcement learning is the problem faced by an agent that
learn behaviour must
through trial-and-error interactions with a dynamic
environment, Q-learning is model-free reinforcement
it is
typically easier to implement. learning, and

5.19. Define
positive and negative reinforcement learning.
Ans Positive
reinforcement
learning is defined as when learning: Positive reinforcement
an event, occurs
behaviour such as, increases the due to a
particular
strength and the frequency
behaviour. of the
Negative reinforcement learning
defined as strengthening of a : Negative reinforcement is
is stopped or behaviour because a
avoided. negative condition