首页> 外文会议>European Conference on 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,袋装和随机森林。实验结果表明,旋转森林比其他应用元分类器更好地提高了蛋白质折叠预测精度,以及文献中的先前作品。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号