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

• Tipo: Artigo em Revista Científica Internacional
• Data: 2020

Autores

Tabassum, S (Autor) Outra; Veloso, B (Autor) Outra; João Gama (Autor) FEP

Revista

Título: Network Science

Vol. 8

Páginas: S65-S81

ISSN: 2050-1242

Editora: Cambridge University Press

Indexação

ISI Web of Knowledge - 0 Citações

Scopus - 3 Citações

Outras Informações

ID Authenticus: P-00R-NHA

DOI: 10.1017/nws.2019.64

Abstract (EN): 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.

Idioma: Inglês

Tipo (Avaliação Docente): Científica

Nº de páginas: 17