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 internal organization of bit cells in a memory chip, Explain with n...

Explain with neat diagram the internal organization of bit cells in a memory chip. Memory cells are usually organized in the form of an array, in which every cell is capable of

Shared memory and distributed memory, Shared Memory Refers to the memor...

Shared Memory Refers to the memory part of a computer system in which the memory can processed directly by any of the processors in the system. Distributed Memory Refer

Dfd, Give a 5-minute presentation on your team''s solution

Give a 5-minute presentation on your team''s solution

Explain recursive descent parsing, Explain Recursive Descent Parsing It...

Explain Recursive Descent Parsing It is a top down parsing with no backtracking. This parsing method uses a set of recursive processes to perform parsing. Most important advant

What about division and multiply operations, Q. What about division and mul...

Q. What about division and multiply operations? In most of the older computers divisions and multiply were implemented using subtract/add and shift micro-operations. If a digit

Interrupt - driven input-output, Q. Interrupt - Driven Input-output? Pr...

Q. Interrupt - Driven Input-output? Problem with programmed I/O is that processor has to wait a long time for I/O interface to see whether a device is free or waits until compl

Output comparators, Output comparators are used in  Theses are used in ...

Output comparators are used in  Theses are used in Dynamic testing of single and multiple module.

Ms access database through menu driven selections, Would you like to easily...

Would you like to easily automate your MS Access database through menu driven selections? This can be accomplished by producing a form with customized buttons that point to macr

Advantages and drawbacks of mealy and moore machine, What are the advantage...

What are the advantages and drawbacks of mealy and moore machine? Advantages and drawbacks: Into Mealy as the output variable is a function both state and input, changes o

Overview of the dreamweaver work area, Q. Overview of the Dreamweaver work ...

Q. Overview of the Dreamweaver work area? Let's start with a brief overview of the Dreamweaver work area. If you haven't already launched Dreamweaver, double-click Dreamweaver

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