TPLP: Two-Phase Selection Link Prediction for Vertex in Graph Streams

  • Yang Xiao
  • Hong Huang
  • Feng ZhaoEmail author
  • Hai Jin
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11440)


Currently, data in many applications have naturally been modeled as streams over the massive graph infrastructure, e.g., social networks and electronic business. Graph streams are rapidly changing, enormous and endless networks that are too large to maintain in memory or on disks. An important problem in networks is link prediction, which aims to estimate the likelihood of the existence of a specific link. However, in graph streams, predicting the existence of links connected to one vertex is more common. For example, in social networks, we generally want to recommend several friends to a user rather than determining whether a specific user is your friend. Rapidly and accurately predicting groups of links becomes a formidable challenge because of the tremendous size and rapidly updated information of graph streams. In this paper, we propose the problem of link prediction for vertex in graph streams, which aims to predict the top-k vertices, i.e., the top-k links, that are most likely to connect to the target vertex in graph streams. A two-phase selection framework is proposed to predict top-k links with high efficiency and without loss of accuracy. We also propose a novel method for estimating common neighbor in graph streams, which is a very important measure in link prediction. Extensive experiments show that our algorithms are more efficient and more accurate than state-of-the-art methods.


  1. 1.
    Li, X., Chen, H.: Recommendation as link prediction in bipartite graphs: a graph kernel-based machine learning approach. Decis. Support Syst. 54(2), 880–890 (2013)CrossRefGoogle Scholar
  2. 2.
    McGregor, A.: Graph stream algorithms: a survey. ACM SIGMOD Rec. 43(1), 9–20 (2014)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Menche, J., et al.: Uncovering disease-disease relationships through the incomplete interactome. Science 347(6224), 1257601 (2015)CrossRefGoogle Scholar
  4. 4.
    Song, C., Ge, T., Chen, C., Wang, J.: Event pattern matching over graph streams. Proc. VLDB Endow. 8(4), 413–424 (2014)CrossRefGoogle Scholar
  5. 5.
    Wang, P., Xu, B., Wu, Y., Zhou, X.: Link prediction in social networks: the state-of-the-art. Sci. China Inf. Sci. 58(1), 1–38 (2015)Google Scholar
  6. 6.
    Zhao, P., Aggarwal, C., He, G.: Link prediction in graph streams. In: Proceedings of 2016 IEEE 32nd International Conference on Data Engineering (ICDE), pp. 553–564. IEEE (2016)Google Scholar
  7. 7.
    Zhao, P., Aggarwal, C.C., Wang, M.: gSketch: on query estimation in graph streams. Proc. VLDB Endow. 5(3), 193–204 (2011)CrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.National Engineering Center for Big Data Technology and System, Services Computing Technology and System Lab, Cluster and Grid Computing Lab, School of Computer Science and TechnologyHuazhong University of Science and TechnologyWuhanChina

Personalised recommendations