Reading decision trees, Computer Engineering

Assignment Help:

Reading Decision Trees:

However we can justified by see that a link between decision tree representations and logical representations that can be exploited to make it easier to understand as read learned decision trees. But if we really think about it that every decision tree is essentially a disjunction of implications as "if ... then statements" so the implications are Horn clauses: and a conjunction of literals implying a single literal. Thus in the above tree here we can see this by reading from the root node to each leaf node: 

If go to the cinema, then the parents are visiting

or

If play tennis, then the parents are not visiting and it is sunny.

or

If go shopping, then the parents are not visiting and it is windy and you're rich.

or

If go to cinema, then the parents are not visiting and it is windy and you're poor.

or

If stay in, then the parents are not visiting and it is rainy. 

Obviously there is fact is just a re-statement of the original mental decision making process as we described. But retain information moreover we will be programming an agent to learn decision trees from example and this kind of situation will not occur as we will begin with only example situations. Furthermore it will therefore be important for us to be able to read the decision tree the agent suggests.


Related Discussions:- Reading decision trees

Name the approaches used for generating the control signals, What are the t...

What are the two approaches used for generating the control signals in proper sequence? Hardwired control Micro programmed control

Advantage to depth first search, Advantage to depth first search: It j...

Advantage to depth first search: It just looks like it will be a long period it finds 'DAN' until. This highlights an important drawback for depth first search. It can regular

State the optimal route of node, State the optimal route of node Consid...

State the optimal route of node Consider the node i which has path length K+1, with the directly preceding node on the path being j. The distance to node i is w(j, i) plus the

What is macro-expansion, What is macro-expansion? Macro calls lead to m...

What is macro-expansion? Macro calls lead to macro expansion. Throughout macro expansion, the macro call statement is replaced through a sequence of assembly statements.

Explain difference between space and time division switching, Through two b...

Through two block diagrams explain the difference between Space division and time division switching. Space and Time Switching: Space Switches: Connections can be made i

Explain in brief about the broadband, Explain in brief about the broadband ...

Explain in brief about the broadband It isn't just computers which can be linked without wires, different peripheral devices can be linked to a computer system without the need

Describe the analytical engine by babbage, THE ANALYTICAL ENGINE BY BABBAGE...

THE ANALYTICAL ENGINE BY BABBAGE: It was general use computing device that could be used for performing any types of mathematical operation automatically. It contains the follo

Define miss rate, Define miss rate? It is the number of misses' states ...

Define miss rate? It is the number of misses' states as a fraction of attempted accesses.

Padovan string , A Padovan string P(n) for a natural number n is defined as...

A Padovan string P(n) for a natural number n is defined as: P(0) = ‘X’ P(1) = ‘Y’ P(2) = ‘Z’ P(n) = P(n-2) + P(n-3), n>2 where + denotes string concatenation. For a string of t

What are spa/gpa parameters (sap memory), What are SPA/GPA parameters (SAP ...

What are SPA/GPA parameters (SAP memory) SPA/GPA parameters are field values saved globally in memory.  There are two ways to use SPA/GPA parmeters: By setting field attrib

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