A simple algorithm for tighter exact upper confidence bounds with rare attributes in finite universes

DOI10.1016/S0167-7152(97)00049-7zbMath0967.62008OpenAlexW2054047330MaRDI QIDQ1375869

Tommy Wright

Publication date: 30 July 2001

Published in: Statistics \& Probability Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-7152(97)00049-7

zbMATH Keywords

hypergeometric distributionexact randomized alpha-level testsexact randomized upper confidence boundsrare attributes

Mathematics Subject Classification ID

Sampling theory, sample surveys (62D05)

Related Items (2)

Generalised Clopper–Pearson confidence intervals for the binomial proportion ⋮ Tolerance intervals for hypergeometric and negative hypergeometric variables

Cites Work

• Exact confidence bounds when sampling from small finite universes. An easy reference based on the hypergeometric distribution
• A note on sampling to locate rare defectives with strong prior evidence
• On some generalized farlie-gumbel-morgenstern distributions-II regression, correlation and further generalizations
• EXTENSION OF THE NEYMAN-PEARSON THEORY OF TESTS TO DISCONTINUOUS VARIATES
• Confidence Intervals for the Number Showing a Certain Characteristic in a Population when Sampling is Without Replacement
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A simple algorithm for tighter exact upper confidence bounds with rare attributes in finite universes