JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD B.Tech III MACHINE LEARNING Previous Question Paper (August - 2022 - R18)

B.Tech | III | I | R18 | August - 2022

Answer PaperPaper Code: 155BZMaximum Marks: 75Time: 3 Hours

Answer any five questions

All questions carry equal marks

Main

1

Explain the basic design issues and approaches to Machine learning with examples.

15 marks

Answer

Designing a machine learning system involves addressing several fundamental challenges to ensure the model learns effectively from data. The core design issues include:

  1. Choosing the Training Experience: Determining the nature of the data (direct or indirect feedback) and whether the learner controls the sequence of training examples. For instance, a game-playing agent might learn from its own moves (direct) or from the final win/loss outcome (indirect).
  2. Choosing the Target Function: Defining exactly what is being learned. In a checkers program, the target function could be the board state evaluation function, which assigns a numerical value to any given board position.
  3. Choosing a Representation for the Target Function: Selecting how to represent the learned function (e.g., linear polynomials, neural networks, or decision trees). A linear combination of board features is a common representation for checkers.
  4. Choosing an Approximation Algorithm: Deciding how to adjust the parameters of the representation to best fit the training data. This often involves optimization techniques like gradient descent to minimize the error between predicted and actual outcomes.

Approaches to machine learning are generally categorized based on the nature of the learning signal:

  • Supervised Learning: The model is trained on labeled data where the correct output is known. Example: Predicting house prices based on historical sales data (regression) or classifying emails as spam or not spam (classification).
  • Unsupervised Learning: The model identifies hidden patterns or structures in unlabeled data. Example: Customer segmentation based on purchasing behavior where no predefined categories exist.
  • Reinforcement Learning: The agent learns by interacting with an environment, receiving rewards or penalties for its actions. Example: Training a robot to navigate a maze or an AI to play video games by maximizing a cumulative reward signal.
2

Write a short note on:

15 marks
a

Concept Learning as Search

7 marks

Answer

Concept learning can be viewed as the task of searching through a predefined space of potential hypotheses to identify the one that best fits the training data. The hypothesis space consists of all possible concepts that could represent the target function. The search process involves navigating this space from general to specific or vice versa, guided by the training examples.

Key aspects of this search include:

  • General-to-Specific Ordering: Hypotheses are partially ordered by the generality relation. A hypothesis h1 is more general than or equal to h2 if every instance satisfied by h2 is also satisfied by h1.
  • Candidate Elimination Algorithm: This algorithm maintains the Version Space, which is the set of all hypotheses consistent with the training examples. It narrows the search by maintaining two boundaries: the G-set (most general) and the S-set (most specific).
  • Search Strategy: By using the partial ordering, the algorithm avoids exhaustive search, efficiently pruning the hypothesis space as new data is processed.
b

Inductive Bias in decision tree learning.

8 marks

Answer

Sign in to view the complete answer paper.

3

Explain Gradient Descent and the Delta Rule with:

15 marks
a

Derivation of Gradient Descent Rule

8 marks

Answer

Sign in to view the complete answer paper.

b

Approximation to Gradient Descent.

7 marks

Answer

Sign in to view the complete answer paper.

4

Explain the procedure to estimate the difference in error between two learning methods.

15 marks

Answer

Sign in to view the complete answer paper.

5

Explain Naïve Bayes Algorithm for learning and classifying text.

15 marks

Answer

Sign in to view the complete answer paper.

615 marks
a

Explain briefly k-nearest neighbor algorithm.

9 marks

Answer

Sign in to view the complete answer paper.

b

Compare and contrast Lazy and eager learning.

6 marks

Answer

Sign in to view the complete answer paper.

7

Explain General to specific beam search algorithm as implementation of Learn-one-rule.

15 marks

Answer

Sign in to view the complete answer paper.

8

Explain the PROLOG-EBG algorithm with example.

15 marks

Answer

Sign in to view the complete answer paper.

About this paper

This page contains the question paper of MACHINE LEARNING from JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD for B.Tech ITE III I, August - 2022, R18.

For the solved question paper with answers, switch to the Answer Paper tab.

Other papers in MACHINE LEARNING

Loading Question Papers

Fetching data from database...