Entropy - learning decision trees, Computer Engineering

Assignment Help:

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."


Related Discussions:- Entropy - learning decision trees

Major characteristics of a computer family, Q. Major characteristics of a c...

Q. Major characteristics of a computer family? Let us summarise the major characteristics of a computer family. These are as below: Figure: Characteristics of computer

Why did some plug-ins disappear for 0.99.19, Some of the plug-ins have prov...

Some of the plug-ins have proven unstable. These have been moved into a split download, which should be available anywhere you got the GIMP, in the file gimp-plugins-unstable-VERSI

Write a pseudo code to find sum of two functions, Q. Write a pseudo code to...

Q. Write a pseudo code to find sum of two functions? Let's write a pseudo code to find sum of two functions f(A) + f(B). In first algorithm we will not use locking. Process

Explain the methods of implementing interacting processes, Explain any two ...

Explain any two methods of implementing interacting processes. Two methods of implementing interacting process are given below: (i) Shared memory solution: In this scheme

Operating system., what is the minimum number of page faults for an optimal...

what is the minimum number of page faults for an optimal page replacement strategy?

What is an arithmetic processor, Q. What is an arithmetic processor? A ...

Q. What is an arithmetic processor? A distinctive CPU necessitates most of the control and data processing hardware for implementing non-arithmetic functions. As the hardware c

Explain how server form post-back works, Briefly explain how server form po...

Briefly explain how server form post-back works?  Post Back: The process in which a Web page sends data back to the similar page on the server. View State: View State is the m

Example of assembly program, Sample Program In this program we only dis...

Sample Program In this program we only display: Line                             Offset Numbers                          -----------------Source Code-----------------

Function modules are also external subroutines, Function Modules are also e...

Function Modules are also external Subroutines. True.

Explain the working of assembler, Explain the working of Assembler? An ...

Explain the working of Assembler? An assembler is the computer program for translating assembly language fundamentally a mnemonic representation of machine language into object

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