Link prediction in bipartite graphs using internal links and weighted projection - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2011

Link prediction in bipartite graphs using internal links and weighted projection

Oussama Allali
  • Fonction : Auteur
  • PersonId : 978337
Clémence Magnien
Matthieu Latapy

Résumé

Many real-world complex networks, like client-product or file-provider relations, have a bipartite nature and evolve during time. Predicting links that will appear in them is one of the main approach to understand their dynamics. Only few works address the bipartite case, though, despite its high practical interest and the specific challenges it raises. We define in this paper the notion of internal links in bipartite graphs and propose a link prediction method based on them. We describe the method and experimentally compare it to a basic collaborative filtering approach. We present results obtained for two typical practical cases. We reach the conclusion that our method performs very well, and that internal links play an important role in bipartite graphs and their dynamics.
Fichier principal
Vignette du fichier
Allali2011.pdf (437.61 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-01286948 , version 1 (06-10-2022)

Licence

Paternité

Identifiants

Citer

Oussama Allali, Clémence Magnien, Matthieu Latapy. Link prediction in bipartite graphs using internal links and weighted projection. Third International Workshop on Network Science for Communication Networks (Netscicom 2011), In Conjuction with IEEE Infocom 2011, Apr 2011, Shanghai, China. pp.936-941, ⟨10.1109/INFCOMW.2011.5928947⟩. ⟨hal-01286948⟩
1486 Consultations
104 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More