Hostname: page-component-78c5997874-4rdpn Total loading time: 0 Render date: 2024-11-10T19:59:38.276Z Has data issue: false hasContentIssue false
  • English
  • Français

On fast and scalable recurring link’s prediction in evolving multi-graph streams

Published online by Cambridge University Press:  20 January 2020

Shazia Tabassum Open the ORCID record for Shazia Tabassum [Opens in a new window] ,
Bruno Veloso  and
João Gama
Shazia Tabassum*
Affiliation:
INESC TEC and FEUP, University of Porto, Porto, Portugal (e-mail: shazia.tabassum@inesctec.pt)
Bruno Veloso
Affiliation:
INESC TEC, University Portucalense, Porto, Portugal (e-mail: bruno.m.veloso@inesctec.pt)
João Gama
Affiliation:
INESC TEC and FEP, University of Porto, Porto, Portugal (e-mail: jgama@fep.up.pt)
*
*Corresponding author. Email: shazia.tabassum@inesctec.pt
Get access Rights & Permissions [Opens in a new window]

Abstract

The link prediction task has found numerous applications in real-world scenarios. However, in most of the cases like interactions, purchases, mobility, etc., links can re-occur again and again across time. As a result, the data being generated is excessively large to handle, associated with the complexity and sparsity of networks. Therefore, we propose a very fast, memory-less, and dynamic sampling-based method for predicting recurring links for a successive future point in time. This method works by biasing the links exponentially based on their time of occurrence, frequency, and stability. To evaluate the efficiency of our method, we carried out rigorous experiments with massive real-world graph streams. Our empirical results show that the proposed method outperforms the state-of-the-art method for recurring links prediction. Additionally, we also empirically analyzed the evolution of links with the perspective of multi-graph topology and their recurrence probability over time.

Keywords

