Bridge Node Detection between Communities Based on GNN
Source abstract
Abstract
In a complex network, some nodes are relatively concentrated in topological structure, thus forming a relatively independent node group, which we call a community. Usually, there are multiple communities on a network, and these communities are interconnected and exchange information with each other. A node that plays an important role in the process of information exchange between communities is called an inter-community bridge node. Traditional methods of defining and detecting bridge nodes mostly quantify the bridging effect of nodes by collecting local structural information of nodes and defining index operations. However, on the one hand, it is often difficult to capture the deep topological information in complex networks based on a single indicator, resulting in inaccurate evaluation results; on the other hand, for networks without community structure, such methods may rely on community partitioning algorithms, which require significant computing power. In this paper, considering the multi-dimensional attributes and structural characteristics of nodes, a deep learning-based framework named BND is designed to quickly and accurately detect bridge nodes. Considering that the bridging function of nodes between communities is abstract and complex, and may be related to the multi-dimensional information of nodes, we construct an attribute graph on the basis of the original graph according to the features of the five dimensions of the node to meet our needs for extracting bridging-related attributes. In the deep learning model, we overlay graph neural network layers to process the input attribute graph and add fully connected layers to improve the final classification effect of the model. Graph neural network algorithms including GCN, GAT, and GraphSAGE are compatible with our proposed framework. To the best of our knowledge, our work is the first application of graph neural network techniques in the field of bridge node detection. Experiments show that our designed framework can effectively capture network topology information and accurately detect bridge nodes in the network. In the overall model effect evaluation results based on indicators such as Accuracy and F1 score, our proposed graph neural network model is generally better than baseline methods. In the best case, our model has an Accuracy of 0.9050 and an F1 score of 0.8728.
Source: crossref · Quality: baseline
Research context
OpenAlex topics: Advanced Graph Neural Networks · Complex Network Analysis Techniques · Advanced Computing and Algorithms
SciVX discovery tags are terminology-based. OpenAlex topics are source-provided classifications.
Affiliations
School of Cyber Science and Engineering, Sichuan University, Chengdu 610065, China
Funding
Key Research and Development Program of Sichuan Province
References (33)
Show source-provided references
1. A local immunization strategy for networks with overlapping community structure10.1016/j.physa.2016.10.014 ↗
2. Kumar, M., Singh, A., and Cherifi, H. (2018, January 23–27). An efficient immunization strategy using overlapping nodes and its neighborhoods. Proceedings of the Companion Proceedings of the Web Conference 2018, Lyon, France.10.1145/3184558.3191566 ↗
3. Identification of information flow-modulating drug targets: A novel bridging paradigm for drug discovery10.1038/clpt.2008.129 ↗
4. Neighborhood-based bridge node centrality tuple for complex network analysis10.1007/s41109-021-00388-1 ↗
5. Identification of bridging centrality in complex networks10.1109/ACCESS.2019.2928058 ↗
6. Jiang, L., Jing, Y., Hu, S., Ge, B., and Xiao, W. (2018). Identifying node importance in a complex network based on node bridging feature. Appl. Sci., 8.10.3390/app8101914 ↗
7. Salathé, M., and Jones, J.H. (2010). Dynamics and control of diseases in networks with community structure. PLoS Comput. Biol., 6.10.1371/journal.pcbi.1000736 ↗
8. Influence maximization in complex networks through optimal percolation10.1038/nature14604 ↗
9. Algebraic connectivity of graphs10.21136/CMJ.1973.101168 ↗
10. Fuzzy communities and the concept of bridgeness in complex networks10.1103/PhysRevE.77.016107 ↗
11. Centrality measures for networks with community structure10.1016/j.physa.2016.01.066 ↗
12. Ranking nodes in complex networks based on local structure and improving closeness centrality10.1016/j.neucom.2018.04.086 ↗
13. Immunization of networks with non-overlapping community structure10.1007/s13278-019-0591-9 ↗
14. Centrality in modular networks10.1140/epjds/s13688-019-0195-7 ↗
15. Measuring node contribution to community structure with modularity vitality10.1109/TNSE.2020.3049068 ↗
16. Graph representation learning
17. Principal component analysis: A review and recent developments10.1098/rsta.2015.0202 ↗
18. Ye, J., Janardan, R., and Li, Q. (2004). Two-dimensional linear discriminant analysis. Adv. Neural Inf. Process. Syst., 17.
19. A typology of deviant workplace behaviors: A multidimensional scaling study10.2307/256693 ↗
20. Perozzi, B., Al-Rfou, R., and Skiena, S. (2014, January 24–27). Deepwalk: Online learning of social representations. Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, New York, NY, USA.10.1145/2623330.2623732 ↗
21. Grover, A., and Leskovec, J. (2016, January 13–17). node2vec: Scalable feature learning for networks. Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, San Francisco, CA, USA.10.1145/2939672.2939754 ↗
22. Ahmed, A., Shervashidze, N., Narayanamurthy, S., Josifovski, V., and Smola, A.J. (2013, January 13–17). Distributed large-scale natural graph factorization. Proceedings of the 22nd International Conference on World Wide Web, Rio de Janeiro, Brazil.10.1145/2488388.2488393 ↗
23. Cao, S., Lu, W., and Xu, Q. (2015, January 19–23). Grarep: Learning graph representations with global structural information. Proceedings of the 24th ACM International on Conference on Information and Knowledge Management, Melbourne, Australia.10.1145/2806416.2806512 ↗
24. Kipf, T.N., and Welling, M. (2016). Semi-supervised classification with graph convolutional networks. arXiv.
25. Hamilton, W., Ying, Z., and Leskovec, J. (2017). Inductive representation learning on large graphs. Adv. Neural Inf. Process. Syst., 30.
26. Veličković, P., Cucurull, G., Casanova, A., Romero, A., Lio, P., and Bengio, Y. (2017). Graph attention networks. arXiv.
27. Qiu, J., Tang, J., Ma, H., Dong, Y., Wang, K., and Tang, J. (2018, January 19–23). Deepinf: Social influence prediction with deep learning. Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, London, UK.10.1145/3219819.3220077 ↗
28. Identifying critical nodes in complex networks via graph convolutional networks10.1016/j.knosys.2020.105893 ↗
29. InfGCN: Identifying influential nodes in complex networks with graph convolutional networks10.1016/j.neucom.2020.07.028 ↗
30. Identifying influential nodes in complex networks10.1016/j.physa.2011.09.017 ↗
31. Rong, Y., Huang, W., Xu, T., and Huang, J. (2019). Dropedge: Towards deep graph convolutional networks on node classification. arXiv.
32. Graph evolution: Densification and shrinking diameters10.1145/1217299.1217301 ↗
33. A survey of transfer learning10.1186/s40537-016-0043-6 ↗