• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • 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分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验

通过图注意力网络发现潜在节点信息。

Discovering latent node Information by graph attention network.

作者信息

Gu Weiwei, Gao Fei, Lou Xiaodan, Zhang Jiang

机构信息

Information Science and Technology, Beijing University of Chemical Technology, Beijing, 100029, People's Republic of China.

School of Systems Science, Beijing Normal University, Beijing, 100875, People's Republic of China.

出版信息

Sci Rep. 2021 Mar 26;11(1):6967. doi: 10.1038/s41598-021-85826-x.

DOI:10.1038/s41598-021-85826-x
PMID:33772048
原文链接:https://pmc.ncbi.nlm.nih.gov/articles/PMC7997918/
Abstract

In this paper, we propose graph attention based network representation (GANR) which utilizes the graph attention architecture and takes graph structure as the supervised learning information. Compared with node classification based representations, GANR can be used to learn representation for any given graph. GANR is not only capable of learning high quality node representations that achieve a competitive performance on link prediction, network visualization and node classification but it can also extract meaningful attention weights that can be applied in node centrality measuring task. GANR can identify the leading venture capital investors, discover highly cited papers and find the most influential nodes in Susceptible Infected Recovered Model. We conclude that link structures in graphs are not limited on predicting linkage itself, it is capable of revealing latent node information in an unsupervised way once a appropriate learning algorithm, like GANR, is provided.

摘要

在本文中,我们提出了基于图注意力的网络表示(GANR),它利用图注意力架构并将图结构作为监督学习信息。与基于节点分类的表示相比,GANR可用于学习任何给定图的表示。GANR不仅能够学习高质量的节点表示,在链接预测、网络可视化和节点分类方面取得有竞争力的性能,还能提取有意义的注意力权重,可应用于节点中心性测量任务。GANR可以识别领先的风险投资投资者,发现高被引论文,并在易感-感染-恢复模型中找到最有影响力的节点。我们得出结论,图中的链接结构不仅限于预测链接本身,一旦提供合适的学习算法,如图注意力网络表示(GANR),它能够以无监督的方式揭示潜在的节点信息。

相似文献

1
Discovering latent node Information by graph attention network.通过图注意力网络发现潜在节点信息。
Sci Rep. 2021 Mar 26;11(1):6967. doi: 10.1038/s41598-021-85826-x.
2
A Multi-Task Representation Learning Architecture for Enhanced Graph Classification.一种用于增强图分类的多任务表示学习架构。
Front Neurosci. 2020 Jan 9;13:1395. doi: 10.3389/fnins.2019.01395. eCollection 2019.
3
Self-supervised contrastive graph representation with node and graph augmentation.自监督对比图表示与节点和图增强。
Neural Netw. 2023 Oct;167:223-232. doi: 10.1016/j.neunet.2023.08.039. Epub 2023 Aug 24.
4
Multiview Deep Graph Infomax to Achieve Unsupervised Graph Embedding.用于实现无监督图嵌入的多视图深度图信息最大化
IEEE Trans Cybern. 2023 Oct;53(10):6329-6339. doi: 10.1109/TCYB.2022.3163721. Epub 2023 Sep 15.
5
Community-CL: An Enhanced Community Detection Algorithm Based on Contrastive Learning.社区CL:一种基于对比学习的增强型社区检测算法。
Entropy (Basel). 2023 May 29;25(6):864. doi: 10.3390/e25060864.
6
Self-Supervised Node Representation Learning via Node-to-Neighbourhood Alignment.通过节点到邻域对齐的自监督节点表示学习
IEEE Trans Pattern Anal Mach Intell. 2024 Jun;46(6):4218-4233. doi: 10.1109/TPAMI.2024.3358541. Epub 2024 May 7.
7
Multi-level attention pooling for graph neural networks: Unifying graph representations with multiple localities.图神经网络的多层次注意池化:统一具有多个局部性的图表示。
Neural Netw. 2022 Jan;145:356-373. doi: 10.1016/j.neunet.2021.11.001. Epub 2021 Nov 10.
8
Accurate graph classification via two-staged contrastive curriculum learning.通过两阶段对比课程学习实现准确的图分类。
PLoS One. 2024 Jan 3;19(1):e0296171. doi: 10.1371/journal.pone.0296171. eCollection 2024.
9
SeBioGraph: Semi-supervised Deep Learning for the Graph via Sustainable Knowledge Transfer.SeBioGraph:通过可持续知识转移实现的图的半监督深度学习
Front Neurorobot. 2021 Apr 1;15:665055. doi: 10.3389/fnbot.2021.665055. eCollection 2021.
10
TransformerG2G: Adaptive time-stepping for learning temporal graph embeddings using transformers.TransformerG2G:使用转换器学习时间图嵌入的自适应时间步长。
Neural Netw. 2024 Apr;172:106086. doi: 10.1016/j.neunet.2023.12.040. Epub 2023 Dec 26.

