• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • Suppr Zotero 插件Zotero 插件
  • 邀请有礼
  • 套餐&价格
  • 历史记录
应用&插件
Suppr Zotero 插件Zotero 插件浏览器插件Mac 客户端Windows 客户端微信小程序
定价
高级版会员购买积分包购买API积分包
服务
文献检索文档翻译深度研究API 文档MCP 服务
关于我们
关于 Suppr公司介绍联系我们用户协议隐私条款
关注我们

Suppr 超能文献

核心技术专利:CN118964589B侵权必究
粤ICP备2023148730 号-1Suppr @ 2026

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验

利用深度学习和蛋白质-蛋白质相互作用信息进行基因簇组装。

Ensembling of Gene Clusters Utilizing Deep Learning and Protein-Protein Interaction Information.

出版信息

IEEE/ACM Trans Comput Biol Bioinform. 2020 Nov-Dec;17(6):2005-2016. doi: 10.1109/TCBB.2019.2918523. Epub 2020 Dec 8.

DOI:10.1109/TCBB.2019.2918523
PMID:31135367
Abstract

Cluster ensemble techniques aim to combine the outputs of multiple clustering algorithms to obtain a single consensus partitioning. The current paper reports about the development of a cluster ensemble based technique combining the concepts of multiobjective optimization and deep-learning models for gene clustering where some additional protein-protein interaction information are utilized for generating the consensus partitioning. The proposed ensemble based framework works in four phases: (i) filtering out the irrelevant genes from the microarray dataset: only the statistically significant genes are considered for further data analysis; (ii) generation of diverse base partitionings: a multi-objective optimization-based clustering technique is proposed which simultaneously optimizes three different cluster quality measures and generates a set of partitioning solutions on the Pareto optimal front; (iii) generation of a consensus partitioning: mentha scores, calculated by accessing a highly enriched protein-protein interaction archive named mentha, of different clustering solutions are considered for generating a weighted incidence matrix; (iv) finally, two approaches are used to generate a consensus partitioning from the obtained incidence matrix. The first approach is based on a traditional machine learning method, and another approach exploits the graph partitioning algorithm and two deep neural models to generate the final clustering. To validate the efficacy of the proposed ensemble framework, it is applied on five gene expression datasets. We present a comparative analysis of the proposed technique over different clustering algorithms in terms of biological homogeneity index (BHI) and biological stability index (BSI). The traditional approach attains an average 3 and 2 percent improvements over the best non-dominated solution with respect to BHI and BSI, respectively, whereas deep learning models illustrate an average 6.8 and 1.5 percent improvements over the proposed traditional approach with respect to BHI and BSI, respectively. Subsequently, Welch's t-test is executed to prove that the results obtained by the proposed methods are statistically significant. Availability of data and materials: https://github.com/sduttap16/DeepEnsm.

摘要

聚类集成技术旨在结合多个聚类算法的输出,以获得单一的共识划分。本文报告了一种基于聚类集成的技术的发展,该技术结合了多目标优化和深度学习模型的概念,用于基因聚类,其中利用一些额外的蛋白质-蛋白质相互作用信息来生成共识划分。所提出的基于集成的框架分四个阶段工作:(i)从微阵列数据集中过滤掉不相关的基因:仅考虑统计上显著的基因进行进一步数据分析;(ii)生成多样化的基础划分:提出了一种基于多目标优化的聚类技术,该技术同时优化了三个不同的聚类质量度量,并在帕累托最优前沿上生成一组划分解决方案;(iii)生成共识划分:考虑不同聚类解决方案的 mentha 分数,通过访问名为 mentha 的高度富集蛋白质-蛋白质相互作用档案来计算,以生成加权关联矩阵;(iv)最后,从获得的关联矩阵中使用两种方法生成共识划分。第一种方法基于传统的机器学习方法,另一种方法利用图划分算法和两种深度神经网络模型生成最终聚类。为了验证所提出的集成框架的有效性,将其应用于五个基因表达数据集。我们根据生物同质性指数(BHI)和生物稳定性指数(BSI),在不同聚类算法的基础上,对所提出的技术进行了比较分析。传统方法在 BHI 和 BSI 方面分别比最佳非支配解平均提高了 3%和 2%,而深度学习模型在 BHI 和 BSI 方面分别比所提出的传统方法平均提高了 6.8%和 1.5%。随后,进行了 Welch 检验以证明所提出方法获得的结果在统计上是显著的。数据和材料的可用性:https://github.com/sduttap16/DeepEnsm。

相似文献

1
Ensembling of Gene Clusters Utilizing Deep Learning and Protein-Protein Interaction Information.利用深度学习和蛋白质-蛋白质相互作用信息进行基因簇组装。
IEEE/ACM Trans Comput Biol Bioinform. 2020 Nov-Dec;17(6):2005-2016. doi: 10.1109/TCBB.2019.2918523. Epub 2020 Dec 8.
2
A Protein Interaction Information-based Generative Model for Enhancing Gene Clustering.基于蛋白质相互作用信息的基因聚类增强生成模型。
Sci Rep. 2020 Jan 20;10(1):665. doi: 10.1038/s41598-020-57437-5.
3
Combining Pareto-optimal clusters using supervised learning for identifying co-expressed genes.使用监督学习组合帕累托最优聚类以识别共表达基因。
BMC Bioinformatics. 2009 Jan 20;10:27. doi: 10.1186/1471-2105-10-27.
4
A multiobjective multi-view cluster ensemble technique: Application in patient subclassification.一种多目标多视图聚类集成技术:在患者分类中的应用。
PLoS One. 2019 May 23;14(5):e0216904. doi: 10.1371/journal.pone.0216904. eCollection 2019.
5
Multi-class clustering of cancer subtypes through SVM based ensemble of pareto-optimal solutions for gene marker identification.基于 Pareto 最优解的 SVM 集成算法进行癌症亚型的多类聚类以识别基因标志物。
PLoS One. 2010 Nov 12;5(11):e13803. doi: 10.1371/journal.pone.0013803.
6
Protein Complex Detection via Effective Integration of Base Clustering Solutions and Co-Complex Affinity Scores.通过有效整合基本聚类解决方案和共复合体亲和力得分进行蛋白质复合体检测
IEEE/ACM Trans Comput Biol Bioinform. 2017 May-Jun;14(3):733-739. doi: 10.1109/TCBB.2016.2552176. Epub 2016 Apr 8.
7
Knowledge based cluster ensemble for cancer discovery from biomolecular data.基于知识的聚类集成在生物分子数据中的癌症发现。
IEEE Trans Nanobioscience. 2011 Jun;10(2):76-85. doi: 10.1109/TNB.2011.2144997. Epub 2011 Jul 7.
8
Incomplete multi-view gene clustering with data regeneration using Shape Boltzmann Machine.基于形状玻尔兹曼机的数据再生的不完全多视图基因聚类
Comput Biol Med. 2020 Oct;125:103965. doi: 10.1016/j.compbiomed.2020.103965. Epub 2020 Sep 8.
9
Hybrid fuzzy cluster ensemble framework for tumor clustering from biomolecular data.用于从生物分子数据中进行肿瘤聚类的混合模糊聚类集成框架。
IEEE/ACM Trans Comput Biol Bioinform. 2013 May-Jun;10(3):657-70. doi: 10.1109/TCBB.2013.59.
10
Predicting protein complexes from weighted protein-protein interaction graphs with a novel unsupervised methodology: Evolutionary enhanced Markov clustering.利用一种新颖的无监督方法从加权蛋白质 - 蛋白质相互作用图预测蛋白质复合物:进化增强的马尔可夫聚类。
Artif Intell Med. 2015 Mar;63(3):181-9. doi: 10.1016/j.artmed.2014.12.012. Epub 2015 Feb 18.

引用本文的文献

1
A Protein Interaction Information-based Generative Model for Enhancing Gene Clustering.基于蛋白质相互作用信息的基因聚类增强生成模型。
Sci Rep. 2020 Jan 20;10(1):665. doi: 10.1038/s41598-020-57437-5.