Specifying the problem - learning decision trees, Computer Engineering

Assignment Help:

Specifying the Problem:

Now next here furtherly we now use to look at how you mentally constructed your decision tree where deciding what to do at the weekend. But if one way would be to require some background information as axioms and deduce then what to do. If we look an example here you might know that your parents in reality like going to the cinema or that your parents are in town and therefore as using something like Modus Ponens then you would decide to go to the cinema of course. 

Now next here instantly one way such you might have made up your mind was by generalising from previous experiences. Visualize like you remembered all the times where you had a really good weekend. Means a few weeks back there it was sunny and your parents were not visiting or you played tennis so and it was good for you. Thus a month ago if it was raining instantly you were penniless then a trip to the cinema cheered you up like so on. Hence information of this type could have guided your decision making then if this was the case as you would have used an inductive so deductive method to construct your decision tree. Now next here instantly we considered humans reason to solve decisions by utilising both inductive and deductive processes. 

Furthermore we have a set of examples correctly categorised with categories as decisions. So here we have a set of attributes describing the examples also and each attribute has a finite set of values that it can possibly take. However we want to utilise the examples to learn the structure of a decision tree that can be required to decide the category of an unseen. 

By supposing that there are no inconsistencies in the data as where two examples have exactly the same values for the attributes and are categorised differently and it is obvious that we can always construct a decision tree to correctly decide for the training cases with 100% accuracy. Thus all we have to do is make sure every situation is catered for down some branch of the decision tree. Obviously there 100% accuracy may indicate overfitting.


Related Discussions:- Specifying the problem - learning decision trees

Odd-even merging circuit, Odd-Even Merging Circuit Let's firstly unders...

Odd-Even Merging Circuit Let's firstly understand the idea of merging two sorted sequences using an odd-even merging circuit. The functioning of a merging circuit is as given b

Future of hyper threading, Current Pentium 4 based MPUs use Hyper-threading...

Current Pentium 4 based MPUs use Hyper-threading, but the next-generation cores, Woodcrest and Merom, Conroe will not. While some have alleged that this is because Hyper-threading

Explain about binning?, Binning process is very helpful to save space. Perf...

Binning process is very helpful to save space. Performance may differ depending upon the query generated sometimes solution to a query can come within some seconds and sometimes it

Simplify the expression by using karnaugh map, Simplify   the   following  ...

Simplify   the   following   expression   into   sum   of   products   using   Karnaugh   map F(A, B, C, D) = ∑ (1,3,4,5,6,7,9,12,13) Ans. Simplification of the giv

Explain abstract class, What is an interface and what is an abstract class?...

What is an interface and what is an abstract class? Please, expand by examples of using both. Explain why?   Abstract classes are closely related to interfaces. They are classe

Define multi programming, Define multi programming? Many operating syst...

Define multi programming? Many operating systems are designed to enable the cpu to process a number of independent programs concurrently. This concept is  known as multi progra

Background, Background, Examples and Hypothesis: Now we will switch of...

Background, Examples and Hypothesis: Now we will switch off with three logic programs. So very firstly, we will have the logic program representing a set of positive examples

Dfa, design a dfa which accept all the string over a and b ending with ab o...

design a dfa which accept all the string over a and b ending with ab or ba

Explain quadratic probing with respect to hashing technique, Quadratic prob...

Quadratic probing: In the above case when the first insertion is made the probability of latest element being inserted in a certain position is 1/n    where n is the size of the a

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