Decision tree learninga describe the main steps in the

Assignment Help Data Structure & Algorithms
Reference no: EM13380328

Decision Tree Learning

(a) Describe the main steps in the basic decision tree learning algorithm. The table below contains a sample S of ten examples. Each example is described using two Boolean attributes A and B. Each is labelled (classi ed) by the target Boolean function.

1559_Decision Tree Learning.png

(b) What is the entropy of thse examples with respect to the given classi cation ?

[Note: you must show how you got your answer using the standard formula.] This table gives approximate values of entropy for frequencies of positive examples in a two-class sample.

1979_Decision Tree Learning1.png

(c) What is the information gain of attribute A on sample S above ?

(d) What is the information gain of attribute B on sample S above ?

(e) Which would be chosen as the \best" attribute by a decision tree learner using the information gain splitting criterion ? Why ?

(f) Describe a method for over tting-avoidance in decision tree learning.

Reference no: EM13380328

Questions Cloud

Quality building supply qbs has proposed a project to : quality building supply qbs has proposed a project to develop a business system.the project team has gathered the
Write a research paper excluding the title page on logical : write a research paper excluding the title page on logical circular and arithmetic shift operations. use an example not
Questionneural and tree learning on continuous attributesa : questionneural and tree learning on continuous attributesa in general feedforward neural networks multi-layer
Questionlearning for numeric predictiona let the weights of : questionlearning for numeric predictiona let the weights of a two-input perceptron be w0 02 w1 05 and w2 05.
Decision tree learninga describe the main steps in the : decision tree learninga describe the main steps in the basic decision tree learning algorithm. the table below contains
Concept learninga write an algorithm called find-g to nd a : concept learninga write an algorithm called find-g to nd a maximally-general consistent hypothesis. you can assume the
Well-posed machine learning problemsa what is required to : well-posed machine learning problemsa what is required to dene a well-posed learning problem ?b here are two potential
Message forwarding a computer in the computing department : message forwarding a computer in the computing department has just been turned on. the user starts up their web browser
Question - subnettingconsider the following scenarios -a : question - subnettingconsider the following scenarios -a you are an isp that has been assigned a class b network with

Reviews

Write a Review

Data Structure & Algorithms Questions & Answers

  Implement an open hash table

In this programming assignment you will implement an open hash table and compare the performance of four hash functions using various prime table sizes.

  Use a search tree to find the solution

Explain how will use a search tree to find the solution.

  How to access virtualised applications through unicore

How to access virtualised applications through UNICORE

  Recursive tree algorithms

Write a recursive function to determine if a binary tree is a binary search tree.

  Determine the mean salary as well as the number of salaries

Determine the mean salary as well as the number of salaries.

  Currency conversion development

Currency Conversion Development

  Cloud computing assignment

WSDL service that receives a request for a stock market quote and returns the quote

  Design a gui and implement tic tac toe game in java

Design a GUI and implement Tic Tac Toe game in java

  Recursive implementation of euclids algorithm

Write a recursive implementation of Euclid's algorithm for finding the greatest common divisor (GCD) of two integers

  Data structures for a single algorithm

Data structures for a single algorithm

  Write the selection sort algorithm

Write the selection sort algorithm

  Design of sample and hold amplifiers for 100 msps by using n

The report is divided into four main parts. The introduction about sample, hold amplifier and design, bootstrap switch design followed by simulation results.

Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd