Abstract
Link prediction is a hot research topic in complex network. Traditional link prediction is based on similarities between nodes, such as common neighbors and Jaccard index. These methods are easy to understand and widely used. However, most existing works use a single relationship between two target nodes, lacking the use of information around the two target nodes. Due to the poor scalability of these methods, the performances of link prediction are not good. In this paper, we propose a novel link prediction method, learning Subgraph structure with Long-Short Term Memory network (SG-LSTM), which uses a recurrent neural network to learn the subgraph patterns to predict links. First, we extract the enclosing subgraph of the target link. Second, we use a graph labeling algorithm called the hash-based Weisfeiler-Lehman (HWL) algorithm to re-label the extracted closed subgraphs, which maps the subgraphs to the sequential data that reflects the subgraph structure. Finally, these sequential data are trained using long-short term memory network (LSTM) to learn the link prediction model. This learned LSTM model is used to predict the link. Large-scale experiments verify that our proposed method has superior link prediction performances to traditional link prediction methods.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Liben-Nowell, D., Kleinberg, J.: The link-prediction problem for social networks. J. Am. Soc. Inf. Sci. Technol. 58(7), 1019–1031 (2007)
Adamic, L.A., Adar, E.: Friends and neighbors on the web. Soc. Networks 25(3), 211–230 (2003)
Lin, Y., Liu, Z., Sun, M., Liu, Y., Zhu, X.: Learning entity and relation embeddings for knowledge graph completion. In: Proceedings of AAAI (2015)
Lü, L., Zhou, T.: Link prediction in complex networks: a survey. Phys. A 390, 1150–1170 (2011)
Zhou, T., Lü, L., Zhang, Y.-C.: Predicting missing links via local information. Eur. Phys. J. B 71(4), 623–630 (2009)
Zhang, M., Chen, Y.: Weisfeiler-lehman neural machine for link prediction. In: Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 575–583. ACM (2017)
Hochreiter, S., Schmidhuber, J.: Long short-term memory. Neural Comput. 9, 1735–1780 (1997)
Hasan, M., Chaoji, V., Salem, S., Zaki, M.: Link prediction using supervised learning. In: Proceedings of the Workshop on Link Discovery: Issues, Approaches and Applications (2005)
Perozzi, B., Al-Rfou, R., Skiena, S.: Deepwalk: online learning of social representations. In: Proceedings of KDD, pp. 701–710 (2014)
Grover, A., Leskovec, J.: node2vec: Scalable feature learning for networks. In: Proceedings of KDD, pp. 855–864 (2016)
Shervashidze, N., et al.: Weisfeiler-lehman graph kernels. J. Mach. Learn. Res. 12, 2539–2561 (2011)
Kersting, K., Mladenov, M., Garnett, R., Grohe, M.: Power iterated color refnement. In: AAAI, pp. 1904–1910 (2014)
Yuan, W., He, K., Guan, D., Zhou, L., Li, C.: Graph kernel based link prediction for signed social networks. Inf. Fusion 46, 1–10 (2019)
Liu, Z., Dong, W., Fu, Y.: Local degree blocking model for missing link prediction in complex networks. Chaos 25, 013115 (2015)
Barabási, A.-L., Albert, R.: Emergence of scaling in random networks. Science 286(5439), 509–512 (1999)
Taheri, A., Gimpel, K., Berger-Wolf, T.: Learning graph representations with recurrent neural network autoencoders. In: KDD DL Day (2018)
Zhang, M., Chen, Y.: Link prediction based on graph neural networks. In: Advances in Neural Information Processing Systems, pp. 5165–5175 (2018)
Wilkinson, S., Dunn, S., Ma, S.: The vulnerability of the European air traffic network to spatial hazards. Nat. Hazards 60(3), 1027–1036 (2012)
Watts, D.J., Strogatz, S.H.: Collective dynamics of ‘small-world’ networks. Nature 393(6684), 440–442 (1998)
Spring, N., Mahajan, R., Wetherall, D., Anderson, T.: Measuring ISP topologies with rocketfuel. IEEE/ACM Trans. Networking 12(1), 2–16 (2004)
Meraz, S.: Using time series analysis to measure intermedia agenda-setting influence in traditional media and political blog networks. Journalism Mass Commun. Q. 88(1), 176–194 (2011)
Acknowledgement
This research was supported by Nature Science Foundation of China (Grant No. 61672284), Natural Science Foundation of Jiangsu Province (Grant No. BK20171418), China Postdoctoral Science Foundation (Grant No. 2016M591841), Jiangsu Planned Projects for Postdoctoral Research Funds (No. 1601225C).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Han, Y., Guan, D., Yuan, W. (2019). Learning Subgraph Structure with LSTM for Complex Network Link Prediction. In: Li, J., Wang, S., Qin, S., Li, X., Wang, S. (eds) Advanced Data Mining and Applications. ADMA 2019. Lecture Notes in Computer Science(), vol 11888. Springer, Cham. https://doi.org/10.1007/978-3-030-35231-8_3
Download citation
DOI: https://doi.org/10.1007/978-3-030-35231-8_3
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-35230-1
Online ISBN: 978-3-030-35231-8
eBook Packages: Computer ScienceComputer Science (R0)