An Adaptive Unsupervised Feature Selection Algorithm Based on MDS for Tumor Gene Data Classification

被引:4
作者
Jin, Bo [1 ,2 ]
Fu, Chunling [3 ]
Jin, Yong [1 ,2 ]
Yang, Wei [2 ]
Li, Shengbin [1 ,2 ]
Zhang, Guangyao [1 ,2 ]
Wang, Zheng [1 ,2 ]
机构
[1] Henan Univ, Sch Artificial Intelligence, Kaifeng 475004, Peoples R China
[2] Henan Univ, Sch Comp & Informat Engn, Kaifeng 475004, Peoples R China
[3] Henan Univ, Sch Phys & Elect, Kaifeng 475004, Peoples R China
基金
美国国家科学基金会;
关键词
unsupervised feature selection; gene data; tumor classification; structure learning; REGRESSION;
D O I
10.3390/s21113627
中图分类号
O65 [分析化学];
学科分类号
070302 ; 081704 ;
摘要
Identifying the key genes related to tumors from gene expression data with a large number of features is important for the accurate classification of tumors and to make special treatment decisions. In recent years, unsupervised feature selection algorithms have attracted considerable attention in the field of gene selection as they can find the most discriminating subsets of genes, namely the potential information in biological data. Recent research also shows that maintaining the important structure of data is necessary for gene selection. However, most current feature selection methods merely capture the local structure of the original data while ignoring the importance of the global structure of the original data. We believe that the global structure and local structure of the original data are equally important, and so the selected genes should maintain the essential structure of the original data as far as possible. In this paper, we propose a new, adaptive, unsupervised feature selection scheme which not only reconstructs high-dimensional data into a low-dimensional space with the constraint of feature distance invariance but also employs l(2,1)-norm to enable a matrix with the ability to perform gene selection embedding into the local manifold structure-learning framework. Moreover, an effective algorithm is developed to solve the optimization problem based on the proposed scheme. Comparative experiments with some classical schemes on real tumor datasets demonstrate the effectiveness of the proposed method.
引用
收藏
页数:17
相关论文
共 38 条
[1]   Supervised, Unsupervised, and Semi-Supervised Feature Selection: A Review on Gene Selection [J].
Ang, Jun Chin ;
Mirzal, Andri ;
Haron, Habibollah ;
Hamed, Haza Nuzly Abdull .
IEEE-ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS, 2016, 13 (05) :971-989
[2]  
Bedo, 2007, ARXIV07042668
[3]  
Boyd S., 2004, CONVEX OPTIMIZATION, DOI [DOI 10.1017/CBO9780511804441, 10.1017/CBO9780511804441]
[4]   Geodesic entropic graphs for dimension and entropy estimation in manifold learning [J].
Costa, JA ;
Hero, AO .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2004, 52 (08) :2210-2221
[5]   Unsupervised Feature Selection with Adaptive Structure Learning [J].
Du, Liang ;
Shen, Yi-Dong .
KDD'15: PROCEEDINGS OF THE 21ST ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING, 2015, :209-218
[6]  
Duda RO, 2001, Pattern Classification, V2nd
[7]  
Gu Q., 2011, Proceedings of the Twenty-Second international joint conference on Artificial Intelligence, V2, P1294
[8]  
He X., 2005, P ADV NEUR INF PROC, V18, P507, DOI DOI 10.5555/2976248.2976312
[9]   A Variance Minimization Criterion to Feature Selection Using Laplacian Regularization [J].
He, Xiaofei ;
Ji, Ming ;
Zhang, Chiyuan ;
Bao, Hujun .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2011, 33 (10) :2013-2025
[10]  
Hou C., 2011, Proceedings of the Twenty-Second international joint conference on Artificial Intelligence, V2, P1324, DOI DOI 10.5591/978-1-57735-516-8/IJCAI11-224