ARCHIVES

Next-basket recommendation methods focus on the inference of the next basket by considering the corresponding bas- ket sequence. Although many methods have been developed for the task, they usually suffer from data sparsity. The number of inter- actions between entities is relatively small compared to their huge bases, so it is crucial to mine as much hidden information as possible from the limited historical interactions for prediction. However, the existing methods mainly just treat the next-basket recommendation task as a single-view sequential prediction problem, which leads to the inadequate mining of the information hidden in multiple views, and the mining of other patterns in the historical interactions is neglected, thus making it difficult to learn high-quality representa- tions and limiting the recommendation effect. To alleviate the above issues, we propose a novel method named Hap CL for next-basket recommendation, which mines information from multiple views and patterns with the help of polar contrastive learning. A hier- archical module is designed to mine multiple patterns of historical interactions from different views at two levels. In order to mine self- supervised signals, we design a polar contrastive learning module with a novel graph-based augmentation approach. Experiments on three real-world datasets validate the effectiveness of Hap CL.