Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
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:
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.
Design a 4 to 1 Multiplexer by using the three variable function given by F(A, B, C) = ∑ m(1,3,5,6) Ans. The given function F(A,B,C) = ∑ m(1,3,5,6) can be implemented along wit
Q. Decoding of slightly encoded micro-instructions? Generally micro-programmed control unit designs are neither totally unencoded nor highly encoded. They are slightly coded. T
Q. Illustrate about FAT structure? DOS file system maintains a table of pointers known as FAT (File allocation table) that comprises an array of 16-bit values. There is one ent
Mr. X seems to view himself in positive terms (MMPI-2: Ho=38) as a well-functioning person who is capable of dealing with his life and personal challenges (MMPI-2: LSE=41, TRT=39),
Q. Explain about Cathode Ray Tubes? Cathode ray tube is the major technology on that televisions and monitors have been based. CRT is a partially evacuated glass tube which is
How many logical drives is it possible to fit onto a physical disk? Ans) Maximum of 24 logical drives can be fit into physical disk. The extended partition can only have 23 lo
Q. Collective Communications - Broadcast? Broadcast: Broadcasting can be done in two ways one of them is one to all and another one is all to all. In the matter of one to all b
dear sir,kindly describe the above tpoic completely
can i get a prepared ppt for this topic to present it in a seminar??
"Super ASCII", if it contains the character frequency equal to their ascii values. String will contain only lower case alphabets (''a''-''z'') and the ascii values will starts from
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!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd