计算机科学 ›› 2012, Vol. 39 ›› Issue (1): 228-233.

• 人工智能 • 上一篇    下一篇

一种基于拆分的基因选择算法

王永全,焦娜,苗夺谦   

  1. (华东政法大学信息科学与技术系 上海201620);(同济大学计算机科学与技术系 上海201804)
  • 出版日期:2018-11-16 发布日期:2018-11-16

Gene Selection Method Based on Decomposition

  • Online:2018-11-16 Published:2018-11-16

摘要: 基因表达数据是由成千上万个基因及几十个样本组成的,有效的基因选择算法是基因表达数据研究的重要内容。粗糙集是一个有效的去掉冗余特征的工具。然而,对于含有成千上万特征、几十个样本的基因表达数据,现有基于粗糙集的特征选择算法的计算效率会变得非常低。为此,将拆分方法应用于特征选择,提出了一种基于拆分的特征选择算法。该算法把一个复杂的表拆分成简单的、更容易处理的主表与子表形式,然后把它们的结果连接到一起解决初始表的问题。实验结果表明,该算法在保证分类精度的同时,能明显提高计算效率。

关键词: 特征选择,拆分,主表,子表,粗糙集,基因选择

Abstract: Efficient gene selection is a key issue for classifying microarray gene expression data, since the data typically consist of a huge number of genes and a few dozens of samples. Rough set theory is an efficient tool for further reducing redundancy. However, when handling numerous genes, most existing methods based on rough set theory gain worse performance. A gene selection method based on decomposition was presented. The idea of decomposition is to break a complex task down into a master-task and several sub-tasks that are simpler, more manageable and more solvable by using existing induction methods, then joining them together to solve the original task. To evaluate the performance of the proposed approach, we applied it to four benchmark gene expression data sets and compared our results with those obtained by conventional methods. Experimental results illustrate that our algorithm improve computational efficiency significantly while keeping classification accuracy.

Key words: Feature selection, Decomposition, Master-table, Sub-table, Rough set theory, Uene selection

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!