Scribd
Upload
9 views1 page

Machine Learning Assignment: Overfitting & Decision Trees

This document contains an assignment for a Machine Learning course. It includes 6 questions asking students to define key concepts like overfitting, inductive bias, and entropy of a decision tree. It also asks students to compute information gain and structure a decision tree for a sample dataset. Finally, it asks students to explain the steps in designing a machine learning problem and analyze the checkers problem as an example.

Uploaded by

Ranjan
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
9 views1 page

Machine Learning Assignment: Overfitting & Decision Trees

This document contains an assignment for a Machine Learning course. It includes 6 questions asking students to define key concepts like overfitting, inductive bias, and entropy of a decision tree. It also asks students to compute information gain and structure a decision tree for a sample dataset. Finally, it asks students to explain the steps in designing a machine learning problem and analyze the checkers problem as an example.

Uploaded by

Ranjan
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

Department of Computer Science & Engineering

Assam Engineering College

Assignment No. 1
Semester: 8th
Subject name with cod
code: Machine Learning (CS 872)
872

Deadline for submission: 18th May 2020


1. What is overfitting?
2. Define the general boundary G with respect to hypothesis space H and training
data D.
3. Definee inductive bias of a concept learning algorithm.
4. What is entropy of a decision tree?
5. Consider the following dataset for predicting the value of EnjoySport for an
arbitrary day, based on the values of its other attributes.

I. Write the formula for information gain for an attribute. Compute


information gain for all attributes. Which is selected as a root node?

II. Compute the structure of the decision tree computed by ID3 algorithm.

6. What are the steps in designing a machine learning problem? E


Explain
xplain the checkers
problem.

-----------------------------------------------------------------------------------------------------------------------------

You might also like