Entropy - learning decision trees, Computer Engineering

Entropy - learning decision trees:

Through putting together a decision of tree is all a matter of choosing that attribute to test at each node in the tree. Further we shall define a measure that is information gain that will be used to decide which attribute to test at each node. By considering through information gain is itself calculated utilising a measure called entropy that we first define for the case of a binary decision problem so then define for the general case. 

As per given a binary categorisation like C, and a set of examples, S, that are utilising the proportion of examples categorised as positive by C is p+  or the proportion of examples categorised  like negative by C is p-, then the entropy of S is as: 

641_Entropy - learning decision trees.png

Now next here instantly we defined entropy first for a binary decision problem is easier to get an impression of what it is trying to calculate. As Tom Mitchell puts this quite well: like 

"In order to define an information gain precisely so we begin by defining a measure commonly utilising in information theory that is called entropy in which characterizes the (im)purity of as an arbitrary collection of examples."

Posted Date: 1/11/2013 6:38:23 AM | Location : United States







Related Discussions:- Entropy - learning decision trees, Assignment Help, Ask Question on Entropy - learning decision trees, Get Answer, Expert's Help, Entropy - learning decision trees Discussions

Write discussion on Entropy - learning decision trees
Your posts are moderated
Related Questions
What are links and associations? Link is a physical or conceptual connection between objects. A link is an instance of an association.  Association is a explanation of group

Advantages & Disadvantages Enhanced security and convenience: private keys never require be transmitting or revealing to anyone.  They can givce a method for digital signatu

write algorithm and draw flowchart for exchange the values of two variables.

Reduce the following equation using k-map Y = BC‾D‾ + A‾BC‾D + ABC‾D + A‾BCD + ABCD Ans. Multiplying the first term with (A+A') Y = A'BC'D' + ABC'D' + A'BC'D + ABC'D + A'BCD + A

Explain Host function Host function: accepts name of floating-point guest function with single floating-point argument as its first argument, evaluates this function at x (the

Q. Explain about Registers? A register is a group of flip-flops that store binary information and gates that controls when and how information is transferred to register. An n-

Constants - first-order logic: Constants are things that is cannot be changed, like as england, black and barbara. So then they stand for one thing only, so that can be confu


A sample rate of            is required for a good quality representation of telephone conversation. A sample rate of 50 times/second /mile of distance travelled are needed fo

Explain difference between Security and Protection? Protection mechanism: The subsequent mechanisms are commonly utilized for protecting files having programs and data. (a