首页> 外文会议>Evolutionary computation, machine learning and data mining in bioinformatics >Using Rotation Forest for Protein Fold Prediction Problem: An Empirical Study
【24h】

Using Rotation Forest for Protein Fold Prediction Problem: An Empirical Study

机译:利用旋转森林进行蛋白质折叠预测的实证研究

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

摘要

Recent advancement in the pattern recognition field has driven many classification algorithms being implemented to tackle protein fold prediction problem. In this paper, a newly introduced method called Rotation Forest for building ensemble of classifiers based on bootstrap sampling and feature extraction is implemented and applied to challenge this problem. The Rotation Forest is a straight forward extension of bagging algorithms which aims to promote diversity within the ensemble through feature extraction by using Principle Component Analysis (PCA). We compare the performance of the employed method with other Meta classifiers that are based on boosting and bagging algorithms, such as: AdaBoost.Ml, LogitBoost, Bagging and Random Forest. Experimental results show that the Rotation Forest enhanced the protein folding prediction accuracy better than the other applied Meta classifiers, as well as the previous works found in the literature.
机译:模式识别领域的最新进展推动了许多分类算法的实施,以解决蛋白质折叠预测问题。本文提出了一种新引入的称为旋转森林的方法,该方法用于基于引导采样和特征提取构建分类器集合,并将其应用于挑战该问题。旋转森林是装袋算法的直接扩展,旨在通过使用主成分分析(PCA)进行特征提取来促进集成内的多样性。我们将采用的方法与基于增强和装袋算法的其他元分类器的性能进行比较,例如:AdaBoost.Ml,LogitBoost,装袋和随机森林。实验结果表明,Rotation Forest增强了蛋白质折叠预测的准确性,优于其他应用的Meta分类器,以及文献中的先前工作。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号