Graph bandit for diverse user coverage in online recommendation

Abstract

We study a recommendation system problem, in which the system must be able to cover as many users’ preferences as possible while these preferences change over time. This problem can be formulated as a variation of the maximum coverage problem; specifically we introduced a novel problem of Online k-Hitting Set, where the number of sets and elements within… (More)
DOI: 10.1007/s10489-017-0977-1

11 Figures and Tables

Topics

  • Presentations referencing similar topics