Decision tree - id3 algorithm, Data Structure & Algorithms

Decision Tree - ID3 algorithm:

Imagine you only ever do one of the following four things for any weekend:

  •   go shopping
  •   watch a movie
  •   play tennis
  •   just stay in

What you do depends on three factors:
 
1. weather (windy, rainy or sunny) 
 
2. how much money you have (rich or poor) 
 
3. whether your parents are visiting (yes or no) 
 
You say to yourself: if my parents are visiting, we'll go to the cinema. If they're not visiting and it's sunny, then I'll play tennis, and so on.
 
Suppose we have the following instances in our (training) dataset:
 
Weekend (Example) Weather Parents Money Decision (Category)

900_Decision Tree Computer Assignment.png

Apply the ID3 algorithm on this dataset to induce a decision tree. 
 
Note that I have written a function (readDataset.m) for reading the given dataset (MyWeekendDataset.txt) , you can use it to load the data and then write the algorithm. It is not necessary to show the decision tree graphically but please show the structure of the tree as well as you can.

Posted Date: 2/12/2013 1:31:47 AM | Location : United States







Related Discussions:- Decision tree - id3 algorithm, Assignment Help, Ask Question on Decision tree - id3 algorithm, Get Answer, Expert's Help, Decision tree - id3 algorithm Discussions

Write discussion on Decision tree - id3 algorithm
Your posts are moderated
Related Questions
write a c++ program to find out the area of a curve y=f(x) between x=a and x=b

Determine the class invariants- Ruby Ruby has many predefined exceptions classes (like ArgumentError) and new ones can be created easily by sub-classing StandardError, so it's

Q. Explain the result of inserting the keys given. F, S, Q, K, C, L, H, T, V, W, M, R, N, P, A, B, X, Y, D, Z, E  in an order to an empty B-tree of degree-3.

complete information about collision resolution techniques

Q. Compare and contrast various sorting techniques or methods with respect to the memory space and the computing time.

In this section, we will discuss about Sequential file organization. Sequential files have data records stored in a particular sequence. A sequentially organized file might be stor

What are the properties of an algorithsm?

Determination of Time Complexity The RAM Model The random access model (RAM) of computation was devised through John von Neumann to study algorithms. In computer science,

The information in the table below is available for a large fund-raising project. a. Determine the critical path and the expected completion time of the project. b. Plot the total

P os t - o r d e r T r av er sal :  This can be done by both iteratively and recursively. The iterative solution would require a modification or alteration of the in-