The problem of regions (Q1807154): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Prepivoting to reduce level error of confidence sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: More accurate confidence intervals in exponential families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3959963 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bootstrap confidence intervals for a class of parametric problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Better Bootstrap Confidence Intervals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bootstrap confidence levels for phylogenetic trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4318617 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The problem of regions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The bootstrap and Edgeworth expansion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Calibrating Confidence Coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Comments on C P / rank
 
Normal rank
Property / cites work
 
Property / cites work: Noninformative priors for one parameter of many / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5727141 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a second-order asymptotic property of the Bayesian bootstrap mean / rank
 
Normal rank

Revision as of 09:08, 29 May 2024

scientific article
Language Label Description Also known as
English
The problem of regions
scientific article

    Statements

    The problem of regions (English)
    0 references
    0 references
    0 references
    9 November 1999
    0 references
    Suppose that the observation space \(R^k\) is partitioned into \(m\) regions \({\mathcal R}_1\),\dots, \({\mathcal R}_m\). The observation of a normal vector \(y\sim N(\mu,S)\) lies in \({\mathcal R}_i\) (say). How confident should we be that it's mean lies in \({\mathcal R}_i\)? The authors discuss bootstrap algorithms which estimate this ``confidence''. The confidence is considered in the two meanings: frequentist and Bayesian. In the frequentist approach (for \(m=2\)) this confidence is defined as the attained confidence level of the test which tests the hypothesis \(H_0\): \(\mu\not\in {\mathcal R}_i\). In the Bayesian approach it is the aposteriori probability of \(\mu_i\in{\mathcal R}_i\). There are principal difficulties in both approaches. In the frequentist setting there is a problem of choosing appropriate tests (the authors use the likelihood ratio test). In the Bayesian setting the analogous problem is to choose the prior distribution of \(\mu\). The authors equate these problems using the Welch-Peers prior in the Bayesian setting which matches frequentist confidence levels. It is shown that the naive bootstrap ``confidence'' estimator is not consistent with this approach (it corresponds to the Bayesian approach with the flat prior). Improvements for the naive estimator are considered with second and third order of accuracy by \(S=S_0/n\) as \(n\to\infty\). They are based on the general \(BC_a\) and \(ABC\) bootstrap bias-correction methods. Generalizations of them on exponential families are also considered. These results are applied to the problem of polynomial regression order estimation for cholesterol level dependence on a dose of drug and the analysis of multimodality by data on some Mexico stamps thickness.
    0 references
    bootstrap
    0 references
    confidence regions
    0 references
    hypothesis testing
    0 references
    second order approximation
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references