Efficient p-value evaluation for resampling-based tests.
نویسندگان
چکیده
The resampling-based test, which often relies on permutation or bootstrap procedures, has been widely used for statistical hypothesis testing when the asymptotic distribution of the test statistic is unavailable or unreliable. It requires repeated calculations of the test statistic on a large number of simulated data sets for its significance level assessment, and thus it could become very computationally intensive. Here, we propose an efficient p-value evaluation procedure by adapting the stochastic approximation Markov chain Monte Carlo algorithm. The new procedure can be used easily for estimating the p-value for any resampling-based test. We show through numeric simulations that the proposed procedure can be 100-500 000 times as efficient (in term of computing time) as the standard resampling-based procedure when evaluating a test statistic with a small p-value (e.g. less than 10( - 6)). With its computational burden reduced by this proposed procedure, the versatile resampling-based test would become computationally feasible for a much wider range of applications. We demonstrate the application of the new method by applying it to a large-scale genetic association study of prostate cancer.
منابع مشابه
Efficient calculation of p-values in linear-statistic permutation significance tests
Resampling significance tests possess a number of desirable properties: they are conceptually simple, unbiased, powerful and free of assumptions about the parent populations involved. There exists a huge literature in this area, including canonical works by Fisher [1], Pitman [2], Efron [3], Edgington [4], Davison and Hinkley [5] and Good [6]. Unfortunately, even if we restrict ourselves to the...
متن کاملEfficient Bootstrap Tests for the Goodness of Fit in Covariance Structure Analysis
Asymptotic chi-square tests, such as the normal theory likelihood ratio test, are often used to evaluate the goodness-of-fit of a covariance structure analysis model. Another approach is to use the bootstrap test, which is known to have the desired asymptotic level if model restrictions are taken into account in designing a resampling algorithm. The bootstrap test is, however, computationally v...
متن کاملEfficient Computation of Adjusted p-Values for Resampling-Based Stepdown Multiple Testing
There has been a recent interest in reporting p-values adjusted for resampling-based stepdown multiple testing procedures proposed in Romano and Wolf (2005a,b). The original papers only describe how to carry out multiple testing at a fixed significance level. Computing adjusted p-values instead in an efficient manner is not entirely trivial. Therefore, this paper fills an apparent gap by detail...
متن کاملSequential Implementation of Monte Carlo Tests with Uniformly Bounded Resampling Risk
This paper introduces an open-ended sequential algorithm for computing the p-value of a test using Monte Carlo simulation. It guarantees that the resampling risk, the probability of a different decision than the one based on the theoretical p-value, is uniformly bounded by an arbitrarily small constant. Previously suggested sequential or non-sequential algorithms, using a bounded sample size, d...
متن کاملAn Efficient Target Tracking Algorithm Based on Particle Filter and Genetic Algorithm
In this paper, we propose an efficient hybrid Particle Filter (PF) algorithm for video tracking by employing a genetic algorithm to solve the sample impoverishment problem. In the presented method, the object to be tracked is selected by a rectangular window inside which a few numbers of particles are scattered. The particles’ weights are calculated based on the similarity between feature vecto...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Biostatistics
دوره 12 3 شماره
صفحات -
تاریخ انتشار 2011