title: Learning Predictive Interactions Using Information Gain and Bayesian Network Scoring.
abstract: BACKGROUND
  The problems of correlation and classification are long-standing in the fields of statistics and machine learning, and techniques have been developed to address these problems. We are now in the era of high-dimensional data, which is data that can concern billions of variables. These data present new challenges. In particular, it is difficult to discover predictive variables, when each variable has little marginal effect. An example concerns Genome-wide Association Studies (GWAS) datasets, which involve millions of single nucleotide polymorphism (SNPs), where some of the SNPs interact epistatically to affect disease status. Towards determining these interacting SNPs, researchers developed techniques that addressed this specific problem. However, the problem is more general, and so these techniques are applicable to other problems concerning interactions. A difficulty with many of these techniques is that they do not distinguish whether a learned interaction is actually an interaction or whether it involves several variables with strong marginal effects.
  
  
  RESULTS
  We address this problem using information gain and Bayesian network scoring. First, we identify candidate interactions by determining whether together variables provide more information than they do separately. Then we use Bayesian network scoring to see if a candidate interaction really is a likely model. Our strategy is called MBS-IGain. Using 100 simulated datasets and a real GWAS Alzheimer's dataset, we investigated the performance of MBS-IGain.
  
  
  CONCLUSIONS
  When analyzing the simulated datasets, MBS-IGain substantially out-performed nine previous methods at locating interacting predictors, and at identifying interactions exactly. When analyzing the real Alzheimer's dataset, we obtained new results and results that substantiated previous findings. We conclude that MBS-IGain is highly effective at finding interactions in high-dimensional datasets. This result is significant because we have increasingly abundant high-dimensional data in many domains, and to learn causes and perform prediction/classification using these data, we often must first identify interactions.
authors.affiliation: Department of Biomedical Informatics, University of Pittsburgh, Pittsburgh, PA 15213, United States of America.
authors.forename: Xia
authors.initials: X
authors.lastname: Jiang
authors.affiliation: Department of Biomedical Informatics, University of Pittsburgh, Pittsburgh, PA 15213, United States of America.
authors.forename: Jeremy
authors.initials: J
authors.lastname: Jao
authors.affiliation: Department of Preventive Medicine, Northwestern University Feinberg School of Medicine, Chicago, IL 60611, United States of America.
authors.forename: Richard
authors.initials: R
authors.lastname: Neapolitan
mesh_terms: D000465:Algorithms; D001499:Bayes Theorem; D019295:Computational Biology / Q000379:methods*; D055106:Genome-Wide Association Study; D000069550:Machine Learning; D020641:Polymorphism, Single Nucleotide