Scribd Logo
Upload

Welcome to Scribd!

  • 28 views

    Be Winter 2022

    Uploaded by

    NIKUNJ KANZARIYA
    This document contains an exam for a Pattern Recognition course, consisting of 5 questions with 3 parts each. It tests students on key concepts of pattern recognition, machine learning, and neural networks. Some of the topics covered include auto-correlation, dimensionality reduction, k-means clustering, principal component analysis, perceptrons, support vector machines, decision trees, hidden Markov models, and convolutional neural networks. The exam is worth a total of 70 marks and tests both conceptual understanding and practical applications of pattern recognition algorithms.

    Copyright:

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

    Be Winter 2022

    Uploaded by

    NIKUNJ KANZARIYA
    28 views2 pages
    This document contains an exam for a Pattern Recognition course, consisting of 5 questions with 3 parts each. It tests students on key concepts of pattern recognition, machine learning, and neural networks. Some of the topics covered include auto-correlation, dimensionality reduction, k-means clustering, principal component analysis, perceptrons, support vector machines, decision trees, hidden Markov models, and convolutional neural networks. The exam is worth a total of 70 marks and tests both conceptual understanding and practical applications of pattern recognition algorithms.

    Original Title

    3171613-BE-WINTER-2022

    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 contains an exam for a Pattern Recognition course, consisting of 5 questions with 3 parts each. It tests students on key concepts of pattern recognition, machine learning, and neural networks. Some of the topics covered include auto-correlation, dimensionality reduction, k-means clustering, principal component analysis, perceptrons, support vector machines, decision trees, hidden Markov models, and convolutional neural networks. The exam is worth a total of 70 marks and tests both conceptual understanding and practical applications of pattern recognition algorithms.

    Copyright:

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

    Be Winter 2022

    Uploaded by

    NIKUNJ KANZARIYA
    This document contains an exam for a Pattern Recognition course, consisting of 5 questions with 3 parts each. It tests students on key concepts of pattern recognition, machine learning, and neural networks. Some of the topics covered include auto-correlation, dimensionality reduction, k-means clustering, principal component analysis, perceptrons, support vector machines, decision trees, hidden Markov models, and convolutional neural networks. The exam is worth a total of 70 marks and tests both conceptual understanding and practical applications of pattern recognition algorithms.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    You are on page 1of 2

    Seat No.: ________ Enrolment No.

    ___________

    GUJARAT TECHNOLOGICAL UNIVERSITY


    BE - SEMESTER–VII (NEW) EXAMINATION – WINTER 2022
    Subject Code:3171613 Date:12-01-2023
    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 the term: “Auto-correlation”. 03
    (b) What is meant by “dimensionality reduction” of attributes? Explain its 04
    significance.
    (c) What is a “pattern”? Briefly discuss applications of Pattern Recognition. 07

    Q.2 (a) Explain “Maximum a Posteriori” estimation with respect to Bayes’ 03


    theorem.
    (b) Find the eigenvalues and corresponding eigenvectors for the matrix A = 04
    2 2
    [ ].
    5 −1
    (c) Explain the Principal Component Analysis method for dimensionality 07
    reduction. What are the advantages of this method?
    OR
    (c) With the help of suitable example explain the ‘k-means’ clustering 07
    algorithm. What are the limitations of this algorithm?
    Q.3 (a) Explain Minimum-error-rate classification in brief. 03
    (b) Give differences between supervised and unsupervised learning. 04
    Write a short note on Hierarchical clustering.
    (c) 07
    OR
    Q.3 (a) Define the term: “stationary process”. 03
    (b) Explain main characteristics of Fisher’s linear discriminant analysis. 04
    (c) Enlist and explain any two criterion functions for clustering. 07
    Q.4 (a) With the help of a diagram explain the working of a Perceptron. 03
    (b) Explain the Expectation-Maximization method for parameter 04
    estimation.
    (c) With the help of a neat diagram, discuss the topology of a multi-layer 07
    feedforward neural network.
    OR
    Q.4 (a) Define the following terms with respect to classification: 03
    (i) training set (ii) testing set
    (b) Explain classification using Support Vector Machines. 04
    (c) Write a short note on dictionary learning methods. 07
    Q.5 (a) What is k-NN learning? 03

    1
    (b) When does a Decision Tree require pruning? How can pruning be done? 04
    (c) Write a short note on Hidden Markov models. 07
    OR
    Q.5 (a) Explain “gradient descent” using a suitable analogy. 03
    (b) Write a short note on Convolutional Neural Networks. 04
    (c) Discuss Decision Tree learning based on the CART approach. 07

    *************

    You might also like