We are very excited to join forces with MLCommons and OctoML.ai! Contact Grigori Fursin for more details!

Correlation-Sensitive Next-Basket Recommendation

lib:6b4c224b0ef427f8 (v1.0.0)

Vote to reproduce this paper and share portable workflows   1 
Authors: Duc-Trong Le,Hady W. Lauw,Yuan Fang
Where published: The Twenty-Eighth International Joint Conference on Artificial Intelligence Conference 2019 8
Document:  PDF  DOI 
Artifact development version: GitHub
Abstract URL: https://www.ijcai.org/Proceedings/2019/389


Items adopted by a user over time are indicative of the underlying preferences. We are concerned with learning such preferences from observed sequences of adoptions for recommendation. As multiple items are commonly adopted concurrently, e.g., a basket of grocery items or a sitting of media consumption, we deal with a sequence of baskets as input, and seek to recommend the next basket. Intuitively, a basket tends to contain groups of related items that support particular needs. Instead of recommending items independently for the next basket, we hypothesize that incorporating information on pairwise correlations among items would help to arrive at more coherent basket recommendations. Towards this objective, we develop a hierarchical network architecture codenamed Beacon to model basket sequences. Each basket is encoded taking into account the relative importance of items and correlations among item pairs. This encoding is utilized to infer sequential associations along the basket sequence. Extensive experiments on three public real-life datasets showcase the effectiveness of our approach for the next-basket recommendation problem.

Relevant initiatives  

Related knowledge about this paper Reproduced results (crowd-benchmarking and competitions) Artifact and reproducibility checklists Common formats for research projects and shared artifacts Reproducibility initiatives

Comments  

Please log in to add your comments!
If you notice any inapropriate content that should not be here, please report us as soon as possible and we will try to remove it within 48 hours!