Mining pure, strict epistatic interactions from high-dimensional datasets: ameliorating the curse of dimensionality.
BACKGROUND
The interaction between loci to affect phenotype is called epistasis. It is strict epistasis if no proper subset of the interacting loci exhibits a marginal effect. For many diseases, it is likely that unknown epistatic interactions affect disease susceptibility. A difficulty when mining epistatic interactions from high-dimensional datasets concerns the curse of dimensionality. There are too many combinations of SNPs to perform an exhaustive search. A method that could locate strict epistasis without an exhaustive search can be considered the brass ring of methods for analyzing high-dimensional datasets.


RESULTS
A SNP pattern is a Bayesian network representing SNP-disease relationships. The Bayesian score for a SNP pattern is the probability of the data given the pattern, and has been used to learn SNP patterns. We identified a bound for the score of a SNP pattern. The bound provides an upper limit on the Bayesian score of any pattern that could be obtained by expanding a given pattern. We felt that the bound might enable the data to say something about the promise of expanding a 1-SNP pattern even when there are no marginal effects. We tested the bound using simulated datasets and semi-synthetic high-dimensional datasets obtained from GWAS datasets. We found that the bound was able to dramatically reduce the search time for strict epistasis. Using an Alzheimer's dataset, we showed that it is possible to discover an interaction involving the APOE gene based on its score because of its large marginal effect, but that the bound is most effective at discovering interactions without marginal effects.


CONCLUSIONS
We conclude that the bound appears to ameliorate the curse of dimensionality in high-dimensional datasets. This is a very consequential result and could be pivotal in our efforts to reveal the dark matter of genetic disease risk from high-dimensional datasets.
Department of Biomedical Informatics, University of Pittsburgh, Pittsburgh, Pennsylvania, United States of America. xij6@pitt.edu
Xia
X
Jiang
Richard E
RE
Neapolitan
D000465:Algorithms; D000544:Alzheimer Disease / Q000235:genetics; D001499:Bayes Theorem; D001943:Breast Neoplasms / Q000235:genetics; D016022:Case-Control Studies; D003198:Computer Simulation; D057225:Data Mining; D004843:Epistasis, Genetic; D005260:Female; D055106:Genome-Wide Association Study; D006801:Humans; D008390:Markov Chains; D008957:Models, Genetic; D020411:Oligonucleotide Array Sequence Analysis; D020641:Polymorphism, Single Nucleotide