首页> 外文会议>IEEE Symposium on Computational Intelligence in Bioinformatics and Computational Biology >Protein Fold Recognition with Adaptive Local Hyperplane Algorithm
【24h】

Protein Fold Recognition with Adaptive Local Hyperplane Algorithm

机译:用自适应局部超平面算法识别蛋白质折叠识别

获取原文

摘要

Protein fold recognition task is important for understanding the biological functions of proteins. The adaptive local hyperplane (ALH) algorithm has been shown to perform better than many other renown classifiers including support vector machines, K-nearest neighbor, linear discriminant analysis, K-local hyperplane distance nearest neighbor algorithms and decision trees on a variety of data sets. In this paper, we apply the ALH algorithm to well-known data sets on protein fold recognition task without sequence similarity from Ding and Dubchak (2001). The results obtained demonstrate that the ALH algorithm outperforms all the seven other very well known and established benchmarking classifiers applied to same data sets.
机译:蛋白质折叠识别任务对于了解蛋白质的生物学功能是重要的。已显示自适应本地超平板(ALH)算法比许多其他荣誉的分类器更好地执行,包括支持向量机,K最近邻居,线性判别分析,K-Local Suploplane距离最近邻算法和各种数据集上的决策树。在本文中,我们将ALH算法应用于众所周知的蛋白质折叠识别任务上的众所周知的数据集,而无需与丁和Dubchak(2001)的序列相似度。获得的结果表明,ALH算法优于应用于相同数据集的七个其他非常众所周知的和建立的基准测试分类。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号