0% found this document useful (1 vote)
2K views3 pages

Machine Learning Viva Questions With Answers

Uploaded by

johnw986687
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
0% found this document useful (1 vote)
2K views3 pages

Machine Learning Viva Questions With Answers

Uploaded by

johnw986687
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/ 3

Machine Learning Viva questions with answers

UNIT 1: Basics of Machine Learning and Decision Trees

1. What is a well-posed learning problem?


A learning problem is well-posed if it has a task, experience, and a performance measure that
improves with experience.

2. What are the steps in designing a learning system?

Choose the training experience.

Choose the target function.

Choose a representation for the target function.

Choose a learning algorithm.

3. What is concept learning?


Concept learning is the task of inferring a boolean-valued function from training examples.

4. What is the Find-S algorithm?


It is an algorithm that finds the most specific hypothesis consistent with the training examples.

5. What are version spaces?


Version spaces represent the set of all hypotheses consistent with the training examples.

6. What is inductive bias?


Inductive bias refers to the assumptions a learning algorithm makes to generalize beyond the
training data.

7. What is a decision tree?


A decision tree is a tree-like structure where internal nodes represent tests on attributes,
branches represent outcomes, and leaf nodes represent class labels.

8. What is the basic decision tree learning algorithm?


The algorithm recursively splits the data based on attribute values to maximize information gain
until a stopping condition is met.

---

UNIT 2: Artificial Neural Networks and Hypothesis Evaluation

1. What is an artificial neural network?


It is a computational model inspired by the structure and functions of biological neural networks.

2. What is a perceptron?
A perceptron is a simple neural network model for binary classification.

3. What is the backpropagation algorithm?


Backpropagation is a supervised learning algorithm used for training multilayer neural networks
by minimizing error using gradient descent.

4. What is sampling theory?


Sampling theory studies how to draw samples from a population to make inferences about the
population.

5. What is the purpose of confidence intervals in hypothesis evaluation?


Confidence intervals provide a range within which the true error of a hypothesis lies, with a
certain level of confidence.

6. What is the difference between lazy and eager learning?

Lazy learning delays generalization until a query is made (e.g., k-NN).

Eager learning builds a model in advance (e.g., decision trees).

---

UNIT 3: Bayesian Learning and Instance-Based Learning

1. What is Bayes' theorem?


Bayes' theorem calculates the probability of a hypothesis given evidence:

2. What is a Naive Bayes classifier?


It is a probabilistic classifier that assumes feature independence given the class label.

3. What is the EM algorithm?


The Expectation-Maximization (EM) algorithm finds maximum likelihood estimates for models
with latent variables.

4. What is the k-nearest neighbor algorithm?


It is an instance-based learning algorithm that classifies an instance based on the majority class
among its k-nearest neighbors.

5. What is the difference between lazy and eager learning?


Lazy learning stores data and performs generalization during a query, while eager learning
creates a model before queries.

---

UNIT 4: Genetic Algorithms, Rule Learning, and Reinforcement Learning


1. What is a genetic algorithm?
A genetic algorithm is an optimization technique inspired by natural evolution, involving
selection, crossover, and mutation.

2. What is Q-learning?
Q-learning is a reinforcement learning algorithm that learns an optimal action-value function for
a given environment.

3. What is temporal difference learning?


It is a reinforcement learning method that updates value estimates based on changes in
successive predictions.

4. What is FOIL in learning rule sets?


FOIL (First Order Inductive Learner) is an algorithm for learning logical rules from examples.

---

UNIT 5: Analytical Learning and Combining Approaches

1. What is explanation-based learning (EBL)?


EBL uses prior knowledge to explain why a training example is an instance of a target concept
and uses this explanation to generalize.

2. What is the role of prior knowledge in learning?


Prior knowledge helps guide the learning process by providing constraints or augmenting the
hypothesis space.

3. What is inductive-analytical learning?


It combines inductive generalization and analytical reasoning using prior knowledge to improve
learning efficiency.

4. What is PROLOG-EBG?
PROLOG-EBG is an explanation-based learning method that uses logic programming to derive
generalizations.

---

These questions are designed to assess foundational understanding in a simple and direct
manner. Let me know if you'd like more detailed answers or additional questions!

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