Shapiro–Wilk test
Test of normality in frequentist statistics
From Wikipedia, the free encyclopedia
The Shapiro–Wilk test is a test of normality. It was published in 1965 by Samuel Sanford Shapiro and Martin Wilk.[1]
Theory
The Shapiro–Wilk test tests the null hypothesis that a sample x1, ..., xn came from a normally distributed population. The test statistic is
where
- with parentheses enclosing the subscript index i is the ith order statistic, i.e., the ith-smallest number in the sample (not to be confused with ).
- is the sample mean.
The coefficients are given by:[1] where C is a vector norm:[2] and the vector m, is made of the expected values of the order statistics of independent and identically distributed random variables sampled from the standard normal distribution; finally, is the covariance matrix of those normal order statistics.[3]
There is no name for the distribution of . The cutoff values for the statistics are calculated through Monte Carlo simulations.[2]
Interpretation
The null-hypothesis of this test is that the population is normally distributed. If the p value is less than the chosen alpha level, then the null hypothesis is rejected and there is evidence that the data tested are not normally distributed.[4]
Like most statistical significance tests, if the sample size is sufficiently large this test may detect even trivial departures from the null hypothesis (i.e., although there may be some statistically significant effect, it may be too small to be of any practical significance); thus, additional investigation of the effect size is typically advisable, e.g., a Q–Q plot in this case.[5]
Power analysis
Monte Carlo simulations have demonstrated in practically relevant settings that Shapiro–Wilk has the best power for a given significance, followed closely by Anderson–Darling when comparing the Shapiro–Wilk, Kolmogorov–Smirnov, and Lilliefors.[6][unreliable source?]
Approximation
The main bottleneck in the use of this method for higher sample sizes lies in the calculation of the coefficients vector a, more specifically in the size of V which requires the storage of n + n(n + 1)/2 numbers at minimum.[7] The original 1965 publication included values of V up to n = 50 for this purpose[8] (though the values for n ≤ 20 was incorrect).[7] Another issue is the requirement for a precalculated set of cutoffs for W at a given n and alpha-level.[7] It is also known that the Shapiro–Francia test is asymptotically equivalent, but it is not close enough at practical n.[7]
In 1982 Royston provided a more correct method of calculating m and a lognormal approximation of W up to n = 2000, which could be used with an existing approximation of V, but the quadratic limitation on V remained. In 1991, Royston published a polynomial fit for , where and (Welsberg–Bingham statistic, an approximation of Shapiro-Francia) up to n = 1000. Combined with lognormal fits for W given , it appears to work well at n = 5000 by comparison with published critical points.[7] The 1991 technique is used in several software packages including GraphPad Prism, Stata,[9][10] SPSS, and SAS.[11]
Rahman and Govidarajulu provided an approximation of W up to n = 5000, though they appear unaware of Royston's 1991 work.[8]