Abstract
Network completion is more challenging than link prediction, as it aims to infer both missing links and nodes. Although various methods exist for this problem, few utilize structural information-specifically, the similarity of local connection patterns. In this study, we introduce a model called C-GIN, which captures local structural patterns in the observed portions of a network using a Graph Auto-Encoder equipped with a Graph Isomorphism Network. This model generalizes these patterns to complete the entire graph. Experimental results on both synthetic and real-world networks across diverse domains indicate that C-GIN not only requires less information but also outperforms baseline prediction models in most cases. Additionally, we propose a metric known as “Reachable Clustering Coefficient (RCC)” based on network structure. Experiments reveal that C-GIN performs better on networks with higher Reachable CC values.
R. Tao and Y. Tao—Those author contribute equally
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Marsden, P.V.: Network data and measurement. Ann. Rev. Sociol. 16(1), 435–463 (1990)
Newman, M.E.: Communities, modules and large-scale structure in networks. Nat. Phys. 8(1), 25–31 (2012)
Cimini, G., Squartini, T., Garlaschelli, D., Gabrielli, A.: Systemic risk analysis on reconstructed economic and financial networks. Sci. Rep. 5(1), 1–12 (2015)
Kossinets, G.: Effects of missing data in social networks. Social networks 28(3), 247–268 (2006)
Anand, K., et al.: The missing links: a global study on uncovering financial network structures from partial data. J. Financ. Stab. 35, 107–119 (2018)
Su, R.-Q., Wang, W.-X., Lai, Y.-C.: Detecting hidden nodes in complex networks from time series. Phys. Rev. E 85(6), 065201 (2012)
Haehne, H., Casadiego, J., Peinke, J., Timme, M.: Detecting hidden units and network size from perceptible dynamics. Phys. Rev. Lett. 122(15), 158301 (2019)
Chen, M., Zhang, Y., Zhang, Z., Du, L., Wang, S., Zhang, J.: Inferring network structure with unobservable nodes from time series data. Chaos: Interdiscip. J. Nonlinear Sci. 32(1), 1 013126 (2022)
Pearl, J.: Causal inference.: Causality: objectives and assessment, pp. 39–58 (2010)
Lichtenwalter, R.N., Lussier, J.T., Chawla, N.V.: New perspectives and methods in link prediction. In: Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 243–252 (2010)
Lü, L., Zhou, T.: Link prediction in complex networks: a survey. Phys. A: A 390(6), 1150–1170 (2011)
Wang, P., Xu, B., Wu, Y., Zhou, X.: Link prediction in social networks: the state-of-the-art. SCIENCE CHINA Inf. Sci. 58(1), 1–38 (2015)
Kipf, T.N., Welling, M.: Semi-supervised classification with graph convolutional networks. arXiv preprint arXiv:1609.02907 (2016)
Bhagat, S., Cormode, G., Muthukrishnan, S.: Node classification in social networks. In: Social network data analytics. Springer, pp. 115–148 (2017)
Rong, Y., Huang, W., Xu, T., Huang, J.: Dropedge: Towards deep graph convolutional networks on node classification. arXiv preprint arXiv:1907.10903 (2019)
Cai, H., Zheng, V.W., Chang, K.C.-C.: A comprehensive survey of graph embedding: problems, techniques, and applications. IEEE Trans. Knowl. Data Eng. 30(9), 1616–1637 (2018)
Bunke, H., Riesen, K.: Graph classification based on dissimilarity space embedding. In: da Vitoria Lobo, N., Kasparis, T., Roli, F., Kwok, J.T., Georgiopoulos, M., Anagnostopoulos, G.C., Loog, M. (eds.) Structural, Syntactic, and Statistical Pattern Recognition, pp. 996–1007. Springer Berlin Heidelberg, Berlin, Heidelberg (2008). https://doi.org/10.1007/978-3-540-89689-0_103
Zhou, T., Lü, L., Zhang, Y.-C.: Predicting missing links via local information. Europ. Phys. J. B 71(4), 623–630 (2009)
Liu, Z., Zhang, Q.-M., Lü, L., Zhou, T.: Link prediction in complex networks: A local naïve bayes model. EPL (Europhysics Letters) 96(4), 48007 (2011)
Tan, F., Xia, Y., Zhu, B.: Link prediction in complex networks: a mutual information perspective. PLoS ONE 9(9), e107056 (2014)
Xu, D., Ruan, C., Motwani, K., Korpeoglu, E., Kumar, S. and Achan, K.: Generative graph convolutional network for growing graphs. In: ICASSP 2019-2019 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). IEEE, 2019, pp. 3167–3171 (2019)
Wei, Q., Hu, G.: Unifying node labels, features, and distances for deep network completion. Entropy 23(6), 771 (2021)
Tran, C., Shin, W.-Y., Spitz, A., Gertz, M.: Deepnc: Deep generative network completion. IEEE Transactions on Pattern Analysis and Machine Intelligence (2020)
Kim, M., Leskovec, J.: The network completion problem: inferring missing nodes and edges in networks. In: Proceedings of the 2011 SIAM International Conference on Data Mining, SIAM, 2011, pp. 47–58 (2011)
Xu, K., Hu, W., Leskovec, J., Jegelka, S.: How powerful are graph neural networks? arXiv preprint arXiv:1810.00826 (2018)
Veličković, P., Cucurull, G., Casanova, A., Romero, A., Lio, P., Bengio, Y.: Graph attention networks. arXiv preprint arXiv:1710.10903 (2017)
Hamilton, W., Ying, Z., Leskovec, J.: Inductive representation learning on large graphs. In: Advances in Neural Information Processing Systems, vol. 30 (2017)
Koutra, D., Parikh, A., Ramdas, A., Xiang, J.: Algorithms for graph similarity and subgraph matching. In: Proceedings of Ecol. inference conf, vol. 17. Citeseer (2011)
Fishkind, D.E., et al.: Seeded graph matching. Pattern Recogn. 87, 203–215 (2019)
Rossi, R., Ahmed, N.: The network data repository with interactive graph analytics and visualization,. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 29, no. 1 (2015)
Rossi, R., Ahmed, N.: The network data repository with interactive graph analytics and visualization. In: AAAI (2015). https://networkrepository.com
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2024 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Zhang, Z., Tao, R., Tao, Y., Qi, M., Zhang, J. (2024). Graph Completion Through Local Pattern Generalization. In: Cherifi, H., Rocha, L.M., Cherifi, C., Donduran, M. (eds) Complex Networks & Their Applications XII. COMPLEX NETWORKS 2023. Studies in Computational Intelligence, vol 1141. Springer, Cham. https://doi.org/10.1007/978-3-031-53468-3_22
Download citation
DOI: https://doi.org/10.1007/978-3-031-53468-3_22
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-53467-6
Online ISBN: 978-3-031-53468-3
eBook Packages: EngineeringEngineering (R0)