Practical valid inferences for the two-sample binomial problem (Q76638)

From MaRDI portal
Revision as of 08:37, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
Practical valid inferences for the two-sample binomial problem
scientific article

    Statements

    15
    0 references
    none
    0 references
    1 January 2021
    0 references
    6 August 2021
    0 references
    0 references
    0 references
    0 references
    Practical valid inferences for the two-sample binomial problem (English)
    0 references
    This paper is a study on Fisher's exact test. The question is whether two binomial parameters differ, which parameter is larger, and by how much. The authors define a frequentist triple as an estimator of the parameter of interest, a confidence interval, and a \(p\)-value function with computational issues. They evaluate both, the properties of validity and power \textit{and} confidence intervals, their coverage, and expected length. They limit the scope of this paper by considering only frequentist approaches, leaving out asymptotic methods or other approximations. They work out that no method can meet all the desirable properties and give recommendations based on which properties are given more importance. They examine a real application to discuss the issues. They show properties of frequentist triples. They develop methods for creating one-sided exact unconditional testing procedures, one-sided conditional exact tests, melded confidence intervals, non-central confidence intervals and associated tests, and mid-\(p\) methods. Finally, they give some recommendations how to perform frequentist inferences on the two-sample binomial problem.
    0 references
    \(2\times 2\) table
    0 references
    Barnard's test
    0 references
    Fisher's exact test
    0 references
    unconditional exact test
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers