JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD B.Tech III Year MACHINE LEARNING Previous Question Paper (February - 2022 - R18)
Answer any five questions. All questions carry equal marks.
Main
What do you mean by a well-posed learning problem?
Answer
A computer program is said to learn from experience E with respect to some class of tasks T and performance measure P, if its performance at tasks in T, as measured by P, improves with experience E. A problem is considered well-posed when these three components—the task, the performance measure, and the source of experience—are clearly and explicitly defined.
Explain the important features that are required to well-define a learning problem.
Answer
To well-define a learning problem, one must specify the following three key features:
- Task (T): This defines the specific activity the system is expected to perform. Examples include classifying emails as spam or predicting the price of a house. The task should be clearly delineated to identify what the system is learning to do.
- Performance Measure (P): This is a quantitative metric used to evaluate how well the system performs the task. For classification, this might be accuracy or error rate; for regression, it might be mean squared error. This measure provides the objective function that the learning algorithm aims to optimize.
- Experience (E): This represents the data or information provided to the system. It can be categorized as supervised (labeled data), unsupervised (unlabeled data), or reinforcement learning (interaction with an environment). The quality and quantity of this experience directly dictate the potential for the system to improve its performance.
By explicitly defining these three elements, a developer ensures that the learning process is measurable, the objective is clear, and the data source is appropriate for the intended goal.
Discuss about candidate elimination algorithm in detail with example.
Answer
Sign in to view the complete answer paper.
Elaborate the issues in Decision Tree learning.
Answer
Sign in to view the complete answer paper.
Demonstrate multilayer feed forward mechanism in back propagation with suitable example and how the error is back propagated.
Answer
Sign in to view the complete answer paper.
How to estimate hypothesis accuracy in artificial neural networks?
Answer
Sign in to view the complete answer paper.
Explain the methods for comparing the accuracy of two hypotheses.
Answer
Sign in to view the complete answer paper.
Explain in detail about Naïve Bayes algorithm for learning classification problems.
Answer
Sign in to view the complete answer paper.
Discuss Maximum Likelihood and Least Square Error Hypothesis.
Answer
Sign in to view the complete answer paper.
Demonstrate k-nearest neighbor algorithm with suitable example.
Answer
Sign in to view the complete answer paper.
What are the salient features of a Genetic Algorithm?
Answer
Sign in to view the complete answer paper.
Demonstrate sequential covering algorithm with suitable example.
Answer
Sign in to view the complete answer paper.
Demonstrate explanation-based learning of search control knowledge.
Answer
Sign in to view the complete answer paper.
Explain how to alter the search objective by using prior knowledge.
Answer
Sign in to view the complete answer paper.