Basic idea - learning decision trees, Computer Engineering

Assignment Help:

Basic idea:

However in the above decision of tree which it is significant that there the "parents visiting" node came on the top of the tree. Whether we don't know exactly the reason for this and we didn't see the example weekends from that the tree was produced but still number of weekends the parents visited was relatively high but every weekend they did visit and there was a trip to the cinema. Let assume in following example that the parents have visited every fortnight for a year but on each occasion the family visited the cinema. Because there is no evidence in favour of doing anything rather than watching a film the parents visit. As given that there we are learning rules from examples because if the parents visit then the decision is already made. Thus we can put this at the top of the decision tree but disregard all the examples when the parents visited while constructing the rest of the tree. Do not having to think about a set of examples that will make the construction job easier. 

In fact this kind of thinking underlies the ID3 algorithm for learning decisions trees that we will describe more formally below. Moreover the reasoning is a little more subtle like in our example it would also take with account the examples where the parents did not visit yet.


Related Discussions:- Basic idea - learning decision trees

Explain about zip drive, Q. Explain about Zip Drive? Zip Drive: Loads...

Q. Explain about Zip Drive? Zip Drive: Loads of files, Volumes of data have definitely increased onus on today's computer user and protection of this data is what bugs every

Programming with parallel virtual machine, Q. Programming with parallel vir...

Q. Programming with parallel virtual machine? The general method for writing a program with PVM is like this:  A user writes one or more sequential programs in C++, C or FOR

Don''t care states, The conflict between too hot and too cold or too slow a...

The conflict between too hot and too cold or too slow and too fast can be resolved using don't care states. Don't care states are used when i) the state of the output is not

Loogen, i need u to write my exam for $10,000

i need u to write my exam for $10,000

Explain deadlock, What is a deadlock? A deadlock is a situation that ca...

What is a deadlock? A deadlock is a situation that can increase when two units, A and B use a shared resource. Assume that unit B cannot complete its task unless unit A complet

Explain SR latch using nor gates, Q. Explain SR Latch using NOR gates? ...

Q. Explain SR Latch using NOR gates? Let's inspect the latch more closely.   i. Suppose initially 1 is applied to S leaving R to 0 at this instance. The instant S=1 output o

#project, how to build PVR set-top box using raspberry

how to build PVR set-top box using raspberry

What is memory mapped i/o, What is memory mapped I/O? When the I/O devi...

What is memory mapped I/O? When the I/O devices share the similar address space, the arrangement is known as memory mapped I/O.

State some criterias and their effects on a database, It is possible to ent...

It is possible to enter one or more criteria in the rows which can influence your database significantly. >="Callahan" this returns all the several records from Callahan to the

Performance of a parallel algorithm - number of processors, Factor which he...

Factor which helps in analysis of parallel algorithms is the total number of processors needed to deliver a solution to a provided problem. So for a given input of size let's say n

Write Your Message!

Captcha
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