Evidential k-NN for Link Prediction - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2017

Evidential k-NN for Link Prediction

Résumé

Social networks play a major role in today's society, they have shaped the unfolding of social relationships. To analyze networks dynamics, link prediction i.e., predicting potential new links between actors, is concerned with inspecting networks topology evolution over time. A key issue to be addressed is the imperfection of real world social network data which are usually missing, noisy, or partially observed. This uncertainty is perfectly handled under the general framework of the belief function theory. Here, link prediction is addressed from a supervised learning perspective by extending the evidential k-nearest neighbors approach. Each nearest neighbor represents a source of information concerning new links existence. Overall evidence is pooled via the belief function theory fusion scheme. Experiments are conducted on real social network data where performance is evaluated along with a comparative study. Experiment results confirm the effectiveness of the proposed framework, especially when handling skewness in data.
Fichier principal
Vignette du fichier
ECSQARU_vf Sabrine.pdf (305.07 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03649415 , version 1 (22-04-2022)

Identifiants

Citer

Sabrine Mallek, Imen Boukhris, Zied Elouedi, Eric Lefevre. Evidential k-NN for Link Prediction. European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty, ECSQARU'2017, Jul 2017, Lugano, Switzerland. pp.201-211, ⟨10.1007/978-3-319-61581-3_19⟩. ⟨hal-03649415⟩

Collections

UNIV-ARTOIS LGI2A
27 Consultations
43 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More