Introduces NSBM and a VEM-plus-FDR procedure that controls false discovery rate for graph inference with optimal true discovery rate up to small remainder terms as graph size grows.
2014/07/30 file: RRV2019_arxiv.tex date: July 25, 2019 /Graph inference with FDR control 37 t1,q,ℓ(θ0) = 0 if and only if σq,ℓ≥σ0 and t2,q,ℓ(θ0) = 1 if and only if σq,ℓ≤σ0
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.ST 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Graph inference with clustering and false discovery rate control
Introduces NSBM and a VEM-plus-FDR procedure that controls false discovery rate for graph inference with optimal true discovery rate up to small remainder terms as graph size grows.