The user is respectfully warned that the data and formulas typed into this page will be picked up by JavaScript, so the data and formulas must follow the grammatical rules of JavaScript. In particular, an integer with a leading zero will be understood to be in base 8. A decimal-pointed number with an unnecessary leading zero on the left of the point may be regarded as wrong.
To top.
Get Holmed p-values
The famous Bonferroni correction for multiple inference is never more powerful than the
Holm (1979)
correction. The latter can be used in every case where the former can be used. I have not seen Holm’s paper, but I have read
Levin (1996)
and
Aickin and Gensler (1996).
They are easy to read, and it is easy to write a program from their description, so I did. Following Aickin and Gensler, I say that p-values corrected by the method of Holm have been “Holmed.” I respectfully invite the reader to select and copy the array of p-values
[ .01 , .017 , .04 ]to the clipboard, to move to the upper text area of the present page, to clear that text area with the “Clear” button if necessary, to paste into that area, and to click on the “Get Holmed p-values” button. The array of corrected p-values will appear in the lower text area. It is [ 0.03 , 0.034 , 0.04 ]. If somebody is using a 5% test boundary, then all three hypotheses are rejected. On the other hand, if the Bonferroni correction were used, then the array of corrected values would be [ .03 , .051 , .12 ], and only one of the hypotheses would be rejected.
The reader sees that these arrays are sorted into ascending order. This is not necessary. They could just as well be in descending order. That is, if the raw p-value array is
[ .04 , .017 , .01 ]then the resulting array of “Holmed” values is
[ 0.04 , 0.034 , 0.03 ]That is, the user may use any order she pleases, any order which seems to follow naturally from the design of her experiment, and my program will follow her order. The program does first sort into ascending order to prepare to do the Holm algorithm, but after the algorithm is finished the program changes the order back to what it was.
Any mistakes which I may have made are my own. They are not Holm’s, Aickin’s, or Gensler’s.
To top.
Run a JavaScript program
While building this page I needed a way to run little JavaScript programs, so I constructed the “Run a JavaScript program” button. When I was done I left the button so users can practice JavaScript programming with it. If a program is in the upper text area, the button will run it. Here is a trivial example:
var x=[]; for( var j=0;j<10;j++ )x[j]=j; x;The user is respectfully invited. To top.
To top.
License, revision date, and e-mail address
This file, including the programs, is in the public domain. The date of this revision is 4 July 2008. Criticism both constructive and destructive comes to me, Harold Kaplan,
at dot
smtw2gh toadmail com
To top.