Question

Consider the following data set containing examples e1.,.... e5, each comprised of three binary input attributes (x1,x2,x3) and one output label Examplex1 x2 x3 Output y 1 0 1 0 0 1 0 0 e4 e5 1 101 Construct a decision tree for this data set. Compute information gain for each attribute. Select the attribute with the highest information gain as the root node. Then recursively create the children by recomputing information gain for each remaining attribute. Repeat this procedure until no more decision is necessary or possible. Show all necessary information gain calculations in each step.

0 0
Add a comment Improve this question Transcribed image text
Answer #1

Answer: s ame mgdel t ellet r43e a mens tabl dags ey -0:932

Add a comment
Know the answer?
Add Answer to:
Consider the following data set containing examples e1.,.... e5, each comprised of three binary input attributes...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
  • Consider the following data set which will be used for a binary classification problem where the ...

    Consider the following data set which will be used for a binary classification problem where the goal is to predict whether a house will sell within 6 months Sold Age Overrpriced Features Location 50 90 60 60 70 80 50 90 80 80 60 70 None Edinburgh None None Aberdeen GarageDundee Garage Edinburgh Pool Edinburgh] PoolInverness None Inverness Garage Edinburgh Garag PoolAberdeen Glagsow e Edinburgh Dundee 1. What is the initial entropy of the Sold variable? 2. If we classify...

  • Can you give me a poste for Science Writing TOPIC: DECISION TREE Decision Tree Algorithm Pseudocode:-...

    Can you give me a poste for Science Writing TOPIC: DECISION TREE Decision Tree Algorithm Pseudocode:- 1) Place the best attribute of the dataset at the root node of the tree. 2) Split the training set into subsets. Subsets should be make in such a way that each subset contains data with the same value for an attribute. 3) Repeat steps 1 and 2 on each subset until you find leaf nodes in all the branches of the tree. Two...

  • Given the following six instances each with five attributes (Outlook, Temperature, Humidity, Wind, Day) and one...

    Given the following six instances each with five attributes (Outlook, Temperature, Humidity, Wind, Day) and one class label, calculate Entropy of the whole system • calculate Information gain for attribute "Outlook" • calculate Gini-index for attribute "Outlook" • What is the information gain and Gini-index for attribute “Day Explain why “Day" is NOT a good feature being used as the root node of a decision tree. How to avoid using “Day” as the root node to create the tree ID...

  • . Question 3 (5 pts]: Given the following six instances cach with five attributes (Outlook, Temperature,...

    . Question 3 (5 pts]: Given the following six instances cach with five attributes (Outlook, Temperature, Humidity, Wind, Day) and one class label, calculate Entropy of the whole system [1 pt] • calculate Information gain for attribute "Outlook" [1 pt] • calculate Gini-index for attribute "Outlook" [1 pt] What is the information gain and Gini-index for attribute "Day" [pt] • Explain why "Day" is NOT a good feature being used as the root node of a decision tree. How to...

  • IN JAVA 2 A Binary Search Tree The goal of this lab is to gain familiarity...

    IN JAVA 2 A Binary Search Tree The goal of this lab is to gain familiarity with simple binary search trees. 1. Begin this lab by implementing a simple class that represents a "node” in a binary search tree, as follows. public class MyTreeNode<t extends Comparable<T>> { public T data; public MyTreeNode<T> leftchild; public MyTreeNode<T> rightChild; public MyTreeNode<T> parent; 2. Have the second member of your pair type in the code for the simple binary search tree interface. public interface...

  • I need help in C++ implementing binary search tree. I have the .h file for the...

    I need help in C++ implementing binary search tree. I have the .h file for the binary search tree class. I have 4 classic texts, and 2 different dictionaries. Classic Texts: Alice In Wonderland.txt A Tale of Two Cities.txt Pride And Prejudice.txt War and Peace.txt 2 different dictionaries: Dictionary.txt Dictionary-brit.txt The data structures from the standard template library can not be used.The main program should open the text file, read in the words, remove the punctuation and change all the...

  • Can someone please help me with the following: Implement a Binary Search Tree that can be...

    Can someone please help me with the following: Implement a Binary Search Tree that can be used to store data values that are strings. The data values will be stored in nodes in a binary search tree. Each node will have a unique integer key. Provide functions to add, get and remove elements to/from the tree. Also provide functions to print the elements (both the key and the data values) in forward (dump) and reverse (dump_rev) order. To help in...

  • C++ Binary Search Tree question. I heed help with the level 2 question please, as level...

    C++ Binary Search Tree question. I heed help with the level 2 question please, as level 1 is already completed. I will rate the answer a 100% thumbs up. I really appreciate the help!. Thank you! searching.cpp #include <getopt.h> #include <iostream> #include <sstream> #include <stdlib.h> #include <unistd.h> using namespace std; // global variable for tree operations // use to control tree maintenance operations enum Mode { simple, randomised, avl } mode; // tree type // returns size of tree //...

  • C++ Binary Search Tree question. I heed help with the level 2 question please, as level...

    C++ Binary Search Tree question. I heed help with the level 2 question please, as level 1 is already completed. I will rate the answer a 100% thumbs up. I really appreciate the help!. Thank you! searching.cpp #include <getopt.h> #include <iostream> #include <sstream> #include <stdlib.h> #include <unistd.h> using namespace std; // global variable for tree operations // use to control tree maintenance operations enum Mode { simple, randomised, avl } mode; // tree type // returns size of tree //...

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT