SNP Selection in Genome-Wide Association Studies via Penalized Support Vector Machine with MAX Test
Author(s) -
JinSeog Kim,
Insuk Sohn,
Dennis Kim,
SinHo Jung
Publication year - 2013
Publication title -
computational and mathematical methods in medicine
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.462
H-Index - 48
eISSN - 1748-6718
pISSN - 1748-670X
DOI - 10.1155/2013/340678
Subject(s) - support vector machine , genome wide association study , computer science , single nucleotide polymorphism , genetic association , snp , selection (genetic algorithm) , feature selection , artificial intelligence , machine learning , data mining , biology , genetics , genotype , gene
One of main objectives of a genome-wide association study (GWAS) is to develop a prediction model for a binary clinical outcome using single-nucleotide polymorphisms (SNPs) which can be used for diagnostic and prognostic purposes and for better understanding of the relationship between the disease and SNPs. Penalized support vector machine (SVM) methods have been widely used toward this end. However, since investigators often ignore the genetic models of SNPs, a final model results in a loss of efficiency in prediction of the clinical outcome. In order to overcome this problem, we propose a two-stage method such that the the genetic models of each SNP are identified using the MAX test and then a prediction model is fitted using a penalized SVM method. We apply the proposed method to various penalized SVMs and compare the performance of SVMs using various penalty functions. The results from simulations and real GWAS data analysis show that the proposed method performs better than the prediction methods ignoring the genetic models in terms of prediction power and selectivity.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom