Bayesian nonparametric multiple testing

William Cipolli , Timothy Hanson and Alexander C. McLain

Computational Statistics & Data Analysis, 2016, vol. 101, issue C, 64-79

Abstract: Multiple testing, or multiplicity problems often require testing several means with the assumption of rejecting infrequently, as motivated by the need to analyze DNA microarray data. The goal is to keep the combined rate of false discoveries and non-discoveries as small as possible. A discrete approximation to a Polya tree prior that enjoys fast, conjugate updating, centered at the usual Gaussian distribution is proposed. This new technique and the advantages of this approach are demonstrated using extensive simulation and data analysis accompanied by a Java web application. The numerical studies demonstrate that this new procedure shows promising false discovery rate and estimation of key values in the mixture model with very reasonable computational speed.

Keywords: Multiplicity; Polya tree mixture; False discovery rate; MCMC; Deconvolution; Mixtures (search for similar items in EconPapers)
Date: 2016
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0167947316300421
Full text for ScienceDirect subscribers only.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:csdana:v:101:y:2016:i:c:p:64-79

DOI: 10.1016/j.csda.2016.02.016

Access Statistics for this article

Computational Statistics & Data Analysis is currently edited by S.P. Azen

More articles in Computational Statistics & Data Analysis from Elsevier
Bibliographic data for series maintained by Catherine Liu ().