The false discovery rate for statistical pattern recognition
From MaRDI portal
Publication:1951997
Abstract: The false discovery rate (FDR) and false nondiscovery rate (FNDR) have received considerable attention in the literature on multiple testing. These performance measures are also appropriate for classification, and in this work we develop generalization error analyses for FDR and FNDR when learning a classifier from labeled training data. Unlike more conventional classification performance measures, the empirical FDR and FNDR are not binomial random variables but rather a ratio of binomials, which introduces challenges not addressed in conventional analyses. We develop distribution-free uniform deviation bounds and apply these to obtain finite sample bounds and strong universal consistency.
Recommendations
- On a generalized false discovery rate
- Estimating the false discovery rate using the stochastic approximation algorithm
- False discovery rate for scanning statistics
- False discovery rate approach to dynamic change detection
- A Direct Approach to False Discovery Rates
- The false discovery rate: a variable selection perspective
- False discovery rate envelopes
- Learning false discovery rates by fitting sigmoidal threshold functions
- False discovery rate estimation for large-scale homogeneous discrete \(p\)-values
Cites work
- scientific article; zbMATH DE number 48363 (Why is no real title available?)
- scientific article; zbMATH DE number 720689 (Why is no real title available?)
- scientific article; zbMATH DE number 893887 (Why is no real title available?)
- A Direct Approach to False Discovery Rates
- A Neyman–Pearson Approach to Statistical Learning
- Advanced Lectures on Machine Learning
- An algorithm for information structuring and retrieval
- Combinatorial methods in density estimation
- Considering cost asymmetry in learning classifiers
- Empirical Bayes Analysis of a Microarray Experiment
- Error-correcting tournaments
- Generalization bounds for the area under the ROC curve
- Higher criticism for detecting sparse heterogeneous mixtures.
- Learning minimum volume sets
- Occam’s Hammer
- Optimal aggregation of classifiers in statistical learning.
- Performance Measures for Neyman–Pearson Classification
- Positive false discovery proportions: intrinsic bounds and adaptive control
- Probability Inequalities for Sums of Bounded Random Variables
- Ranking and empirical minimization of \(U\)-statistics
- Resampling-Based Confidence Regions and Multiple Tests for a Correlated Random Vector
- Some PAC-Bayesian theorems
- The positive false discovery rate: A Bayesian interpretation and the \(q\)-value
- Transductive Rademacher Complexity and Its Applications
Cited in
(8)- A multiple testing protocol for exploratory data analysis and the local misclassification rate
- Binary classification with pFDR-pFNR losses
- Fisher’s Conditionality Principle in Statistical Pattern Recognition
- False Discovery Rates for Spatial Signals
- On false discovery rate thresholding for classification under sparsity
- Error rate control for classification rules in multiclass mixture models
- False discovery rate approach to dynamic change detection
- scientific article; zbMATH DE number 1943764 (Why is no real title available?)
This page was built for publication: The false discovery rate for statistical pattern recognition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1951997)
