An Efficient Greedy Algorithm for Sequence Recommendation - Archive ouverte HAL Access content directly
Conference Papers Year : 2020

An Efficient Greedy Algorithm for Sequence Recommendation

Idir Benouaret
  • Function : Author
Sihem Amer-Yahia
Senjuti Basu Roy
  • Function : Author


Recommending a sequence of items that maximizes some objective function arises in many real-world applications. In this paper, we consider a utility function over sequences of items where sequential dependencies between items are modeled using a directed graph. We propose EdGe, an efficient greedy algorithm for this problem and we demonstrate its effectiveness on both synthetic and real datasets. We show that EdGe achieves comparable recommendation precision to the state-of-the-art related work OMEGA, and in considerably less time. This work opens several new directions that we discuss at the end of the paper.
Fichier principal
Vignette du fichier
dexa.pdf (708.74 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-02972654 , version 1 (12-11-2020)



Idir Benouaret, Sihem Amer-Yahia, Senjuti Basu Roy. An Efficient Greedy Algorithm for Sequence Recommendation. Database and Expert Systems Applications, 2020, Linz, Austria. ⟨10.1007/978-3-030-27615-7⟩. ⟨hal-02972654⟩
31 View
152 Download



Gmail Facebook X LinkedIn More