Arbitrary categorisation - learning decision trees, Computer Engineering

Assignment Help:

Arbitrary categorisation - learning decision trees:

Through visualising  a set of boxes with some balls in. There if all the balls were in a single box so this would be nicely ordered but it would be extremely easy to find a particular ball. Moreover If the balls were distributed amongst the boxes then this would not be so nicely ordered but it might take rather a whereas to find a particular ball. It means if we were going to define a measure based at this notion of purity then we would want to be able to calculate a value for each box based on the number of balls in it so then take the sum of these as the overall measure. Thus we would want to reward two situations: nearly empty boxes as very neat and boxes just with nearly all the balls in as also very neat. However this is the basis for the general entropy measure that is defined follows like: 

Now next here instantly an arbitrary categorisation like C into categories c1, ..., cn and a set of examples, S, for that the proportion of examples in ci is pi, then the entropy of S is as: 

198_Arbitrary categorisation - learning decision trees.png

Here measure satisfies our criteria that is of the -p*log2(p) construction: where p gets close to zero that is the category has only a few examples in it so then the  log(p) becomes a big negative number and the  p  part dominates the calculation then the entropy works out to be nearly zero. However make it sure that entropy calculates the disorder in the data in this low score is good and as it reflects our desire to reward categories with few examples in. Such of similarly if p gets close to 1 then that's the category has most of the examples in so then the  log(p) part gets very close to zero but it  is this that dominates the calculation thus the overall value gets close to zero. Thus we see that both where the category is nearly  -  or completely  -  empty and when the category nearly contains as - or completely contains as  - all the examples and the score for the category gets close to zero that models what we wanted it to. But note that 0*ln(0) is taken to be zero by convention them.


Related Discussions:- Arbitrary categorisation - learning decision trees

First-order inference rules - artificial intelligence, First-Order Inferenc...

First-Order Inference Rules -artificial intelligence: Now we have a perfect definition of a first-order model is,in the same way, we may define soundness for first-order infere

What is core dump, Raises when accessing an unassigned memory location acce...

Raises when accessing an unassigned memory location accessing a null pointer

Qwerty - keyboard layout, Q. QWERTY - Keyboard Layout ? A keyboard layo...

Q. QWERTY - Keyboard Layout ? A keyboard layout is arrangement of keys across the keyboard. There is one keyboard layout which anybody who has worked on a standard keyboard or

Need of the assembly language, Q. Need of the assembly language ? Machi...

Q. Need of the assembly language ? Machine language code comprises the 0-1 combinations which computer decodes directly.  Though the machine language has the following problems

What are the two ways in which the system using cache, What are the two way...

What are the two ways in which the system using cache can proceed for a write operation? Write by protocol technique Write-back or Copy-back protocol method

Counter, mod12 counter connection diagram

mod12 counter connection diagram

Explain data parallel programming, Q. Explain Data Parallel Programming? ...

Q. Explain Data Parallel Programming? In data parallel programming model major focus is on performing concurrent operations on a data set. The data set is characteristically or

Linq file extension, What is the LINQ file extension that interacts with Co...

What is the LINQ file extension that interacts with Code Behind objects. Ans) its .dbml

How many flip flops are required to construct decade countr, How many flip ...

How many flip flops are required to construct a decade counter ? Ans. 4 FlipFlop's are required because decade counter counts 10 states from 0 to 9 (that is from 0000 to 1001).

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