Multi-task feature selection in microarray data by binary integer programming
Genre
Conference ProceedingDate
2013-12-20Author
Lan, LVucetic, S
Permanent link to this record
http://hdl.handle.net/20.500.12613/5350
Metadata
Show full item recordDOI
10.1186/1753-6561-7-S7-S5Abstract
© 2013 Lan and Vucetic; licensee BioMed Central Ltd. A major challenge in microarray classification is that the number of features is typically orders of magnitude larger than the number of examples. In this paper, we propose a novel feature filter algorithm to select the feature subset with maximal discriminative power and minimal redundancy by solving a quadratic objective function with binary integer constraints. To improve the computational efficiency, the binary integer constraints are relaxed and a low-rank approximation to the quadratic term is applied. The proposed feature selection algorithm was extended to solve multi-task microarray classification problems. We compared the single-task version of the proposed feature selection algorithm with 9 existing feature selection methods on 4 benchmark microarray data sets. The empirical results show that the proposed method achieved the most accurate predictions overall. We also evaluated the multi-task version of the proposed algorithm on 8 multi-task microarray datasets. The multi-task feature selection algorithm resulted in significantly higher accuracy than when using the single-task feature selection methods.Citation to related work
Springer Science and Business Media LLCHas part
BMC ProceedingsADA compliance
For Americans with Disabilities Act (ADA) accommodation, including help with reading this content, please contact scholarshare@temple.eduae974a485f413a2113503eed53cd6c53
http://dx.doi.org/10.34944/dspace/5332