17CS73 Machine Learning Question With Answers Module 2
MODULE 2 – DECISION TREE LEARNING
1. What is decision tree and decision tree learning?
2. Explain representation of decision tree with example.
3. What are appropriate problems for Decision tree learning?
4. Explain the concepts of Entropy and Information gain.
5. Describe the ID3 algorithm for decision tree learning with example
6. Give Decision trees to represent the Boolean Functions:
- A && ~ B
- A V [B && C]
- A XOR B
- [A&&B] V [C&&D]
7. Give Decision trees for the following set of training examples
Day | Outlook | Temperature | Humidity | Wind | PlayTennis |
D1 | Sunny | Hot | High | Weak | No |
D2 | Sunny | Hot | High | Strong | No |
D3 | Overcast | Hot | High | Weak | Yes |
D4 | Rain | Mild | High | Weak | Yes |
D5 | Rain | Cool | Normal | Weak | Yes |
D6 | Rain | Cool | Normal | Strong | No |
D7 | Overcast | Cool | Normal | Strong | Yes |
D8 | Sunny | Mild | High | Weak | No |
D9 | Sunny | Cool | Normal | Weak | Yes |
D10 | Rain | Mild | Normal | Weak | Yes |
D11 | Sunny | Mild | Normal | Strong | Yes |
D12 | Overcast | Mild | High | Strong | Yes |
D13 | Overcast | Hot | Normal | Weak | Yes |
D14 | Rain | Mild | High | Strong | No |
8. Consider the following set of training examples.
- What is the entropy of this collection of training examples with respect to the target function classification?
- What is the information gain of a2 relative to these training examples?
Instance | Classification | a1 | a2 |
1 | + | T | T |
2 | + | T | T |
3 | – | T | F |
4 | + | F | F |
5 | – | F | T |
6 | – | F | T |
9. Identify the entropy, information gain and draw the decision trees for the following set of training examples
Gender | Car ownership | Travel cost | Income Level | Transportation (Class) |
Male | Zero | Cheap | Low | Bus |
Male | One | Cheap | Medium | Bus |
Female | One | Cheap | Medium | Train |
Female | Zero | Cheap | Low | Bus |
Male | One | Cheap | Medium | Bus |
Male | Zero | Standard | Medium | Train |
Female | One | Standard | Medium | Train |
Female | One | Expensive | High | Car |
Male | Two | Expensive | Medium | Car |
Female | Two | Expensive | High | Car |
10. Construct the decision tree for the following tree using ID3 Algorithm,
Instance | a1 | a2 | a3 | Classification |
1 | True | Hot | High | No |
2 | True | Hot | High | No |
3 | False | Hot | High | Yes |
4 | False | Cool | Normal | Yes |
5 | False | Cool | Normal | Yes |
6 | True | Cool | High | No |
7 | True | Hot | High | No |
8 | True | Hot | Normal | Yes |
9 | False | Cool | Normal | Yes |
10 | False | Cool | High | Yes |
11. Discuss Hypothesis Space Search in Decision tree Learning.
12. Discuss Inductive Bias in Decision Tree Learning.
13. What are Restriction Biases and Preference Biases and differentiate between them.
14. Write a note on Occam’s razor and minimum description principal.
15. What are issues in learning decision trees
Summary:
Her you find the Machine Learning Question With Answers Module 2.
Im not able to find machine learning questions with answers
Working on it will be uploaded soon