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

  Part-1greatest common divisor show a recursive

part-1greatest common divisor show a recursive implementation of euclids algorithm for finding the greatest common

  Write the algorithm which takes as input npda

Write the algorithm (described informally) which takes as input NPDA A and determines whether the language of A is nonempty.

  Decryption speed and diffie-hellman

Increase of a single bit in the size of the encryption key doubles the amount of needed computations - Show how the recipient of the message, who knows e, produces the plaintext.

  Dynamic-programming algorithm for rod-cutting problem

Consider a modification of the rod-cutting problem in which, in addition to a price pi for each rod, each cut incurs a fixed cost of c. Give a dynamic-programming algorithm to solve this modified problem.

  Describe an algorithm that takes as input a list of n

Describe an algorithm that takes as input a list of n distinct integers and finds the location of the largest even integer in the list or returns 0 if there are no even integers in the list.

  E is said to be a bottleneck edge if increasing

In a flow network G(V,E) with source s and sink t, an edge e in E is said to be a bottleneck edge if increasing the capacity of the edge e increases the maximum flow value in the network.

  Efficient algorithm that achieves goal using base station

So that every house is within four miles of one of the base stations. Write efficient algorithm that achieves this goal, using as few base stations as possible.

  What do you meant by an rfp

Select a specific category of vertical applications to investigate. Use the Internet and any other sources of information you might have to study some of the different products that are available in that category.

  Prepare the initial linked list of students and grades

Write a C program which initially presents menu of choices for the user. Menu must consist of the following choices: Prepare the initial linked list of students and grades.

  Draw flowchart to print average for each student

Draw a flowchart to print the average for each student in a class. Input. Input consists of student records each containing a student's name(STUDENT-NAME), score for first test(TEST), score for second test(TEST2), and score for third test(TEST3)..

  How the regular tree walk algorithm works

We know how the regular tree walk algorithm works. If you have some values in the tree then the tree walk algorithm prints everything in order

  Design a property database using microsoft access

Database window opens, then type the word Client as the name for this file where the cursor is blinking, then click the create bottom.

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