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

Illustrate about compact disk rewritable, Q. Illustrate about Compact Disk ...

Q. Illustrate about Compact Disk Rewritable? CD-RW optical disk can be repeatedly written and overwritten same as with a magnetic disk. Even though a number of techniques have

First order predicate logic-artificial intelligence, First Order Predicate ...

First Order Predicate Logic This is a more expressive logic because it builds on propositional logic by allowing us to use constants, predicates, variables, quantifiers and fun

Properties for of static ram, a) Give eight properties for each of static R...

a) Give eight properties for each of static RAM (SRAM) and DRAM (dynamic RAM) and provide the low-level structure of each type of memory. b) Assume a system with 16 Megabytes o

Pipelined processor, Pipelined Processor Having discussed pipelining; n...

Pipelined Processor Having discussed pipelining; now we can describe a pipeline processor. A pipeline processor can be distinct as a processor that consists of a series of proc

Backpropagation learning routine, Backpropagation Learning Routine: Co...

Backpropagation Learning Routine: Conversely as with perceptrons there the information in the network is stored in the weights than the learning problem comes down to the ques

Representation in prolog - logic programs, Representation in Prolog - Logic...

Representation in Prolog - Logic Programs : Artificial intelligence If we impose some more constraints on first order logic, then we get to a representation language known as l

SGML, Write short note of SGML

Write short note of SGML

Explain erasable programmable rom (eprom) - computer memory, Explain Erasab...

Explain Erasable Programmable ROM (EPROM) - Computer Memory? An EPROM is a ROM that can be reprogrammed and erased. A little glass window is installed at the top of the ROM pac

Differentiate aggregation and containment, Aggregation is the relationship ...

Aggregation is the relationship among the whole and a part. We can add/subtract some properties in the part (slave) side. It won't affect the entire part. Best example is Car,

Shell script, shell script for addnames that has to be called as class list...

shell script for addnames that has to be called as class list in the name of the class list file and username is a particular student''s username

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