Multi-task feature selection in microarray data by binary integer programming

BMC Proceedings

Proceedings

Slobodan Vucetic¹  Liang Lan¹ 

[1] Department of Computer and Information Science, Temple University, Philadelphia, PA, USA;

关键词: Feature Selection;    Feature Subset;    Feature Selection Method;    Feature Selection Algorithm;    Quadratic Programming;   

DOI  :  10.1186/1753-6561-7-S7-S5

来源: Springer

【 摘 要 】

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.

【 授权许可】

CC BY   
© Lan and Vucetic; licensee BioMed Central Ltd. 2013