Making Recommendations Bandwidth Aware
From MaRDI portal
Publication:4559577
DOI10.1109/TIT.2018.2853548zbMATH Open1431.94026arXiv1607.03948OpenAlexW2864953735WikidataQ129582108 ScholiaQ129582108MaRDI QIDQ4559577FDOQ4559577
Authors: Linqi Song, Christina Fragouli 
Publication date: 4 December 2018
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Abstract: This paper asks how much we can gain in terms of bandwidth and user satisfaction, if recommender 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.
Full work available at URL: https://arxiv.org/abs/1607.03948
This page was built for publication: Making Recommendations Bandwidth Aware
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4559577)
