Scribd
Upload
155 views2 pages

Machine Learning (15CS73) Question Bank: 6. Consider The Following Set of Training Examples

This document contains 12 questions about decision tree learning and the ID3 algorithm. The questions cover topics such as: representing Boolean functions as decision trees, defining decision trees and their appropriate problems, explaining entropy and information gain, writing the ID3 algorithm, identifying the root attribute using ID3, calculating entropy and information gain from training examples, defining inductive bias in ID3, handling continuous attributes and missing values, overfitting and pruning decision trees, and rule post-pruning.

Uploaded by

mohammed talib
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
155 views2 pages

Machine Learning (15CS73) Question Bank: 6. Consider The Following Set of Training Examples

This document contains 12 questions about decision tree learning and the ID3 algorithm. The questions cover topics such as: representing Boolean functions as decision trees, defining decision trees and their appropriate problems, explaining entropy and information gain, writing the ID3 algorithm, identifying the root attribute using ID3, calculating entropy and information gain from training examples, defining inductive bias in ID3, handling continuous attributes and missing values, overfitting and pruning decision trees, and rule post-pruning.

Uploaded by

mohammed talib
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/ 2

Machine Learning (15CS73)

Question Bank
Module 2

1. Give decision tree to represent the following Boolean functions


a. A   B b. A  [B  C] c. A XOR B
2. Define decision tree. Describe the appropriate problems for decision tree learning
3. Explain the concepts of entropy and information gain.
4. Write the ID3 algorithm specialized to learning Boolean valued function
OR
Design ID3 algorithm for Decision tree Learning
5. Using ID3 algorithm, identify the root attribute for the decision tree representation for the
training data set given in Table 1

6. Consider the following set of training examples:

a) What is the entropy of this collection of training examples with respect to the
target function classification
b) What is the information gain of a2 relative to these training examples?
c) Construct the decision tree

7. Define approximate inductive bias of ID3. Explain Restriction and Preference Bias .
8. List the issues in Learning decision trees and explain how to incorporate continuous
valued attributes in decision tree
9. List the issues in Learning decision tree with respect to information gain and explain the
alternative measures for selecting attributes in a decision tree
10. Define Over fitting. Explain the reduced pruning
11. Explain the Rule Post- pruning with example
12. State Occam’s razor. Explain how to handle attributes with missing values and differing
cost

You might also like