Scribd Logo
Upload

Welcome to Scribd!

  • 438 views

    Gujarat Technological University

    Uploaded by

    feyayel988
    This document is an exam for a pattern recognition course, consisting of 5 questions worth a total of 70 marks. Question 1 asks students to define supervised/unsupervised/reinforcement learning, find eigen values/vectors of a matrix, and discuss pattern recognition applications. Question 2 covers Bayesian learning, minimum error rate classification, and Bayesian decision theory expressions. Question 3 defines training/test/validation datasets, discusses Expectation Maximization and hierarchical clustering algorithms. Question 4 addresses support vector machines and overcoming the "curse of dimensionality", and demonstrates k-means clustering. Question 5 defines neural network weights/biases/activations, discusses support vector machines and decision trees.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    Gujarat Technological University

    Uploaded by

    feyayel988
    438 views2 pages
    This document is an exam for a pattern recognition course, consisting of 5 questions worth a total of 70 marks. Question 1 asks students to define supervised/unsupervised/reinforcement learning, find eigen values/vectors of a matrix, and discuss pattern recognition applications. Question 2 covers Bayesian learning, minimum error rate classification, and Bayesian decision theory expressions. Question 3 defines training/test/validation datasets, discusses Expectation Maximization and hierarchical clustering algorithms. Question 4 addresses support vector machines and overcoming the "curse of dimensionality", and demonstrates k-means clustering. Question 5 defines neural network weights/biases/activations, discusses support vector machines and decision trees.

    Original Title

    3171613

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document is an exam for a pattern recognition course, consisting of 5 questions worth a total of 70 marks. Question 1 asks students to define supervised/unsupervised/reinforcement learning, find eigen values/vectors of a matrix, and discuss pattern recognition applications. Question 2 covers Bayesian learning, minimum error rate classification, and Bayesian decision theory expressions. Question 3 defines training/test/validation datasets, discusses Expectation Maximization and hierarchical clustering algorithms. Question 4 addresses support vector machines and overcoming the "curse of dimensionality", and demonstrates k-means clustering. Question 5 defines neural network weights/biases/activations, discusses support vector machines and decision trees.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    438 views2 pages

    Gujarat Technological University

    Uploaded by

    feyayel988
    This document is an exam for a pattern recognition course, consisting of 5 questions worth a total of 70 marks. Question 1 asks students to define supervised/unsupervised/reinforcement learning, find eigen values/vectors of a matrix, and discuss pattern recognition applications. Question 2 covers Bayesian learning, minimum error rate classification, and Bayesian decision theory expressions. Question 3 defines training/test/validation datasets, discusses Expectation Maximization and hierarchical clustering algorithms. Question 4 addresses support vector machines and overcoming the "curse of dimensionality", and demonstrates k-means clustering. Question 5 defines neural network weights/biases/activations, discusses support vector machines and decision trees.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 2

    Seat No.: ________ Enrolment No.

    ___________

    GUJARAT TECHNOLOGICAL UNIVERSITY


    BE - SEMESTER–VII (NEW) EXAMINATION – WINTER 2021
    Subject Code:3171613 Date:29/12/2021
    Subject Name:Pattern Recognition
    Time:10:30 AM TO 01:00 PM Total Marks: 70
    Instructions:
    1. Attempt all questions.
    2. Make suitable assumptions wherever necessary.
    3. Figures to the right indicate full marks.
    4. Simple and non-programmable scientific calculators are allowed.

    MARKS
    Q.1 (a) Define supervised, unsupervised and reinforcement learning 03
    techniques
    (b) For the given matrix A, find out Eigen values and Eigen vectors. 04

    (c) What is pattern recognition? List out various applications of pattern 07


    recognition. Discuss any one in detail.

    Q.2 (a) Describe Bayesian leaning in pattern recognition. 03


    (b) Write a short note on Minimum error rate classification. 04
    (c) Give the expression and explain all parameters of univariate and 07
    multivariate normal density in context of Bayesian decision theory.
    OR
    (c) Apply Bayes’ Minimum Risk Classifier following data : P(ω1) =0.3, 07
    P(ω2) =0.7, P(x) = 0.545, P(x|ω1) = 0.65, P (x|ω2) =0.5 and the loss
    matrix values are

    Find the likelihood ratio and apply Bayesian Decision rule to decide
    the class ω1 or ω2? Also find the Bayes risk R(α2|x).
    Q.3 (a) Define the following terms w.r.t classification 03
    (1) Training Dataset,
    (2) Test Dataset,
    (3) Validation Dataset
    (b) Discuss working of Expectation Maximization algorithm. 04
    (c) Discuss Hierarchical clustering in detail. 07
    OR
    Q.3 (a) What is the significance of Hidden Markov Models in classifier 03
    design?
    (b) What is k-NN classification algorithm? 04
    (c) Discuss various criterion functions for clustering 07

    Q.4 (a) How can we identify the decision planes using support vector 03
    machine?
    (b) What is “curse of dimensionality”? How to overcome this? 04
    (c) Demonstrate working of k-means algorithm with suitable example. 07
    OR
    1
    Q.4 (a) Describe linearly separable and linearly inseparable classification 03
    problems.
    (b) Discuss the concept of a Perceptron with a neat diagram. 04
    (c) Discuss the Principle Component Analysis for dimensionality 07
    reduction
    Q.5 (a) Define the terms: weights, bias, activations with respect to neural 03
    networks
    (b) Discuss the working of support vector machines. What are its 04
    advantages?
    (c) Illustrate the working of a decision tree learning algorithm. 07
    OR
    Q.5 (a) What are the advantages of decision tree learning? 03
    (b) What is pruning in decision tree construction? Explain its 04
    significance.
    (c) Discuss multilayer feed-forward neural networks with neat 07
    architecture diagram

    You might also like