...
首页> 外文期刊>International journal of bioinformatics research and applications >A greedy algorithm for gene selection based on SVM and correlation.
【24h】

A greedy algorithm for gene selection based on SVM and correlation.

机译:一种基于支持向量机和相关性的贪婪基因选择算法。

获取原文
获取原文并翻译 | 示例
           

摘要

Microarrays serve scientists as a powerful and efficient tool to observe thousands of genes and analyse their activeness in normal or cancerous tissues. In general, microarrays are used to measure the expression levels of thounsands of genes in a cell mixture. Gene expression data obtained from microarrays can be used for various applications. One such application is that of gene selection. Gene selection is very similar to the feature selection problem addressed in the machine-learning area. In a nutshell, gene selection is the problem of identifying a minimum set of genes that are responsible for certain events (for example the presence of cancer). Informative gene selection is an important problem arising in the analysis of microarray data. In this paper, we present a novel algorithm for gene selection that combines Support Vector Machines (SVMs) with gene correlations. Experiments show that the new algorithm, called GCI-SVM, obtains a higher classification accuracy using a smaller number of selected genes than the well-known algorithms in the literature.
机译:微阵列为科学家提供了一种强大而有效的工具,可以观察数千种基因并分析其在正常或癌性组织中的活性。通常,微阵列用于测量细胞混合物中基因的簇簇的表达水平。从微阵列获得的基因表达数据可用于多种应用。一种这样的应用是基因选择。基因选择与机器学习领域中解决的特征选择问题非常相似。简而言之,基因选择是确定负责某些事件(例如癌症的存在)的最小基因集的问题。信息基因选择是微阵列数据分析中出现的重要问题。在本文中,我们提出了一种新的基因选择算法,该算法将支持向量机(SVM)与基因相关性相结合。实验表明,与文献中公知的算法相比,称为GCI-SVM的新算法使用较少的选定基因可获得更高的分类精度。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号