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

  Create and implement dynamic programming algorithm

Create and implement such dynamic programming algorithm and examine it. You are not sure if CEO must get invited to party, but you suspect that you might get fired if he is not.

  In this assignment you will write an essay on protein

in this assignment you will write an essay on protein requirements. begin by performing an internet search for high

  Data warehouse and operational databases

Every big organization has large documents or databases containing data used in operating the business. Does a data warehouse differ from these operational files or databases?

  Illustrate insertion into the linear hash file

Illustrate insertion into the linear hash file. Suppose that bucket splitting occurs whenever file load factor exceeds (is greater than) 0.8.

  What is global or per process page replacement algorithms

What is better global or per process page replacement algorithms?

  Creating algorithm broken into sequence of words

Katt wishes you to create an algorithm that, given a string X, determines efficiently how many ways X can be broken up into sequence of words.

  Creating a chart for it system

Make a chart that demonstrate the breakdown of the overall IT systems at a big corporation or breakdown a particular aspect of the IT systems such as the network or the business applications systems.

  Generalize 2-3 algorithms for insert and delete

Generalize the 2-3 algorithms for INSERT and DELETE to K-J trees, where non-leaf vertices have between K and J children for fixed integers K >=2, and J>= 2K-1.

  Computing available storage space

There are twenty gigabyte of space on a computer's hard disk. I transfer information via a telephone line (connection) at the rate of 14,400 bits per second.

  Part 11 how many cells can be in a computers main memory if

part 11. how many cells can be in a computers main memory if each cells address can be represented by two hexadecimal

  Question about arrays, vector and stl

Suppose if x denotes the mean of a sequence of numbers x1, x2,.....xn, variance is the average of the squares of the deviations of numbers from the mean.

  How long would it take to fill the available storage space

How many cells can be in a computer's main memory if each cell's address can be represented by two hexadecimal digits? What if four hexadecimal digits are used? Explain your answer.

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