返回
A recursive PSO scheme for gene selection in microarray data
DOI:10.1016/j.asoc.2018.06.019.png)
摘要
En 中文
In DNA microarray datasets, the number of genes are very large, typically in thousands while the number of samples are in hundreds. This raises the issue of generalization in the classification process. Gene selection plays a significant role in improving the accuracy. In this paper, we have proposed a recursive particle swarm optimization approach (PSO) for gene selection. The proposed method refines the feature (gene) space from a very coarse level to a fine-grained one at each recursive step of the algorithm without degrading the accuracy. In addition, we have integrated various filter based ranking methods with the proposed recursive PSO approach. We also propose to use linear support vector machine weight vector to serve as initial gene pool selection. We evaluate our method on five publicly available benchmark microarray datasets. Our approach selects only a small number of genes while yielding substantial improvements in accuracy over state-of-the-art evolutionary methods. (C) 2018 Published by Elsevier B.V.
Keyword:
Particle swarm optimization
Support vector machine (SVM)
Gene selection (GS)
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.6
论文数:
1.4W
被引数:
4.8W
机构
引用论文
Relevance-redundancy feature selection based on ant colony optimization基于蚁群优化的相关性冗余特征选择
PATTERN RECOGNITION
IF7.6

