Recommendation as link prediction in bipartite graphs : A graph kernel-based machine learning approach

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journalpeer-review

162 Scopus Citations
View graph of relations

Author(s)

Related Research Unit(s)

Detail(s)

Original languageEnglish
Pages (from-to)880-890
Journal / PublicationDecision Support Systems
Volume54
Issue number2
Online published4 Oct 2012
Publication statusPublished - Jan 2013

Abstract

Recommender systems have been widely adopted in online applications to suggest products, services, and contents to potential users. Collaborative filtering (CF) is a successful recommendation paradigm that employs transaction information to enrich user and item features for recommendation. By mapping transactions to a bipartite user-item interaction graph, a recommendation problem is converted into a link prediction problem, where the graph structure captures subtle information on relations between users and items. To take advantage of the structure of this graph, we propose a kernel-based recommendation approach and design a novel graph kernel that inspects customers and items (indirectly) related to the focal user-item pair as its context to predict whether there may be a link. In the graph kernel, we generate random walk paths starting from a focal user-item pair and define similarities between user-item pairs based on the random walk paths. We prove the validity of the kernel and apply it in a one-class classification framework for recommendation. We evaluate the proposed approach with three real-world datasets. Our proposed method outperforms state-of-the-art benchmark algorithms, particularly when recommending a large number of items. The experiments show the necessity of capturing user-item graph structure in recommendation.

Research Area(s)

  • Bipartite graph, Collaborative filtering, Kernel-based methods, Link prediction, Recommender systems