Scribd
Upload
101 views4 pages

HT TP: //qpa Pe R.W But .Ac .In: Pattern Recognition

This document contains a question paper for the Pattern Recognition course CS/B.TECH(CSE)/SEM-8/CS-801F/2012. It has three sections: Section A contains 10 short answer questions, Section B contains 3 short essay questions, and Section C contains 3 long answer questions. The questions cover topics such as defining pattern recognition, feature vectors, clustering, linear discriminant analysis, Bayesian classification, performance indexes, and decision functions.

Uploaded by

Duma Dumai
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
101 views4 pages

HT TP: //qpa Pe R.W But .Ac .In: Pattern Recognition

This document contains a question paper for the Pattern Recognition course CS/B.TECH(CSE)/SEM-8/CS-801F/2012. It has three sections: Section A contains 10 short answer questions, Section B contains 3 short essay questions, and Section C contains 3 long answer questions. The questions cover topics such as defining pattern recognition, feature vectors, clustering, linear discriminant analysis, Bayesian classification, performance indexes, and decision functions.

Uploaded by

Duma Dumai
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/ 4

Name : ……………………………………………………………

htt
Roll No. : ……………………………………………..…………..
Invigilator's Signature : ………………………………………..

CS/B.TECH(CSE)/SEM-8/CS-801F/2012
p:/
2012
PATTERN RECOGNITION
Time Allotted : 3 Hours Full Marks : 70
/q

The figures in the margin indicate full marks.


pap
Candidates are required to give their answers in their own words as
far as practicable.

GROUP – A
er.

( Objective Type Questions )

1. Answer all questions in brief : 10 × 1 = 10


wb

i) Define Pattern Recognition.

ii) What is meant by an N-dimensional pattern space Ωx  ?

iii) What are likelihood functions ?


ut .

iv) What is clustering ?

v) What is feature vector ?


a c.

vi) What do you mean by feature extractor ?

vii) What is feature selection ?


in

8207 [ Turn over


CS/B.TECH(CSE)/SEM-8/CS-801F/2012

viii) What are the three learning paradigms in pattern


htt
recognition ?

ix) What are the approaches to pattern recognition ?


p:/
x) What do you mean by linear discriminate function ?
/q
GROUP – B
( Short Answer Type Questions )
pap
Answer any three of the following. 3 × 5 = 15

2. Explain Linear Discriminate Analysis ( LDA ).

3. Why is it necessary to establish some rules in the PR


er.

problem ? What is the way of representing rules ? 3+2


wb

4. Characterize the decision function when each class is

characterized by several prototypes.


ut .

5. What are the different measures of similarity of the

assignment of patterns for the domain of a particular cluster


a c.

centre ?

6. Explain maximum distance algorithm.


in

8207 2
CS/B.TECH(CSE)/SEM-8/CS-801F/2012

GROUP – C
htt
( Long Answer Type Questions )
Answer any three of the following. 3 × 15 = 45

7. a) Describe the basic steps involved in the design of


p:/
pattern recognition system.

b) What is the maximum likelihood ( ML ) estimation ?


Show that if the likelihood function is univariate
/q
Gaussian with unknowns the mean µ as well as
variance σ 2 , then ML estimates are given by
pap

1 1
µ=
N ∑   X k and σ 2 =  X  – µ ) 2 ,
N ( k
k = 1

where Xk is the kth pattern and N is the total number


er.

of training patterns.

c) Compare parametric and non-parametric techniques.


wb

6+5+4

8. a) What is Bayesian classifier ? Prove that it is an optimal


classifier.
ut .

b) In a two class problem with single feature X the


1
pdfs are Gaussian with variance σ 2 = for
2
a c.

both classes and mean value 0 and I respectively.


1
If P ( ω 1 ) = P ( ω 2 ) = , compute the threshold value
2
X0 for minimum error probability. 4+5+6
in

8207 3 [ Turn over


CS/B.TECH(CSE)/SEM-8/CS-801F/2012

9. a) Define performance index in cluster-seeking problem. 3


htt
b) Describe the isodata algorithm to categorize points in

different clusters. 12
p:/
10. a) What is the form and property of decision functions

when the classes are pair-wise separable ? 5


/q
b) Explain the classification in XOR problem using Linear

Discriminant Analysis ( LDA ). 10


pap
11. a) Describe the decision-making process in Pattern

Recognition which may be treated as a statistical game

played by the classifier against nature. 9


er.

b) What is the use of causal network ? Explain with an

example. 6
wb
ut .
a c.
in

8207 4

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy