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.
(56) Moreover, for t∈Tθ0(K) with|t−Tθ0(α)|≤ ε, we have |F1,θ0(θ0,t )−F1,θ0(θ0,Tθ0(α))|≤W T,q1(ε)
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.