Joint neighborhood subgraphs link prediction

Dinh Tran-Van, Alessandro Sperduti, Fabrizio Costa*

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

A crucial computational task for relational and network data is the “link prediction problem” which allows for example to discover unknown interactions between proteins to explain the mechanism of a disease in biological networks, or to suggest novel products for a customer in a e-commerce recommendation system. Most link prediction approaches however do not effectively exploit the contextual information available in the neighborhood of each edge. Here we propose to cast the problem as a binary classification task over the union of the pair of subgraphs located at the endpoints of each edge. We model the classification task using a support vector machine endowed with an efficient graph kernel and achieve state-of-the-art results on several benchmark datasets.

Original languageEnglish
Title of host publicationNeural Information Processing - 24th International Conference, ICONIP 2017, Proceedings
EditorsYuanqing Li, Derong Liu, Shengli Xie, El-Sayed M. El-Alfy, Dongbin Zhao
PublisherSpringer Verlag
Pages117-123
Number of pages7
ISBN (Print)9783319700861
DOIs
StatePublished - 2017
Externally publishedYes

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume10634 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Bibliographical note

Publisher Copyright:
© Springer International Publishing AG 2017.

Keywords

  • Graph kernels
  • Link prediction

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'Joint neighborhood subgraphs link prediction'. Together they form a unique fingerprint.

Cite this