Making Recommendations Bandwidth Aware

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

14 Scopus Citations
View graph of relations

Author(s)

Related Research Unit(s)

Detail(s)

Original languageEnglish
Article number8404065
Pages (from-to)7031-7050
Journal / PublicationIEEE Transactions on Information Theory
Volume64
Issue number11
Online published5 Jul 2018
Publication statusPublished - Nov 2018

Abstract

This paper asks how much we can gain in terms of bandwidth and user satisfaction, if recommendation systems became bandwidth aware and took into account not only the user preferences, but also the fact that they may need to serve these users under bandwidth constraints, as is the case over wireless networks. We formulate this as a new problem in the context of index coding: we relax the index coding requirements to capture scenarios where each client has preferences associated with messages. The client is satisfied to receive any message she does not already have, with a satisfaction proportional to her preference for that message. We consistently find, over a number of scenarios we sample, that although the optimization problems are in general NP-hard, significant bandwidth savings are possible even when restricted to polynomial time algorithms.

Research Area(s)

  • Pliable index coding, recommendation systems, bandwidth constraints, index coding

Citation Format(s)

Making Recommendations Bandwidth Aware. / Song, Linqi; Fragouli, Christina.

In: IEEE Transactions on Information Theory, Vol. 64, No. 11, 8404065, 11.2018, p. 7031-7050.

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