Formulas for threshold computations
✍ Scribed by C. Robert; J. Vermont; J.L. Bosson; P. François; J. Demongeot
- Book ID
- 103049885
- Publisher
- Elsevier Science
- Year
- 1991
- Tongue
- English
- Weight
- 833 KB
- Volume
- 24
- Category
- Article
- ISSN
- 0010-4809
No coin nor oath required. For personal study only.
✦ Synopsis
Given a continuous variable S, which density functions on two subgroups R' and R-of a population R are known (with for instance a higher mean value on R' than on R-), we first define two strategies for classification in these groups; the first one (MWC) consists in determining a threshold a such that classifying in 0+ when S 2 LY, in fl-otherwise, leads to the highest percentage of well-classed elements. The second one consists in choosing the most probable group, given the observed value of S. We give mathematical formulas for the thresholds involved in these two strategies when the density functions, determined by the application of the maximum entropy principle, are those of normal distributions. These formulas prove that the two considered strategies are frequently equivalent, and we give simpler formulas when the partial variances of S on fi+ and fl-are unknown or approximately equal. All the formulas are adapted to the case where a cost coefficient is introduced to display the unequal seriousness of the two possible errors (misclassification in R+ or n-j. Then we consider an example, where we see that the computed thresholds can be graphically validated from empirical curves and have the same performances on the learning sample and on a test Sampk. 0 1991 Academic
📜 SIMILAR VOLUMES
We show that every monotone formula that computes the threshold function TH k, n , 2 k nÂ2, has size at least wkÂ2x n log(nÂ(k&1)). The same lower bound is shown to hold in the stronger monotone directed contact networks model.