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

Resource dependence , Resource Dependence The parallelism among the ...

Resource Dependence The parallelism among the instructions may also be affected because of  the shared resources. If two instructions are using the related shared resource t

The disadvantage of specifying parameter, The disadvantage of specifying pa...

The disadvantage of specifying parameter during instantiation are: -  This has a lower precedence when compared to assigning using defparam.

Illustrate about sharing of structure and behaviour, Illustrate about Shari...

Illustrate about Sharing of Structure and Behaviour  One of the reasons for the popularity of object-oriented techniques is that they promote sharing at different levels. Inher

Define external layer, Define external layer? The external layer is the...

Define external layer? The external layer is the plane at which the user sees and interacts with the data, that is, the data format in the user interface.  This data format is

Posix, POSIX is the IEEE's Portable Operating System Interface for Computer...

POSIX is the IEEE's Portable Operating System Interface for Computer Environments. The standard provides compliances criteria for operating system services and is designed to allow

Address phase timing - computer architecture, Address phase timing: On...

Address phase timing: On the rising edge of clock 0, the initiator notes IRDY # and FRAME# both high, and GNT# low, so it drives the command, address and asserts FRAME# in tim

Convert the binary number to gray code, Convert the binary number 10110 to ...

Convert the binary number 10110 to Gray code ? Ans. For changing binary number 10110 in its equivalent Gray code the rules are as, the left most bit that is MSB in Gray code is 1

What is blocking probability, What is blocking probability? Blocking ...

What is blocking probability? Blocking Probability: The blocking probability P is described as the probability like all the servers in system are busy. If all the servers ar

Explain the client-server interaction using messages, Explain the Client-Se...

Explain the Client-Server Interaction Using Messages As we have learned, client- server interaction may be managed in many ways. A message- based interaction is perhaps the bes

Different search strategies- artificial intelligence, Different search stra...

Different search strategies- artificial intelligence: To help us think about the different search strategies, we use two analogies. Firstly, we suppose that the professor keep

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