Graphical-model Based Multiple Testing under Dependence, with Applications to Genome-wide Association Studies

Jie Liu, Chunming Zhang, Catherine McCarty, Peggy Peissig, Elizabeth Burnside, David Page
Proceedings of the 28th Conference on Uncertainty in Artificial Intelligence, PMLR R10:509-520, 2012.

Abstract

Large-scale multiple testing tasks often exhibit dependence, and leveraging the dependence between individual tests is still one challenging and important problem in statistics. With recent advances in graphical models, it is feasible to use them to perform multiple testing under dependence. We propose a multiple testing procedure which is based on a Markov-random-field-coupled mixture model. The ground truth of hypotheses is represented by a latent binary Markov random field, and the observed test statistics appear as the coupled mixture variables. The parameters in our model can be automatically learned by a novel EM algorithm. We use an MCMC algorithm to infer the posterior probability that each hypothesis is null (termed local index of significance), and the false discovery rate can be controlled accordingly. Simulations show that the numerical performance of multiple testing can be improved substantially by using our procedure. We apply the procedure to a real-world genome-wide association study on breast cancer, and we identify several SNPs with strong association evidence.

Cite this Paper

BibTeX
@InProceedings{pmlr-vR10-liu12a, title = {Graphical-model Based Multiple Testing under Dependence, with Applications to Genome-wide Association Studies}, author = {Liu, Jie and Zhang, Chunming and McCarty, Catherine and Peissig, Peggy and Burnside, Elizabeth and Page, David}, booktitle = {Proceedings of the 28th Conference on Uncertainty in Artificial Intelligence}, pages = {509--520}, year = {2012}, editor = {de Freitas, Nando and Murphy, Kevin}, volume = {R10}, series = {Proceedings of Machine Learning Research}, month = {14--18 Aug}, publisher = {PMLR}, pdf = {https://raw.githubusercontent.com/mlresearch/r10/main/assets/liu12a/liu12a.pdf}, url = {https://proceedings.mlr.press/r10/liu12a.html}, abstract = {Large-scale multiple testing tasks often exhibit dependence, and leveraging the dependence between individual tests is still one challenging and important problem in statistics. With recent advances in graphical models, it is feasible to use them to perform multiple testing under dependence. We propose a multiple testing procedure which is based on a Markov-random-field-coupled mixture model. The ground truth of hypotheses is represented by a latent binary Markov random field, and the observed test statistics appear as the coupled mixture variables. The parameters in our model can be automatically learned by a novel EM algorithm. We use an MCMC algorithm to infer the posterior probability that each hypothesis is null (termed local index of significance), and the false discovery rate can be controlled accordingly. Simulations show that the numerical performance of multiple testing can be improved substantially by using our procedure. We apply the procedure to a real-world genome-wide association study on breast cancer, and we identify several SNPs with strong association evidence.}, note = {Reissued by PMLR on 04 October 2026.} }
Endnote
%0 Conference Paper %T Graphical-model Based Multiple Testing under Dependence, with Applications to Genome-wide Association Studies %A Jie Liu %A Chunming Zhang %A Catherine McCarty %A Peggy Peissig %A Elizabeth Burnside %A David Page %B Proceedings of the 28th Conference on Uncertainty in Artificial Intelligence %C Proceedings of Machine Learning Research %D 2012 %E Nando de Freitas %E Kevin Murphy %F pmlr-vR10-liu12a %I PMLR %P 509--520 %U https://proceedings.mlr.press/r10/liu12a.html %V R10 %X Large-scale multiple testing tasks often exhibit dependence, and leveraging the dependence between individual tests is still one challenging and important problem in statistics. With recent advances in graphical models, it is feasible to use them to perform multiple testing under dependence. We propose a multiple testing procedure which is based on a Markov-random-field-coupled mixture model. The ground truth of hypotheses is represented by a latent binary Markov random field, and the observed test statistics appear as the coupled mixture variables. The parameters in our model can be automatically learned by a novel EM algorithm. We use an MCMC algorithm to infer the posterior probability that each hypothesis is null (termed local index of significance), and the false discovery rate can be controlled accordingly. Simulations show that the numerical performance of multiple testing can be improved substantially by using our procedure. We apply the procedure to a real-world genome-wide association study on breast cancer, and we identify several SNPs with strong association evidence. %Z Reissued by PMLR on 04 October 2026.
APA
Liu, J., Zhang, C., McCarty, C., Peissig, P., Burnside, E. & Page, D.. (2012). Graphical-model Based Multiple Testing under Dependence, with Applications to Genome-wide Association Studies. Proceedings of the 28th Conference on Uncertainty in Artificial Intelligence, in Proceedings of Machine Learning Research R10:509-520 Available from https://proceedings.mlr.press/r10/liu12a.html. Reissued by PMLR on 04 October 2026.

Related Material