Sequential recommendation aims to predict the next item of interest to users based on their historical behavior data. Usually, users’ global and local preferences jointly affect the final recommendation result in different ways. Most existing works use transformers to globally model sequences, which makes them face the dilemma of quadratic computational complexity when dealing with long sequences. Moreover, the scope setting of the user’s local preference is usually static and single, and cannot cover richer multi-level local semantics. To this end, we proposed a parallel architecture for capturing global representation and M ulti-granularity L ocal dependencies with M LP for sequential Rec ommendation ( MLM4Rec ). For global representation, we utilize modified MLP-Mixer to capture global information of user sequences due to its simplicity and efficiency. For local representation, we incorporate convolution into MLP and propose a multi-granularity local awareness mechanism for capturing richer local semantic information. Moreover, we introduced a weight pooling method to adaptively fuse local-global representations instead of directly concatenation. Our model has the advantages of low complexity and high efficiency thanks to its simple MLP structure. Experimental results on three public datasets demonstrate the effectiveness of our proposed model. Our code is available here 1 .

Sequential Recommendation (SR) methods play a crucial role in recommender systems, which aims to capture users' dynamic interest from their historical interactions. Recently, Contrastive Learning (CL), which has emerged as a successful method for sequential recommendation, utilizes various data augmentations to generate contrastive views to mine supervised signals from data to alleviate data sparsity issues. However, most existing sequential data augmentation methods may destroy semantic sequential interaction characteristics. Meanwhile, they often adopt random operations when generating contrastive views leading to suboptimal performance. To this end, in this paper, we propose a Learnable Model Augmentation Contrastive learning for sequential Recommendation (LMA4Rec). Specifically, LMA4Rec first takes the model-based augmentation method to generate constructive views. Then, LMA4Rec uses Learnable Bernoulli Dropout (LBD) to implement learnable model augmentation operations. Next, contrastive learning is used between the contrastive views to extract supervised signals. Furthermore, a novel multi-positive contrastive learning loss alleviates the supervised sparsity issue. Finally, experiments on public datasets show that our LMA4Rec method effectively improved sequential recommendation performance compared with the state-of-the-art baseline methods.

Deep learning and symbolic learning are two frequently employed methods in Sequential Recommendation (SR). Recent neural-symbolic SR models demonstrate their potential to enable SR to be equipped with concurrent perception and cognition capacities. However, neural-symbolic SR remains a challenging problem due to open issues like representing users and items in logical reasoning. In this paper, we combine the Deep Neural Network (DNN) SR models with logical reasoning and propose a general framework named Sequential Recommendation with Probabilistic Logical Reasoning (short for SR-PLR). This framework allows SR-PLR to benefit from both similarity matching and logical reasoning by disentangling feature embedding and logic embedding in the DNN and probabilistic logic network. To better capture the uncertainty and evolution of user tastes, SR-PLR embeds users and items with a probabilistic method and conducts probabilistic logical reasoning on users' interaction patterns. Then the feature and logic representations learned from the DNN and logic network are concatenated to make the prediction. Finally, experiments on various sequential recommendation models demonstrate the effectiveness of the SR-PLR. Our code is available at https://github.com/Huanhuaneryuan/SR-PLR.

Graph Convolution Network (GCN) has been applied in recommendation with various architectures for its representation learning capability in graph-structured data. Despite existing GCN-based recommendation models successfully capturing the user-item interactions, they still suffer from two limitations. On the one hand, they model users and items in the Euclidean space with real-value embeddings, which have high distortion when modeling complex graphs. On the other hand, they have not fully explored contrastive learning for GCN-based recommendations. Simply applying augmentation pairs of the same type may make features less generalizable and lead to sub-optimal performance. To this end, in this paper, we propose a Quaternion-based Graph Contrastive Learning (QGCL) recommendation model. It embeds all users and items into the Quaternion space and performs message propagation with quaternion graph convolution layers. Moreover, we attempt to compose different types of data augmentations for augmented views in graph contrastive learning as an auxiliary task. We evaluate the proposed model using three public datasets, and experimental results demonstrate significant improvements over the state-of-the-art methods by a large margin.

Recently, contrastive learning alleviates data sparsity issues and improves the performance of the Graph Neural Network (GNN) recommender models by employing graph structure dropout augmentations. However, these models still face following limitations: (1) Information loss. Dropout may discard helpful information. (2) Insufficient utilization of path-level information. Meta-path is carried numerous high-order information, which has not been well considered in these models. To this end, in this paper, we propose a novel framework, Node and Meta-Path Contrastive Learning for Recommender Systems (NPCRS), which utilizes meta-path to capture path-level information for model learning. Specifically, our approach first generates a meta-path view on the user-item bipartite graph by leveraging meta-path instead of random dropout. Then, we learn the node representation on a user-item bipartite graph and meta-path view to capture both node and path-level information simultaneously. Further, a multi-positive sample mechanism is introduced to define positive and negative samples for contrastive learning. Finally, NPCRS utilizes contrastive learning to learn a more informative node representation. We evaluate the proposed model using three real-world datasets and our experimental results show that our model significantly outperforms the state-of-the-art approaches.