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

Application layer in tcp/ip model corresponds to for what, Application laye...

Application layer (layer 4) in TCP/IP model corresponds to? In OSI model, application layer (layer 4) in TCP/IP model corresponds to layer 6 and layer 7.

Observed speedup and parallel overhead, Observed Speedup Observed speed...

Observed Speedup Observed speedup of a system which has been parallelized, is defined as:                             Granularity is one of the easiest and most extensi

Explain jk flip-flop using sr flip-flop, Q. Explain 4 bit Ripple counter wi...

Q. Explain 4 bit Ripple counter with necessary diagram. Q. Explain JK Master-slave Flip-flop with block diagram and logic design. Q. Explain JK flip-flop using SR flip-flop

What is associative mapping cache, Q. What is Associative Mapping Cache? ...

Q. What is Associative Mapping Cache? The most fastest and flexible cache organization employs an associative memory that is displayed in Figure below. The associative memory s

Define memory utilization factor, Memory utilization factor shall be comput...

Memory utilization factor shall be computed as? Ans. memory in use/total memory connected.

Search-based tools, The search-based tools initially identify the problem a...

The search-based tools initially identify the problem and after that appropriately give advice on how to correct it. AT Expert from Cray Research is one of the tools being used

Explain performance evaluation in parallel computing, Explain Performance E...

Explain Performance Evaluation in parallel Computing In this section, we will discuss the key attributes used to measure performance of a computer system. The performance chara

What is the scope of public members in all classes, What is the Scope of pu...

What is the Scope of public/private/friend/protected/protected friend?    Scope of public/private/friend/protected/protected friend. Visual Basic/Visual C# Public/pub

Turning machine, procedure of turning machine operation on markov algorithm...

procedure of turning machine operation on markov algorithm

What is microcomputers, Q. What is Microcomputers? Microcomputers have ...

Q. What is Microcomputers? Microcomputers have become a common part of everyday life. The cost ranging from a few hundred to about ten thousand dollars, today's 16- and 32-bi

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