首页> 外文会议>International Conference on Machine Intelligence and Signal Analysis >An Empirical Analysis of Instance-Based Transfer Learning Approach on Protease Substrate Cleavage Site Prediction
【24h】

An Empirical Analysis of Instance-Based Transfer Learning Approach on Protease Substrate Cleavage Site Prediction

机译:基于实例的蛋白酶衬底切割位点预测的实例转移学习方法的实证分析

获取原文

摘要

Classical machine learning algorithms presume the supervised data emerged from the same domain. Transfer learning on the contrary to classical machine learning methods; utilize the knowledge acquired from the auxiliary domains to aid predictive capability of diverse data distribution in the current domain. In the last few decades, there is a significant amount of work done on the domain adaptation and knowledge transfer across the domains in the field of bioinformatics. The computational method for the classification of protease cleavage sites is significantly important in the inhibitors and drug design techniques. Matrix met-alloproteases (MMP) are one such protease that has a crucial role in the disease process. However, the challenge in the computational prediction of MMPs substrate cleavage persists due to the availability of very few experimentally verified sites. The objective of this paper is to explore the cross-domain learning in the classification of protease substrate cleavage sites, such that the lack of availability of one-domain cleavage sites can be furnished by the other available domain knowledge. To achieve this objective, we employed the TrAdaBoost algorithm and its two variants: dynamic TrAdaBoost and multisource TrAdaBoost on the MMPs dataset available at PROSPER. The robustness and acceptability of the TrAdaBoost algorithms in the substrate site identification have been validated by rigorous experiments. The aim of these experiments is to compare the performances among learner. The experimental results demonstrate the potential of dynamic TrAdaBoost algorithms on the protease dataset by outperforming the fundamental and other variants of TrAdaBoost algorithms.
机译:古典机器学习算法假设从同一域中出现的监督数据。转移学习与古典机器学习方法相反;利用辅助域中获取的知识,以帮助当前域中不同数据分布的预测能力。在过去的几十年中,在生物信息学领域的域中的域适应和知识转移,有大量的工作。蛋白酶切割位点分类的计算方法在抑制剂和药物设计技术中显着重要。基质Met-alloprot释放(MMP)是一种这种蛋白酶,其在疾病过程中具有至关重要的作用。然而,由于极少数实验验证的位点,MMPS衬底裂解的计算预测中的挑战仍然存在。本文的目的是探讨蛋白酶衬底裂解位点的分类中的跨域学习,使得可以通过其他可用域知识提供单结构域切割位点的可用性。为实现这一目标,我们使用TradaBoost算法及其两种变体:MIMPS数据集的动态TradaBoost和Multisource Tragaboost。通过严格的实验验证了底物地点识别中的TradaBoost算法的鲁棒性和可接受性。这些实验的目的是比较学习者之间的表现。实验结果表明,通过表现出Tradaboost算法的基本和其他变体来表明蛋白酶数据集上动态Tradaboost算法的潜力。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号