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

Can link and association applied interchangeably, No, You cannot apply the ...

No, You cannot apply the link and Association interchangeably. Since link is used show the relationship among the two objects. But Association is used signify the relationship

Knowledge representation - artificial intelligence, Knowledge Representatio...

Knowledge Representation: To recap, we now have some characterizations of "AI", that when an "AI" problem arises, you will be able to put all into context exactly, find the co

Evaluation stack architecture, Q. Evaluation Stack Architecture? A stac...

Q. Evaluation Stack Architecture? A stack is a data structure which implements Last-In-First-Out (LIFO) access policy. You can add an entry to the with a PUSH(value) as well as

What is insertion point, A vertical flashing line that permits the user whe...

A vertical flashing line that permits the user where text will be inserted.

Show error detection mechanism, Q. Show Error detection mechanism? Erro...

Q. Show Error detection mechanism? Error detection mechanism can be described as below: Figure: Error detection and correction

Define both fork and vfork, How and when race conditions happen in process ...

How and when race conditions happen in process control? How can it be avoided? b. Differentiate among following functions giving related syntax: (i) fork and vfork (ii) w

Difference between relocatable and self relocatable programs, Difference be...

Difference between relocatable and self relocatable programs. A relocatable program is one which can be processed to relocate it to a selected area of memory. For illustratio

Describe about data warehouse development life cycle, Data Warehousing 1....

Data Warehousing 1.  With necessary diagram, Describe about Data Warehouse Development Life Cycle. 2. Elucidate Metadata and what is its use in Data Warehouse Architecture?

What is hypercube network, Q. What is Hypercube Network? The hypercube ...

Q. What is Hypercube Network? The hypercube architecture has played a significant role in development of parallel processing and is quite influential and popular. The highly sy

Prediction algorithms , The following branch prediction algorithms are sugg...

The following branch prediction algorithms are suggested: 1) Guess that the branch will be taken if the previous one was taken; predict not taken otherwise. 2) Guess that the

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