fdrBH

Compute FDR threshold based on Benjamini-Hochberg (BH) algorithm

Simultaneously detect the number and locations of change points in piecewise linear models under stationary Gaussian noise allowing autocorrelated random noise. The core idea is to transform the problem of detecting change points into the detection of local extrema (local maxima and local minima)through kernel smoothing and differentiation of the data sequence, see Cheng et al. (2020) <doi:10.1214/20-EJS1751>. A low-computational and fast algorithm call 'dSTEM' is introduced to detect change points based on the 'STEM' algorithm in D. Cheng and A. Schwartzman (2017) <doi:10.1214/16-AOS1458>.

Zhibing He

dSTEM

Multiple Testing of Local Extrema for Detection of Change Points

fdrBH function

<dl><dt>p</dt>
<dd>a vector of p-values</dd>
<dt>q</dt>
<dd>False Discovery Rate level</dd></dl>

Arguments

Compute FDR threshold based on Benjamini-Hochberg (BH) algorithm — fdrBH

<dl>

<dt>p</dt>
<dd>a vector of p-values</dd>


<dt>q</dt>
<dd>False Discovery Rate level</dd>

</dl>

fdrBH: Compute FDR threshold based on Benjamini-Hochberg (BH) algorithm

Description

Usage

Value

Arguments

Examples