Please use this identifier to cite or link to this item:
https://dspace.upt.ro/xmlui/handle/123456789/1434
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Pastor, Dominique | - |
dc.date.accessioned | 2020-04-07T08:42:23Z | - |
dc.date.accessioned | 2021-03-01T08:42:57Z | - |
dc.date.available | 2020-04-07T08:42:23Z | - |
dc.date.available | 2021-03-01T08:42:57Z | - |
dc.date.issued | 2005 | - |
dc.identifier.citation | Pastor, Dominique. On the coverage probability of the Clopper-Pearson confidence interval. Timişoara: Editura Politehnica, 2005 | en_US |
dc.identifier.uri | http://primo.upt.ro:1701/primo-explore/search?query=any,contains,On%20the%20coverage%20probability%20of%20the%20Clopper-Pearson%20confidence%20interval&tab=default_tab&search_scope=40TUT&vid=40TUT_V1&lang=ro_RO&offset=0 Link Primo | - |
dc.description.abstract | Given α ∈ (0,1), the coverage probability of the 100(1 − α)% Clopper-Pearson Confidence Interval (CPCI) for estimating a binomial parameter p is proved to be larger than or equal to 1−α/2 for sample sizes less than a bound that depends on p. This is a mathematical evidence that, as noticed in recent papers on the basis of numerical results, the CPCI coverage probability can be much higher than the desired confidence level and thence, that the Clopper-Pearson approach is mostly inappropriate for forming confidence intervals with coverage probabilities close to the desired confidence level. | en_US |
dc.language.iso | en | en_US |
dc.publisher | Timişoara: Editura Politehnica | en_US |
dc.relation.ispartofseries | Seria electronică şi telecomunicaţii, Tom 50(64), fasc. 2 (2005) | - |
dc.title | On the coverage probability of the Clopper-Pearson confidence interval [articol] | en_US |
dc.type | Article | en_US |
Appears in Collections: | Articole științifice/Scientific articles |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
BUPT_ART_Pastor_f.pdf | 1.07 MB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.