Enhancing Graph Neural Networks via Memorized Global Information
Article No.: 50, Pages 1 - 34
Abstract
Graph neural networks (GNNs) have gained significant attention for their impressive results on different graph-based tasks. The essential mechanism of GNNs is the message-passing framework, whereby node representations are aggregated from local neighborhoods. Recently, Transformer-based GNNs have been introduced to learn the long-range dependencies, enhancing performance. However, their quadratic computational complexity, due to the attention computation, has constrained their applicability on large-scale graphs. To address this issue, we propose MGIGNN (Memorized Global Information Graph Neural Network), an innovative approach that leverages memorized global information to enhance existing GNNs in both transductive and inductive scenarios. Specifically, MGIGNN captures long-range dependencies by identifying and incorporating global similar nodes, which are defined as nodes exhibiting similar features, structural patterns and label information within a graph. To alleviate the computational overhead associated with computing embeddings for all nodes, we introduce an external memory module to facilitate the retrieval of embeddings and optimize performance on large graphs. To enhance the memory-efficiency, MGIGNN selectively retrieves global similar nodes from a small set of candidate nodes. These candidate nodes are selected from the training nodes based on a sparse node selection distribution with a Dirichlet prior. This selecting approach not only reduces the memory size required but also ensures efficient utilization of computational resources. Through comprehensive experiments conducted on ten widely-used and real-world datasets, including seven homogeneous datasets and three heterogeneous datasets, we demonstrate that our MGIGNN can generally improve the performance of existing GNNs on node classification tasks under both inductive and transductive settings.
References
[1]
Uri Alon and Eran Yahav. 2020. On the bottleneck of graph neural networks and its practical implications. In International Conference on Learning Representations.
[2]
Alessandro Bicciato, Luca Cosmo, Giorgia Minello, Luca Rossi, and Andrea Torsello. 2023. Classifying me softly: A novel graph neural network based on features soft-alignment. In Structural, Syntactic, and Statistical Pattern Recognition: Joint IAPR International Workshops, S+ SSPR 2022, Montreal, QC, Canada, August 26–27, 2022, Proceedings. Springer, 43–53.
[3]
Mitchell Black, Zhengchao Wan, Amir Nayyeri, and Yusu Wang. 2023. Understanding oversquashing in gnns through the lens of effective resistance. In International Conference on Machine Learning. PMLR, 2528–2547.
[4]
Deyu Bo, Xiao Wang, Chuan Shi, and Huawei Shen. 2021. Beyond low-frequency information in graph convolutional networks. In Proceedings of the AAAI Conference on Artificial Intelligence, Vol. 35. 3950–3957.
[5]
Aleksandar Bojchevski and Stephan Günnemann. 2018. Deep Gaussian embedding of graphs: Unsupervised inductive learning via ranking. In International Conference on Learning Representations.
[6]
Marc Brockschmidt. 2020. Gnn-film: Graph neural networks with feature-wise linear modulation. In International Conference on Machine Learning. PMLR, 1144–1152.
[7]
Shaked Brody, Uri Alon, and Eran Yahav. 2021. How attentive are graph attention networks? In International Conference on Learning Representations.
[8]
Jie Cai, Xin Wang, Chaoyu Guan, Yateng Tang, Jin Xu, Bin Zhong, and Wenwu Zhu. 2022. Multimodal continual graph learning with neural architecture search. In Proceedings of the ACM Web Conference 2022. 1292–1300.
[9]
Dexiong Chen, Leslie O’Bray, and Karsten Borgwardt. 2022. Structure-aware transformer for graph representation learning. In International Conference on Machine Learning. PMLR, 3469–3489.
[10]
Jinsong Chen, Kaiyuan Gao, Gaichao Li, and Kun He. 2022. NAGphormer: A tokenized graph transformer for node classification in large graphs. In The Eleventh International Conference on Learning Representations.
[11]
Ming Chen, Zhewei Wei, Zengfeng Huang, Bolin Ding, and Yaliang Li. 2020. Simple and deep graph convolutional networks. In International Conference on Machine Learning. 1725–1735.
[12]
Wei-Lin Chiang, Xuanqing Liu, Si Si, Yang Li, Samy Bengio, and Cho-Jui Hsieh. 2019. Cluster-gcn: An efficient algorithm for training deep and large graph convolutional networks. In Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining. 257–266.
[13]
Djork-Arné Clevert, Thomas Unterthiner, and Sepp Hochreiter. 2016. Fast and accurate deep network learning by exponential linear units (elus). In International Conference on Learning Representations.
[14]
Vijay Prakash Dwivedi, Ladislav Rampášek, Michael Galkin, Ali Parviz, Guy Wolf, Anh Tuan Luu, and Dominique Beaini. 2022. Long range graph benchmark. Advances in Neural Information Processing Systems 35 (2022), 22326–22340.
[15]
Nicole B. Ellison, Charles Steinfield, and Cliff Lampe. 2007. The benefits of Facebook “friends:” Social capital and college students’ use of online social network sites. Journal of Computer-Mediated Communication 12, 4 (2007), 1143–1168.
[16]
Jinyuan Fang, Shangsong Liang, Zaiqiao Meng, and Maarten De Rijke. 2021. Hyperspherical variational co-embedding for attributed networks. ACM Transactions on Information Systems (TOIS) 40, 3 (2021), 1–36.
[17]
Jinyuan Fang, Qiang Zhang, Zaiqiao Meng, and Shangsong Liang. 2021. Structure-aware random fourier kernel for graphs. In Advances in Neural Information Processing Systems. 17681–17694.
[18]
Matthias Fey. 2019. Just jump: Dynamic neighborhood aggregation in graph neural networks. In International Conference on Learning Representations.
[19]
Matthias Fey and Jan Eric Lenssen. 2019. Fast graph representation learning with PyTorch geometric. In ICLR 2019 (RLGM Workshop).
[20]
Matthias Fey, Jan E. Lenssen, Frank Weichert, and Jure Leskovec. 2021. Gnnautoscale: Scalable and expressive graph neural networks via historical embeddings. In International Conference on Machine Learning. 3294–3304.
[21]
Xinyu Fu, Jiani Zhang, Ziqiao Meng, and Irwin King. 2020. Magnn: Metapath aggregated graph neural network for heterogeneous graph embedding. In Proceedings of the Web Conference 2020. 2331–2341.
[22]
Hongyang Gao, Yi Liu, and Shuiwang Ji. 2021. Topology-aware graph pooling networks. IEEE Transactions on Pattern Analysis and Machine Intelligence 43, 12 (2021), 4512–4518.
[23]
Jing Gao, Feng Liang, Wei Fan, Yizhou Sun, and Jiawei Han. 2009. Graph-based consensus maximization among multiple supervised and unsupervised models. In Advances in Neural Information Processing Systems.
[24]
Will Hamilton, Zhitao Ying, and Jure Leskovec. 2017. Inductive representation learning on large graphs. In Advances in Neural Information Processing Systems.
[25]
Arman Hasanzadeh, Ehsan Hajiramezanali, Shahin Boluki, Mingyuan Zhou, Nick Duffield, Krishna Narayanan, and Xiaoning Qian. 2020. Bayesian graph neural networks with adaptive connection sampling. In International Conference on Machine Learning. PMLR, 4094–4104.
[26]
Junxian He, Taylor Berg-Kirkpatrick, and Graham Neubig. 2020. Learning sparse prototypes for text generation. In Advances in Neural Information Processing Systems. 14724–14735.
[27]
Xiaoxin He, Bryan Hooi, Thomas Laurent, Adam Perold, Yann LeCun, and Xavier Bresson. 2023. A generalization of vit/mlp-mixer to graphs. In International Conference on Machine Learning. PMLR, 12724–12745.
[28]
Jun Hu, Shengsheng Qian, Quan Fang, Youze Wang, Quan Zhao, Huaiwen Zhang, and Changsheng Xu. 2021. Efficient graph deep learning in tensorflow with tf_geometric. In Proceedings of the 29th ACM International Conference on Multimedia. 3775–3778.
[29]
Jun Hu, Shengsheng Qian, Quan Fang, and Changsheng Xu. 2019. Hierarchical graph semantic pooling network for multi-modal community question answer matching. In Proceedings of the 27th ACM International Conference on Multimedia. 1157–1165.
[30]
Weihua Hu, Matthias Fey, Marinka Zitnik, Yuxiao Dong, Hongyu Ren, Bowen Liu, Michele Catasta, and Jure Leskovec. 2020. Open graph benchmark: Datasets for machine learning on graphs. In Advances in Neural Information Processing Systems. 22118–22133.
[31]
Ziniu Hu, Yuxiao Dong, Kuansan Wang, and Yizhou Sun. 2020. Heterogeneous graph transformer. In Proceedings of the Web Conference 2020. 2704–2710.
[32]
Lokesh Jain, Rahul Katarya, and Shelly Sachdeva. 2023. Opinion leaders for information diffusion using graph neural network in online social networks. ACM Transactions on the Web 17, 2 (2023), 1–37.
[33]
Ming Ji, Yizhou Sun, Marina Danilevsky, Jiawei Han, and Jing Gao. 2010. Graph regularized transductive classification on heterogeneous information networks. In Machine Learning and Knowledge Discovery in Databases: European Conference, ECML PKDD 2010, Barcelona, Spain, September 20–24, 2010, Proceedings, Part I 21. Springer, 570–586.
[34]
Weiwei Jiang and Jiayun Luo. 2022. Graph neural network for traffic forecasting: A survey. In Expert Systems with Applications, Elsevier, 117921.
[35]
Di Jin, Cuiying Huo, Chundong Liang, and Liang Yang. 2021. Heterogeneous graph neural network via attribute completion. In Proceedings of the Web Conference 2021. 391–400.
[36]
Seokho Kang. 2021. K-nearest neighbor learning with graph neural networks. Mathematics 9, 8 (2021), 830.
[37]
Urvashi Khandelwal, Omer Levy, Dan Jurafsky, Luke Zettlemoyer, and Mike Lewis. 2019. Generalization through memorization: Nearest neighbor language models. In International Conference on Learning Representations.
[38]
Diederik P. Kingma and Jimmy Ba. 2015. Adam: A method for stochastic optimization. In International Conference on Learning Representations.
[39]
Thomas N. Kipf and Max Welling. 2017. Semi-supervised classification with graph convolutional networks. In International Conference on Learning Representations.
[40]
Katelyn A. Kirchner, Daniel R. Cassar, Edgar D. Zanotto, Madoka Ono, Seong H. Kim, Karan Doss, Mikkel L. Bødker, Morten M. Smedskjaer, Shinji Kohara, Longwen Tang, and others. 2022. Beyond the average: Spatial and temporal fluctuations in oxide glass-forming systems. Chemical Reviews 123, 4 (2022), 1774–1840.
[41]
Devin Kreuzer, Dominique Beaini, Will Hamilton, Vincent Létourneau, and Prudencio Tossou. 2021. Rethinking graph transformers with spectral attention. In Advances in Neural Information Processing Systems. 21618–21629.
[42]
Fuxian Li, Jie Feng, Huan Yan, Guangyin Jin, Fan Yang, Funing Sun, Depeng Jin, and Yong Li. 2023. Dynamic graph convolutional recurrent network for traffic prediction: Benchmark and solution. ACM Transactions on Knowledge Discovery from Data 17, 1 (2023), 1–21.
[43]
Guohao Li, Chenxin Xiong, Ali Thabet, and Bernard Ghanem. 2020. Deepergcn: All you need to train deeper gcns. arXiv preprint arXiv:2006.07739 (2020).
[44]
Qimai Li, Zhichao Han, and Xiao-Ming Wu. 2018. Deeper insights into graph convolutional networks for semi-supervised learning. In Thirty-Second AAAI Conference on Artificial Intelligence.
[45]
Qian Li, Hao Peng, Jianxin Li, Congying Xia, Renyu Yang, Lichao Sun, Philip S. Yu, and Lifang He. 2022. A survey on text classification: From traditional to deep learning. ACM Transactions on Intelligent Systems and Technology (TIST) 13, 2 (2022), 1–41.
[46]
Yakun Li, Lei Hou, and Juanzi Li. 2023. Preference-aware graph attention networks for cross-domain recommendations with collaborative knowledge graph. ACM Transactions on Information Systems 41, 3 (2023), 1–26.
[47]
Nan Lin. 2017. Building a network theory of social capital. In Social Capital, Routledge, 3–28.
[48]
Meng Liu, Hongyang Gao, and Shuiwang Ji. 2020. Towards deeper graph neural networks. In Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining. 338–348.
[49]
Siwei Liu, Zaiqiao Meng, Craig Macdonald, and Iadh Ounis. 2023. Graph neural pre-training for recommendation with side information. ACM Transactions on Information Systems 41, 3 (2023), 1–28.
[50]
Denis Lukovnikov and Asja Fischer. 2021. Improving breadth-wise backpropagation in graph neural networks helps learning long-range dependencies. In International Conference on Machine Learning. PMLR, 7180–7191.
[51]
Man Luo, Arindam Mitra, Tejas Gokhale, and Chitta Baral. 2022. Improving biomedical information retrieval with neural retrievers. In Proceedings of the AAAI Conference on Artificial Intelligence, Vol. 36. 11038–11046.
[52]
Man Luo, Mihir Parmar, Jayasurya Sevalur Mahendran, Sahit Jain, Samarth Rawal, and Chitta Baral. 2022. SCONER: Scoring negative candidates\(\backslash\)\(\backslash\)Before training neural re-ranker for question answering. In ICML 2022 Workshop on Knowledge Retrieval and Language Models.
[53]
Vinod Nair and Geoffrey E. Hinton. 2010. Rectified linear units improve restricted Boltzmann machines. In Proceedings of the 27th International Conference on International Conference on Machine Learning. 807–814.
[54]
Adam Paszke, Sam Gross, Soumith Chintala, Gregory Chanan, Edward Yang, Zachary DeVito, Zeming Lin, Alban Desmaison, Luca Antiga, and Adam Lerer. 2017. Automatic differentiation in pytorch. In NIPS 2017 Workshop on Autodiff.
[55]
Shengsheng Qian, Dizhan Xue, Huaiwen Zhang, Quan Fang, and Changsheng Xu. 2021. Dual adversarial graph neural networks for multi-label cross-modal retrieval. In Proceedings of the AAAI Conference on Artificial Intelligence, Vol. 35. 2440–2448.
[56]
Meng Qu, Yoshua Bengio, and Jian Tang. 2019. Gmnn: Graph Markov neural networks. In International Conference on Machine Learning. 5241–5250.
[57]
Meng Qu, Huiyu Cai, and Jian Tang. 2021. Neural structured prediction for inductive node classification. In International Conference on Learning Representations.
[58]
Ying Qu, Hairong Qi, and Chiman Kwan. 2018. Unsupervised sparse dirichlet-net for hyperspectral image super-resolution. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition. 2511–2520.
[59]
Ladislav Rampášek, Michael Galkin, Vijay Prakash Dwivedi, Anh Tuan Luu, Guy Wolf, and Dominique Beaini. 2022. Recipe for a general, powerful, scalable graph transformer. In Advances in Neural Information Processing Systems. 14501–14515.
[60]
Manon Réau, Nicolas Renaud, Li C. Xue, and Alexandre MJJ Bonvin. 2023. DeepRank-GNN: A graph neural network framework to learn patterns in protein–protein interfaces. Bioinformatics 39, 1 (2023), btac759.
[61]
Yu Rong, Wenbing Huang, Tingyang Xu, and Junzhou Huang. 2019. Dropedge: Towards deep graph convolutional networks on node classification. In International Conference on Learning Representations.
[62]
T. Konstantin Rusch, Michael M. Bronstein, and Siddhartha Mishra. 2023. A survey on oversmoothing in graph neural networks. SAM Research Report 2023 (2023).
[63]
T. Konstantin Rusch, Ben Chamberlain, James Rowbottom, Siddhartha Mishra, and Michael Bronstein. 2022. Graph-coupled oscillator networks. In International Conference on Machine Learning. PMLR, 18888–18909.
[64]
T. Konstantin Rusch, Benjamin Paul Chamberlain, Michael W. Mahoney, Michael M. Bronstein, and Siddhartha Mishra. 2022. Gradient gating for deep multi-rate learning on graphs. In The Eleventh International Conference on Learning Representations.
[65]
Lei Sang, Min Xu, Shengsheng Qian, Matt Martin, Peter Li, and Xindong Wu. 2020. Context-dependent propagating-based video recommendation in multimodal heterogeneous information networks. In IEEE Transactions on Multimedia. IEEE, 2019–2032.
[66]
Jayaram Sethuraman. 1994. A constructive definition of Dirichlet priors. In Statistica Sinica, JSTOR, 639–650.
[67]
Oleksandr Shchur, Maximilian Mumme, Aleksandar Bojchevski, and Stephan Günnemann. 2018. Pitfalls of graph neural network evaluation. CoRR abs/1811.05868, (2018).
[68]
Heiko Strathmann, Mohammadamin Barekatain, Charles Blundell, and Petar Veličković. 2021. Persistent message passing. In ICLR 2021 Workshop on Geometrical and Topological Representation Learning.
[69]
Jie Tang, Jing Zhang, Limin Yao, Juanzi Li, Li Zhang, and Zhong Su. 2008. Arnetminer: Extraction and mining of academic social networks. In Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 990–998.
[70]
Jake Topping, Francesco Di Giovanni, Benjamin Paul Chamberlain, Xiaowen Dong, and Michael M. Bronstein. 2021. Understanding over-squashing and bottlenecks on graphs via curvature. In International Conference on Learning Representations.
[71]
Petar Veličković, Guillem Cucurull, Arantxa Casanova, Adriana Romero, Pietro Liò, and Yoshua Bengio. 2018. Graph attention networks. In International Conference on Learning Representations.
[72]
Saurabh Verma and Zhi-Li Zhang. 2019. Stability and generalization of graph convolutional neural networks. In Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining. 1539–1548.
[73]
Kuansan Wang, Zhihong Shen, Chiyuan Huang, Chieh-Han Wu, Yuxiao Dong, and Anshul Kanakia. 2020. Microsoft academic graph: When experts are not enough. Quantitative Science Studies 1, 1 (2020), 396–413.
[74]
Xiao Wang, Houye Ji, Chuan Shi, Bai Wang, Yanfang Ye, Peng Cui, and Philip S. Yu. 2019. Heterogeneous graph attention network. In The World Wide Web Conference. 2022–2032.
[75]
Yingxu Wang, Xiaoru Chen, Jinyuan Fang, Zaiqiao Meng, and Shangsong Liang. 2023. Enhancing conversational recommendation systems with representation fusion. ACM Transactions on the Web 17, 1 (2023), 1–34.
[76]
Yuelin Wang, Kai Yi, Xinliang Liu, Yu Guang Wang, and Shi Jin. 2022. ACMP: Allen-cahn message passing with attractive and repulsive forces for graph neural networks. In The Eleventh International Conference on Learning Representations.
[77]
Lanning Wei, Huan Zhao, Zhiqiang He, and Quanming Yao. 2023. Neural architecture search for GNN-based graph classification. ACM Transactions on Information Systems 42, 1 (2023), 1–29.
[78]
Felix Wu, Amauri Souza, Tianyi Zhang, Christopher Fifty, Tao Yu, and Kilian Weinberger. 2019. Simplifying graph convolutional networks. In International Conference on Machine Learning. 6861–6871.
[79]
Lingfei Wu, Yu Chen, Kai Shen, Xiaojie Guo, Hanning Gao, Shucheng Li, Jian Pei, Bo Long, and others. 2023. Graph neural networks for natural language processing: A survey. In Foundations and Trends® in Machine Learning, Now Publishers, Inc., 119–328.
[80]
Qitian Wu, Wentao Zhao, Zenan Li, David P. Wipf, and Junchi Yan. 2022. Nodeformer: A scalable graph structure learning transformer for node classification. Advances in Neural Information Processing Systems 35 (2022), 27387–27401.
[81]
Shiwen Wu, Fei Sun, Wentao Zhang, Xu Xie, and Bin Cui. 2022. Graph neural networks in recommender systems: A survey. In ACM Computing Surveys, ACM New York, NY, 1–37.
[82]
Zhanghao Wu, Paras Jain, Matthew Wright, Azalia Mirhoseini, Joseph E Gonzalez, and Ion Stoica. 2021. Representing long-range context for graph neural networks with global attention. Advances in Neural Information Processing Systems 34 (2021), 13266–13279.
[83]
Louis-Pascal Xhonneux, Meng Qu, and Jian Tang. 2020. Continuous graph neural networks. In International Conference on Machine Learning. 10432–10441.
[84]
Keyulu Xu, Weihua Hu, Jure Leskovec, and Stefanie Jegelka. 2018. How powerful are graph neural networks? In International Conference on Learning Representations.
[85]
Keyulu Xu, Chengtao Li, Yonglong Tian, Tomohiro Sonobe, Ken-ichi Kawarabayashi, and Stefanie Jegelka. 2018. Representation learning on graphs with jumping knowledge networks. In International Conference on Machine Learning. 5453–5462.
[86]
Mingqi Yang, Renjian Wang, Yanming Shen, Heng Qi, and Baocai Yin. 2022. Breaking the expression bottleneck of graph neural networks. IEEE Transactions on Knowledge and Data Engineering 35, 6 (2022), 5652–5664.
[87]
Zhilin Yang, William Cohen, and Ruslan Salakhudinov. 2016. Revisiting semi-supervised learning with graph embeddings. In International Conference on Machine Learning. 40–48.
[88]
Chengxuan Ying, Tianle Cai, Shengjie Luo, Shuxin Zheng, Guolin Ke, Di He, Yanming Shen, and Tie-Yan Liu. 2021. Do transformers really perform badly for graph representation? In Advances in Neural Information Processing Systems. 28877–28888.
[89]
Haiyang Yu, Limei Wang, Bokun Wang, Meng Liu, Tianbao Yang, and Shuiwang Ji. 2022. GraphFM: Improving large-scale GNN training via feature momentum. In International Conference on Machine Learning. 25684–25701.
[90]
Hanqing Zeng, Muhan Zhang, Yinglong Xia, Ajitesh Srivastava, Andrey Malevich, Rajgopal Kannan, Viktor Prasanna, Long Jin, and Ren Chen. 2021. Decoupling the depth and scope of graph neural networks. Advances in Neural Information Processing Systems 34 (2021), 19665–19679.
[91]
Ningyu Zhang, Xin Xie, Xiang Chen, Shumin Deng, Chuanqi Tan, Fei Huang, Xu Cheng, and Huajun Chen. 2022. Reasoning through memorization: Nearest neighbor knowledge graph embeddings. arXiv:2201.05575. Retrieved from https://arxiv.org/abs/2201.05575
[92]
Wentao Zhang, Zeang Sheng, Yuezihan Jiang, Yikuan Xia, Jun Gao, Zhi Yang, and Bin Cui. 2021. Evaluating deep graph neural networks. arXiv preprint arXiv:2108.00955 (2021).
[93]
Wayne Xin Zhao, Jing Liu, Ruiyang Ren, and Ji-Rong Wen. 2024. Dense text retrieval based on pretrained language models: A survey. ACM Transactions on Information Systems 42, 4 (2024), 1–60.
[94]
Kaixiong Zhou, Xiao Huang, Daochen Zha, Rui Chen, Li Li, Soo-Hyun Choi, and Xia Hu. 2021. Dirichlet energy constrained learning for deep graph neural networks. In Advances in Neural Information Processing Systems. 21834–21846.
[95]
Hao Zhu and Piotr Koniusz. 2020. Simple spectral graph convolution. In International Conference on Learning Representations.
[96]
Haorui Zhu, Fei Xiong, Hongshu Chen, Xi Xiong, and Liang Wang. 2024. Incorporating a triple graph neural network with multiple implicit feedback for social recommendation. ACM Transactions on the Web 18, 2 (2024), 1–26.
[97]
Marinka Zitnik and Jure Leskovec. 2017. Predicting multicellular function through multi-layer tissue networks. Bioinformatics 33, 14 (2017), i190–i198.
Index Terms
- Enhancing Graph Neural Networks via Memorized Global Information
Recommendations
Improving graph neural network via complex-network-based anchor structure
AbstractThe technique of graph/network embedding in artificial intelligence, which embeds graph data into a low-dimensional vector space in the form of machine learning, can help computer to efficiently process and analyze the complex graph ...
Pre-Train and Learn: Preserving Global Information for Graph Neural Networks
AbstractGraph neural networks (GNNs) have shown great power in learning on graphs. However, it is still a challenge for GNNs to model information faraway from the source node. The ability to preserve global information can enhance graph representation and ...
Semantic-enhanced graph neural networks with global context representation
AbstractNode classification is a crucial task for efficiently analyzing graph-structured data. Related semi-supervised methods have been extensively studied to address the scarcity of labeled data in emerging classes. However, two fundamental weaknesses ...
Comments
Information & Contributors
Information
Published In
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 08 October 2024
Online AM: 28 August 2024
Accepted: 16 July 2024
Revised: 04 May 2024
Received: 10 November 2023
Published in TWEB Volume 18, Issue 4
Check for updates
Author Tags
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 314Total Downloads
- Downloads (Last 12 months)314
- Downloads (Last 6 weeks)77
Reflects downloads up to 10 Nov 2024
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in