With increasingly massive data sets in biopharmaceutical research, particularly in genomic and related applications, there is concern about how well multiple comparisons methods "scale up" with increasing number of tests (k). Familywise error rate-controlling methods do not scale up well, and false discovery rate-controlling methods do scale up well with increasing k. But neither method scales up well with increasing sample size (n) when testing point nulls. We develop a loss function approach to investigate scale-up properties of various methods; we find that while Efron's recent proposal scales up best when both sample size n and number of tests k increase, but its performance otherwise can be erratic.
Download full-text PDF |
Source |
---|---|
http://dx.doi.org/10.1080/10543406.2011.551326 | DOI Listing |
Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!