Literature DB >> 33772048

Discovering latent node Information by graph attention network.

Weiwei Gu1, Fei Gao2, Xiaodan Lou2, Jiang Zhang3.   

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.

Entities:  

Year:  2021        PMID: 33772048      PMCID: PMC7997918          DOI: 10.1038/s41598-021-85826-x

Source DB:  PubMed          Journal:  Sci Rep        ISSN: 2045-2322            Impact factor:   4.379


  10 in total

1.  Emergence of scaling in random networks

Authors: 
Journal:  Science       Date:  1999-10-15       Impact factor: 47.728

2.  Who dominates whom in the ecosystem? Energy flow bottlenecks and cascading extinctions.

Authors:  Stefano Allesina; Antonio Bodini
Journal:  J Theor Biol       Date:  2004-10-07       Impact factor: 2.691

3.  Identifying influential and susceptible members of social networks.

Authors:  Sinan Aral; Dylan Walker
Journal:  Science       Date:  2012-06-21       Impact factor: 47.728

4.  Navigating networks by using homophily and degree.

Authors:  Ozgür Simşek; David Jensen
Journal:  Proc Natl Acad Sci U S A       Date:  2008-08-25       Impact factor: 11.205

5.  Quantifying long-term scientific impact.

Authors:  Dashun Wang; Chaoming Song; Albert-László Barabási
Journal:  Science       Date:  2013-10-04       Impact factor: 47.728

6.  Large teams develop and small teams disrupt science and technology.

Authors:  Lingfei Wu; Dashun Wang; James A Evans
Journal:  Nature       Date:  2019-02-13       Impact factor: 49.962

7.  node2vec: Scalable Feature Learning for Networks.

Authors:  Aditya Grover; Jure Leskovec
Journal:  KDD       Date:  2016-08

8.  Hierarchicality of trade flow networks reveals complexity of products.

Authors:  Peiteng Shi; Jiang Zhang; Bo Yang; Jingfei Luo
Journal:  PLoS One       Date:  2014-06-06       Impact factor: 3.240

9.  The Hidden Flow Structure and Metric Space of Network Embedding Algorithms Based on Random Walks.

Authors:  Weiwei Gu; Li Gong; Xiaodan Lou; Jiang Zhang
Journal:  Sci Rep       Date:  2017-10-13       Impact factor: 4.379

10.  The evolution of your success lies at the centre of your co-authorship network.

Authors:  Sandra Servia-Rodríguez; Anastasios Noulas; Cecilia Mascolo; Ana Fernández-Vilas; Rebeca P Díaz-Redondo
Journal:  PLoS One       Date:  2015-03-11       Impact factor: 3.240

  10 in total

北京卡尤迪生物科技股份有限公司 © 2022-2023.