zoukankan      html  css  js  c++  java
  • Adjust Pvalues

    Adjust P-values for Multiple Comparisons

    Description

    Given a set of p-values, returns p-values adjusted using one of several methods.

    Usage

    p.adjust(p, method = p.adjust.methods, n = length(p))
    
    p.adjust.methods
    # c("holm", "hochberg", "hommel", "bonferroni", "BH", "BY",
    #   "fdr", "none")
    

    Arguments

    p
    numeric vector of p-values (possibly with NAs). Any other R is coerced by as.numeric.
    method
    correction method
    n
    number of comparisons, must be at least length(p); only set this (to non-default) when you know what you are doing!

    Details

    The adjustment methods include the Bonferroni correction ("bonferroni") in which the p-values are multiplied by the number of comparisons. Less conservative corrections are also included by Holm (1979) ("holm"), Hochberg (1988) ("hochberg"), Hommel (1988) ("hommel"), Benjamini & Hochberg (1995) ("BH" or its alias "fdr"), and Benjamini & Yekutieli (2001) ("BY"), respectively. A pass-through option ("none") is also included. The set of methods are contained in the p.adjust.methods vector for the benefit of methods that need to have the method as an option and pass it on to p.adjust.

    The first four methods are designed to give strong control of the family-wise error rate. There seems no reason to use the unmodified Bonferroni correction because it is dominated by Holm's method, which is also valid under arbitrary assumptions.

    Hochberg's and Hommel's methods are valid when the hypothesis tests are independent or when they are non-negatively associated (Sarkar, 1998; Sarkar and Chang, 1997). Hommel's method is more powerful than Hochberg's, but the difference is usually small and the Hochberg p-values are faster to compute.

    The "BH" (aka "fdr") and "BY" method of Benjamini, Hochberg, and Yekutieli control the false discovery rate, the expected proportion of false discoveries amongst the rejected hypotheses. The false discovery rate is a less stringent condition than the family-wise error rate, so these methods are more powerful than the others.

    Note that you can set n larger than length(p) which means the unobserved p-values are assumed to be greater than all the observed p for "bonferroni" and "holm" methods and equal to 1 for the other methods.

    Examples

    require(graphics)
    
    set.seed(123)
    x <- rnorm(50, mean=c(rep(0,25),rep(3,25)))
    p <- 2*pnorm( sort(-abs(x)))
    
    round(p, 3)
    round(p.adjust(p), 3)
    round(p.adjust(p,"BH"), 3)
    
    ## or all of them at once (dropping the "fdr" alias):
    p.adjust.M <- p.adjust.methods[p.adjust.methods != "fdr"]
    p.adj    <- sapply(p.adjust.M, function(meth) p.adjust(p, meth))
    p.adj.60 <- sapply(p.adjust.M, function(meth) p.adjust(p, meth, n = 60))
    stopifnot(identical(p.adj[,"none"], p), p.adj <= p.adj.60)
    round(p.adj, 3)
    ## or a bit nicer:
    noquote(apply(p.adj, 2, format.pval, digits = 3))
    
    
    ## and a graphic:
    matplot(p, p.adj, ylab="p.adjust(p, meth)", type = "l", asp=1, lty=1:6,
            main = "P-value adjustments")
    legend(.7,.6, p.adjust.M, col=1:6, lty=1:6)
    
    ## Can work with NA's:
    pN <- p; iN <- c(46,47); pN[iN] <- NA
    pN.a <- sapply(p.adjust.M, function(meth) p.adjust(pN, meth))
    ## The smallest 20 P-values all affected by the NA's :
    round((pN.a / p.adj)[1:20, ] , 4)
    
  • 相关阅读:
    ConcurrentHashMap实现原理--转载
    java原子操作的实现原理--转载
    Catch Me If You ... Can't Do Otherwise--转载
    微框架spark--api开发利器
    Exploring Micro-frameworks: Spring Boot--转载
    简约之美jodd--props属性使用
    jodd-cache集锦
    java根据url获取完整域名
    Jodd-vtor验证框架
    倒排列表求交集算法 包括baeza yates的交集算法
  • 原文地址:https://www.cnblogs.com/blueicely/p/2816966.html
Copyright © 2011-2022 走看看