GNR: A universal and efficient node ranking model for various tasks based on graph neural networks
出版年份 2023 全文链接
标题
GNR: A universal and efficient node ranking model for various tasks based on graph neural networks
作者
关键词
-
出版物
PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS
Volume -, Issue -, Pages 129339
出版商
Elsevier BV
发表日期
2023-11-01
DOI
10.1016/j.physa.2023.129339
参考文献
相关参考文献
注意:仅列出部分参考文献,下载原文获取全部文献信息。- GCNFusion: An efficient graph convolutional network based model for information diffusion
- (2022) Bahareh Fatemi et al. EXPERT SYSTEMS WITH APPLICATIONS
- Hypernetwork Dismantling via Deep Reinforcement Learning
- (2022) Dengcheng Yan et al. IEEE Transactions on Network Science and Engineering
- Ranking influential spreaders based on both node k-shell and structural hole
- (2022) Zhili Zhao et al. KNOWLEDGE-BASED SYSTEMS
- Machine learning dismantling and early-warning signals of disintegration in complex systems
- (2021) Marco Grassia et al. Nature Communications
- Online hate network spreads malicious COVID-19 content outside the control of individual social media platforms
- (2021) N. Velásquez et al. Scientific Reports
- Applications of link prediction in social networks: A review
- (2020) Nur Nasuha Daud et al. JOURNAL OF NETWORK AND COMPUTER APPLICATIONS
- A neighborhood link sensitive dismantling method for social networks
- (2020) Zhixiao Wang et al. Journal of Computational Science
- A SIR model assumption for the spread of COVID-19 in different communities
- (2020) Ian Cooper et al. CHAOS SOLITONS & FRACTALS
- A survey on network node ranking algorithms: Representative methods, extensions, and applications
- (2020) JiaQi Liu et al. Science China-Technological Sciences
- An Assessment Method for Traffic State Vulnerability Based on a Cloud Model for Urban Road Network Traffic Systems
- (2020) Zhenping Deng et al. IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS
- Generalized network dismantling
- (2019) Xiao-Long Ren et al. PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA
- The key player problem in complex oscillator networks and electric power grids: Resistance centralities identify local vulnerabilities
- (2019) M. Tyloo et al. Science Advances
- Coupling dynamics of epidemic spreading and information diffusion on complex networks
- (2018) Xiu-Xiu Zhan et al. APPLIED MATHEMATICS AND COMPUTATION
- Identification of influential spreaders in complex networks using HybridRank algorithm
- (2018) Sara Ahajjam et al. Scientific Reports
- Machine Learning in Network Centrality Measures
- (2018) Felipe Grando et al. ACM COMPUTING SURVEYS
- Unification of theoretical approaches for epidemic spreading on complex networks
- (2017) Wei Wang et al. REPORTS ON PROGRESS IN PHYSICS
- Small vulnerable sets determine large network cascades in power grids
- (2017) Yang Yang et al. SCIENCE
- Identifying influential spreaders in complex networks based on gravity formula
- (2016) Ling-ling Ma et al. PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS
- Network dismantling
- (2016) Alfredo Braunstein et al. PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA
- Epidemic processes in complex networks
- (2015) Romualdo Pastor-Satorras et al. REVIEWS OF MODERN PHYSICS
- Leaders in Social Networks, the Delicious Case
- (2011) Linyuan Lü et al. PLoS One
- Identification of influential spreaders in complex networks
- (2010) Maksim Kitsak et al. Nature Physics
- Network medicine: a network-based approach to human disease
- (2010) Albert-László Barabási et al. NATURE REVIEWS GENETICS
- A study of the spreading scheme for viral marketing based on a complex network model
- (2009) Jianmei Yang et al. PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS
- Benchmark graphs for testing community detection algorithms
- (2008) Andrea Lancichinetti et al. PHYSICAL REVIEW E
Discover Peeref hubs
Discuss science. Find collaborators. Network.
Join a conversationPublish scientific posters with Peeref
Peeref publishes scientific posters from all research disciplines. Our Diamond Open Access policy means free access to content and no publication fees for authors.
Learn More