RESEARCH ARTICLE
Feature Selection Algorithm Based on Mutual Information and Lasso for Microarray Data
Wang Zhongxin1, Sun Gang1, 2, *, Zhang Jing3, Zhao Jia1
Article Information
Identifiers and Pagination:
Year: 2016Volume: 10
First Page: 278
Last Page: 286
Publisher ID: TOBIOTJ-10-278
DOI: 10.2174/1874070701610010278
Article History:
Received Date: 17/11/2015Revision Received Date: 30/06/2016
Acceptance Date: 19/07/2016
Electronic publication date: 31/10/2016
Collection year: 2016
open-access license: This is an open access article licensed under the terms of the Creative Commons Attribution-Non-Commercial 4.0 International Public License (CC BY-NC 4.0) (https://creativecommons.org/licenses/by-nc/4.0/legalcode), which permits unrestricted, non-commercial use, distribution and reproduction in any medium, provided the work is properly cited.
Abstract
With the development of microarray technology, massive microarray data is produced by gene expression experiments, and it provides a new approach for the study of human disease. Due to the characteristics of high dimensionality, much noise and data redundancy for microarray data, it is difficult to my knowledge from microarray data profoundly and accurately,and it also brings enormous difficulty for information genes selection. Therefore, a new feature selection algorithm for high dimensional microarray data is proposed in this paper, which mainly involves two steps. In the first step, mutual information method is used to calculate all genes, and according to the mutual information value, information genes is selected as candidate genes subset and irrelevant genes are filtered. In the second step, an improved method based on Lasso is used to select information genes from candidate genes subset, which aims to remove the redundant genes. Experimental results show that the proposed algorithm can select fewer genes, and it has better classification ability, stable performance and strong generalization ability. It is an effective genes feature selection algorithm.