引用本文的文献

1
MDFGNN-SMMA: prediction of potential small molecule-miRNA associations based on multi-source data fusion and graph neural networks.MDFGNN-SMMA:基于多源数据融合和图神经网络的潜在小分子- miRNA关联预测
BMC Bioinformatics. 2025 Jan 13;26(1):13. doi: 10.1186/s12859-025-06040-4.
2
MIFAM-DTI: a drug-target interactions predicting model based on multi-source information fusion and attention mechanism.MIFAM-DTI:一种基于多源信息融合和注意力机制的药物-靶点相互作用预测模型。
Front Genet. 2024 May 6;15:1381997. doi: 10.3389/fgene.2024.1381997. eCollection 2024.
3
Unveiling Latent Structure of Venture Capital Syndication Networks.

本文引用的文献

1
Large teams develop and small teams disrupt science and technology.大团队推动科学技术发展,小团队则颠覆之。
Nature. 2019 Feb;566(7744):378-382. doi: 10.1038/s41586-019-0941-9. Epub 2019 Feb 13.
2
The Hidden Flow Structure and Metric Space of Network Embedding Algorithms Based on Random Walks.基于随机游走的网络嵌入算法的隐藏流结构与度量空间
Sci Rep. 2017 Oct 13;7(1):13114. doi: 10.1038/s41598-017-12586-y.
3
node2vec: Scalable Feature Learning for Networks.节点2向量:网络的可扩展特征学习
揭示风险投资联合网络的潜在结构。
Entropy (Basel). 2022 Oct 21;24(10):1506. doi: 10.3390/e24101506.
4
Coupled Information-Epidemic Spreading Dynamics with Selective Mass Media.耦合信息-疫情传播动力学与选择性大众媒体
Entropy (Basel). 2023 Jun 12;25(6):927. doi: 10.3390/e25060927.
5
Predicting COVID-19 positivity and hospitalization with multi-scale graph neural networks.用多尺度图神经网络预测 COVID-19 阳性率和住院率。
Sci Rep. 2023 Mar 31;13(1):5235. doi: 10.1038/s41598-023-31222-6.
6
A Complex Heterogeneous Network Model of Disease Regulated by Noncoding RNAs: A Case Study of Unstable Angina Pectoris.非编码 RNA 调控疾病的复杂异质网络模型:以不稳定型心绞痛为例。
Comput Intell Neurosci. 2022 Dec 23;2022:5852089. doi: 10.1155/2022/5852089. eCollection 2022.
KDD. 2016 Aug;2016:855-864. doi: 10.1145/2939672.2939754.
4
The evolution of your success lies at the centre of your co-authorship network.你成功的演变位于你共同作者网络的核心。
PLoS One. 2015 Mar 11;10(3):e0114302. doi: 10.1371/journal.pone.0114302. eCollection 2015.
5
Hierarchicality of trade flow networks reveals complexity of products.贸易流网络的层次性揭示了产品的复杂性。
PLoS One. 2014 Jun 6;9(6):e98247. doi: 10.1371/journal.pone.0098247. eCollection 2014.
6
Quantifying long-term scientific impact.量化长期科学影响力。
Science. 2013 Oct 4;342(6154):127-32. doi: 10.1126/science.1237825.
7
Identifying influential and susceptible members of social networks.识别社交网络中的有影响力和易感染成员。
Science. 2012 Jul 20;337(6092):337-41. doi: 10.1126/science.1215842. Epub 2012 Jun 21.
8
Navigating networks by using homophily and degree.利用同质性和度数来导航网络。
Proc Natl Acad Sci U S A. 2008 Sep 2;105(35):12758-62. doi: 10.1073/pnas.0800497105. Epub 2008 Aug 25.
9
Who dominates whom in the ecosystem? Energy flow bottlenecks and cascading extinctions.在生态系统中谁支配谁?能量流动瓶颈与级联灭绝。
J Theor Biol. 2004 Oct 7;230(3):351-8. doi: 10.1016/j.jtbi.2004.05.009.
10
Emergence of scaling in random networks.随机网络中幂律分布的出现。
Science. 1999 Oct 15;286(5439):509-12. doi: 10.1126/science.286.5439.509.