Hocine Cherilink predictionevolving networkrecurring linksgraph streamstemporal networks
Type
Research Article
Information
Network Science , Volume 8 , Issue S1: Complex Networks 2018 , July 2020 , pp. S65 - S81
Copyright
© Cambridge University Press 2020

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Ahmed, N. K., Duffield, N., Willke, T. L., & Rossi, R. A. (2017). On sampling from massive graph streams. Proceedings of the VLDB Endowment, 10(11), 1430–1441.CrossRefGoogle Scholar
Al Hasan, M., Chaoji, V., Salem, S., & Zaki, M. (2006). Link prediction using supervised learning. In Sdm06: Workshop on link analysis, counter-terrorism and security.Google Scholar
Al Hasan, M., & Zaki, M. J. (2011). A survey of link prediction in social networks. In Charu, C. Aggarwal (Ed.), Social network data analytics (pp. 243–275). Boston, MA: Springer.CrossRefGoogle Scholar
Benchettara, N., Kanawati, R., & Rouveirol, C. (2010). Supervised machine learning applied to link prediction in bipartite social networks. In 2010 international conference on advances in social networks analysis and mining (pp. 326–330). IEEE.CrossRefGoogle Scholar
Chen, H.-H., Miller, D. J., & Giles, C. L. (2013). The predictive value of young and old links in a social network. In Proceedings of the ACM SIGMOD workshop on databases and social networks (pp. 43–48). DBSocial’13. New York, NY, USA: ACM.CrossRefGoogle Scholar
Cochran, W. G. (2007). Sampling techniques. Hoboken, NJ: John Wiley & Sons.Google Scholar
Gama, J., Sebastião, R., & Rodrigues, P. P. (2013). On evaluating stream learning algorithms. Machine Learning, 90(3), 317–346.CrossRefGoogle Scholar
Gama, J., Žliobaitė, I., Bifet, A., Pechenizkiy, M., & Bouchachia, A. (2014). A survey on concept drift adaptation. ACM Computing Surveys (CSUR), 46(4), 44.CrossRefGoogle Scholar
Liben-Nowell, D., & Kleinberg, J. (2007). The link-prediction problem for social networks. Journal of the American Society for Information Science and Technology, 58(7), 1019–1031.CrossRefGoogle Scholar
Lim, Y., Jung, M., & Kang, U. (2018). Memory-efficient and accurate sampling for counting local triangles in graph streams: From simple to multigraphs. ACM Transactions on Knowledge Discovery from Data (TKDD), 12(1), 4.CrossRefGoogle Scholar
Marjan, M., Zaki, N., & Mohamed, E. A. (2018). Link prediction in dynamic social networks: A literature review. 2018 IEEE 5th international congress on information science and technology (CIST) (200–207). IEEE.CrossRefGoogle Scholar
Matuszyk, P., Vinagre, J., Spiliopoulou, M., Jorge, A. M., & Gama, J. (2018). Forgetting techniques for stream-based matrix factorization in recommender systems. Knowledge and Information Systems, 55(2), 275–304.CrossRefGoogle Scholar
Metwally, A., Agrawal, D., & El Abbadi, A. (2005). Efficient computation of frequent and top-k elements in data streams. In International conference on database theory (pp. 398–412). Springer.Google Scholar
Moradabadi, B., & Meybodi, M. R. (2018). Link prediction in weighted social networks using learning automata. Engineering Applications of Artificial Intelligence, 70, 16–24.CrossRefGoogle Scholar
Oliveira, M., Torgo, L., & Costa, V. S. (2018). Evaluation procedures for forecasting with spatio-temporal data. In Joint european conference on machine learning and knowledge discovery in databases (pp. 703–718). Springer.Google Scholar
O’Madadhain, J., Hutchins, J., & Smyth, P. (2005). Prediction and ranking algorithms for event-based network data. ACM SIGKDD Explorations Newsletter, 7(2), 23–30.CrossRefGoogle Scholar
Pan, S., Wu, J., Zhu, X., & Zhang, C. (2014). Graph ensemble boosting for imbalanced noisy graph stream classification. IEEE Transactions on Cybernetics, 45(5), 954–968.Google ScholarPubMed
Papadimitriou, A., Symeonidis, P., & Manolopoulos, Y. (2012). Fast and accurate link prediction in social networking systems. Journal of Systems and Software, 85(9), 2119–2132.CrossRefGoogle Scholar
Pereira, F. S. F., Tabassum, S., Gama, J., de Amo, S., & Oliveira, G. M. B. (2019). Processing evolving social networks for change detection based on centrality measures. In Sayed-Mouchaweh, M. (Ed.), Learning from data streams in evolving environments (pp. 155–176). Switzerland: Springer.CrossRefGoogle Scholar
Raymond, R., & Kashima, H. (2010). Fast and scalable algorithms for semi-supervised link prediction on static and dynamic graphs. In Joint european conference on machine learning and knowledge discovery in databases (pp. 131–147). Springer.CrossRefGoogle Scholar
Rossetti, G., Berlingerio, M., & Giannotti, F. (2011). Scalable link prediction on multidimensional networks. 2011 IEEE 11th international conference on data mining workshops (pp. 979–986). IEEE.CrossRefGoogle Scholar
Sarkar, P., Chakrabarti, D., & Jordan, M. (2012). Nonparametric link prediction in dynamic networks. arxiv preprint arxiv:1206.6394.Google Scholar
Song, H. H., Cho, T. W., Dave, V., Zhang, Y., & Qiu, L. (2009). Scalable proximity estimation and link prediction in online social networks. In Proceedings of the 9th ACM SIGCOMM conference on internet measurement (pp. 322–335). ACM.CrossRefGoogle Scholar
Tabassum, S., & Gama, J. (2016). Sampling massive streaming call graphs. In Proceedings of the 31st annual ACM symposium on applied computing (pp. 923–928). ACM.CrossRefGoogle Scholar
Tabassum, S., & Gama, J. (2018). Biased dynamic sampling for temporal network streams. In International conference on complex networks and their applications (pp. 512–523). Springer.Google Scholar
Tylenda, T., Angelova, R., & Bedathur, S. (2009). Towards time-aware link prediction in evolving social networks. In Proceedings of the 3rd workshop on social network mining and analysis. SNA-KDD’09 (pp. 9:1–9:10). New York, NY, USA: ACM.Google Scholar
Vitter, J. S. (1985). Random sampling with a reservoir. ACM Transactions on Mathematical Software (TOMS), 11(1), 37–57.CrossRefGoogle Scholar
Wang, C., Satuluri, V., & Parthasarathy, S. (2007). Local probabilistic models for link prediction. In Seventh IEEE international conference on data mining (ICDM 2007) (pp. 322–331). IEEE.CrossRefGoogle Scholar
Wang, D., Pedreschi, D., Song, C., Giannotti, F., & Barabasi, A.-L. (2011). Human mobility, social ties, and link prediction. In Proceedings of the 17th ACM SIGKDD international conference on knowledge discovery and data mining (pp. 1100–1108). ACM.CrossRefGoogle Scholar
Zhang, J., Zhu, K., Pei, Y., Fletcher, G., & Pechenizkiy, M. (2017). Clustering-structure representative sampling from graph streams. In International workshop on complex networks and their applications (pp. 265–277). Springer.Google Scholar
Zhao, P., Aggarwal, C., & He, G. (2016). Link prediction in graph streams. In 2016 IEEE 32nd international conference on data engineering (ICDE) (pp. 553–564). IEEE.CrossRefGoogle Scholar
Zhu, L., Guo, D., Yin, J., Ver Steeg, G., & Galstyan, A. (2016). Scalable temporal latent space inference for link prediction in dynamic social networks. IEEE Transactions on Knowledge and Data Engineering, 28(10), 2765–2777.CrossRefGoogle Scholar