论文周报 | 推荐系统领域最新研究进展
本文精选了上周（0627-0703）最新发布的21篇推荐系统相关论文。
方向主要包括序列推荐[2,9,10]、对话推荐[3]、基于隐私保护的推荐算法[5]、去偏推荐[18]、社会化推荐[8,19]、强化学习推荐[2]、跨域推荐系统[7]、召回和排序合作推荐[13]、公平性推荐[16]、推荐系统中的指标探究[17]、推荐系统的成员推理攻击[18]。应用涉及VR商店推荐[1]、新闻推荐[2]、内容管理系统推荐[4]、习题推荐[11]等。
以下整理了论文标题以及摘要，如感兴趣可移步原文精读。1. A Novel Position-based VR Online Shopping Recommendation System based on Optimized Collaborative Filtering Algorithm 2. Two-Stage Neural Contextual Bandits for Personalised News Recommendation
3. Minimalist and High-performance Conversational Recommendation with Uncertainty Estimation for User Preference
4. Item Recommendation Using User Feedback Data and Item Profile
5. Split Two-Tower Model for Efficient and Privacy-Preserving Cross-device Federated Recommendation
6. A Simple and Scalable Tensor Completion Algorithm via Latent Invariant Constraint for Recommendation System
7. Knowledge-aware Neural Collective Matrix Factorization for Cross-domain Recommendation
8. Personalized recommendation system based on social relationships and historical behaviors
9. Efficiently Leveraging Multi-level User Intent for Session-based Recommendation via Atten-Mixer Network
10. Evolutionary Preference Learning via Graph Nested GRU ODE for Session-based Recommendation
11. A Design of A Simple Yet Effective Exercise Recommendation System in K-12 Online Learning
12. Worldwide AI Ethics: a review of 200 guidelines and recommendations for AI governance
13. Cooperative Retriever and Ranker in Deep Recommenders
14. Welfare-Optimized Recommender Systems
15. Detecting Arbitrary Order Beneficial Feature Interactions for Recommender Systems
16. Supply-Side Equilibria in Recommender Systems
17. Quality Metrics in Recommender Systems: Do We Calculate Metrics Consistently?
18. Debiasing Learning for Membership Inference Attacks Against Recommender Systems
19. Affective Signals in a Social Media Recommender System
20. Intelligent Request Strategy Design in Recommender System
21. Explainable discrete Collaborative Filtering
1. A Novel Position-based VR Online Shopping Recommendation System based on Optimized Collaborative Filtering Algorithm
Jianze Huang, HaoLan Zhang, Huanda Lu, Xin Yu, Shaoyin Li
https://arxiv.org/abs/2206.15021
This paper proposes a VR supermarket with an intelligent recommendation, which consists of three parts. The VR supermarket, the recommendation system, and the database. The VR supermarket provides a 360-degree virtual environment for users to move and interact in the virtual environment through VR devices. The recommendation system will make intelligent recommendations to the target users based on the data in the database. The intelligent recommendation system is developed based on item similarity (ICF), which solves the cold start problem of ICF. This allows VR supermarkets to present real-time recommendations in any situation. It not only makes up for the lack of user perception of item attributes in traditional online shopping systems but also VR Supermarket improves the shopping efficiency of users through the intelligent recommendation system. The application can be extended to enterprise-level systems, which adds new possibilities for users to do VR shopping at home.
2. Two-Stage Neural Contextual Bandits for Personalised News Recommendation
Mengyan Zhang, Thanh Nguyen-Tang, Fangzhao Wu, Zhenyu He, Xing Xie, Cheng Soon Ong
https://arxiv.org/abs/2206.14648
We consider the problem of personalised news recommendation where each user consumes news in a sequential fashion. Existing personalised news recommendation methods focus on exploiting user interests and ignores exploration in recommendation, which leads to biased feedback loops and hurt recommendation quality in the long term. We build on contextual bandits recommendation strategies which naturally address the exploitation-exploration trade-off. The main challenges are the computational efficiency for exploring the large-scale item space and utilising the deep representations with uncertainty. We propose a two-stage hierarchical topic-news deep contextual bandits framework to efficiently learn user preferences when there are many news items. We use deep learning representations for users and news, and generalise the neural upper confidence bound (UCB) policies to generalised additive UCB and bilinear UCB. Empirical results on a large-scale news recommendation dataset show that our proposed policies are efficient and outperform the baseline bandit policies.
3. Minimalist and High-performance Conversational Recommendation with Uncertainty Estimation for User Preference
Yinan Zhang, Boyang Li, Yong Liu, Hao Wang, Chunyan Miao
https://arxiv.org/abs/2206.14468
Conversational recommendation system (CRS) is emerging as a user-friendly way to capture users' dynamic preferences over candidate items and attributes. Multi-shot CRS is designed to make recommendations multiple times until the user either accepts the recommendation or leaves at the end of their patience. Existing works are trained with reinforcement learning (RL), which may suffer from unstable learning and prohibitively high demands for computing. In this work, we propose a simple and efficient CRS, MInimalist Non-reinforced Interactive COnversational Recommender Network (MINICORN). MINICORN models the epistemic uncertainty of the estimated user preference and queries the user for the attribute with the highest uncertainty. The system employs a simple network architecture and makes the query-vs-recommendation decision using a single rule. Somewhat surprisingly, this minimalist approach outperforms state-of-the-art RL methods on three real-world datasets by large margins. We hope that MINICORN will serve as a valuable baseline for future research.
4. Item Recommendation Using User Feedback Data and Item Profile
Debashish Roy, Rajarshi Roy Chowdhury, Abdullah Bin Nasser, Afdhal Azmi, Marzieh Babaeianjelodar
https://arxiv.org/abs/2206.14133
Matrix factorization (MS) is a collaborative filtering (CF) based approach, which is widely used for recommendation systems (RS). In this research work, we deal with the content recommendation problem for users in a content management system (CMS) based on users' feedback data. The CMS is applied for publishing and pushing curated content to the employees of a company or an organization. Here, we have used the user's feedback data and content data to solve the content recommendation problem. We prepare individual user profiles and then generate recommendation results based on different categories, including Direct Interaction, Social Share, and Reading Statistics, of user's feedback data. Subsequently, we analyze the effect of the different categories on the recommendation results. The results have shown that different categories of feedback data have different impacts on recommendation accuracy. The best performance achieves if we include all types of data for the recommendation task. We also incorporate content similarity as a regularization term into an MF model for designing a hybrid model. Experimental results have shown that the proposed hybrid model demonstrates better performance compared with the traditional MF-based models.
5. Split Two-Tower Model for Efficient and Privacy-Preserving Cross-device Federated Recommendation
Jiangcheng Qin, Baisong Liu, Xueyuan Zhang, Jiangbo Qian
https://arxiv.org/abs/2206.13715
Federated Recommendation can mitigate the systematical privacy risks of traditional recommendation since it allows the model training and online inferring without centralized user data collection. Most existing works assume that all user devices are available and adequate to participate in the Federated Learning. However, in practice, the complex recommendation models designed for accurate prediction and massive item data cause a high computation and communication cost to the resource-constrained user device, resulting in poor performance or training failure. Therefore, how to effectively compress the computation and communication overhead to achieve efficient federated recommendations across ubiquitous mobile devices remains a significant challenge. This paper introduces split learning into the two-tower recommendation models and proposes STTFedRec, a privacy-preserving and efficient cross-device federated recommendation framework. STTFedRec achieves local computation reduction by splitting the training and computation of the item model from user devices to a performance-powered server. The server with the item model provides low-dimensional item embeddings instead of raw item data to the user devices for local training and online inferring, achieving server broadcast compression. The user devices only need to perform similarity calculations with cached user embeddings to achieve efficient online inferring. We also propose an obfuscated item request strategy and multi-party circular secret sharing chain to enhance the privacy protection of model training. The experiments conducted on two public datasets demonstrate that STTFedRec improves the average computation time and communication size of the baseline models by about 40 times and 42 times in the best-case scenario with balanced recommendation accuracy.
6. A Simple and Scalable Tensor Completion Algorithm via Latent Invariant Constraint for Recommendation System
Tung Nguyen, Sang T. Truong, Jeffrey Uhlmann
https://arxiv.org/abs/2206.13355
In this paper we provide a latent-variable formulation and solution to the recommender system (RS) problem in terms of a fundamental property that any reasonable solution should be expected to satisfy. Specifically, we examine a novel tensor completion method to efficiently and accurately learn parameters of a model for the unobservable personal preferences that underly user ratings. By regularizing the tensor decomposition with a single latent invariant, we achieve three properties for a reliable recommender system: (1) uniqueness of the tensor completion result with minimal assumptions, (2) unit consistency that is independent of arbitrary preferences of users, and (3) a consensus ordering guarantee that provides consistent ranking between observed and unobserved rating scores. Our algorithm leads to a simple and elegant recommendation framework that has linear computational complexity and with no hyperparameter tuning. We provide empirical results demonstrating that the approach significantly outperforms current state-of-the-art methods.
7. Knowledge-aware Neural Collective Matrix Factorization for Cross-domain Recommendation
Li Zhang, Yan Ge, Jun Ma, Jianmo Ni, Haiping Lu
https://arxiv.org/abs/2206.13255
Cross-domain recommendation (CDR) can help customers find more satisfying items in different domains. Existing CDR models mainly use common users or mapping functions as bridges between domains but have very limited exploration in fully utilizing extra knowledge across domains. In this paper, we propose to incorporate the knowledge graph (KG) for CDR, which enables items in different domains to share knowledge. To this end, we first construct a new dataset AmazonKG4CDR from the Freebase KG and a subset (two domain pairs: movies-music, movie-book) of Amazon Review Data. This new dataset facilitates linking knowledge to bridge within- and cross-domain items for CDR. Then we propose a new framework, KG-aware Neural Collective Matrix Factorization (KG-NeuCMF), leveraging KG to enrich item representations. It first learns item embeddings by graph convolutional autoencoder to capture both domain-specific and domain-general knowledge from adjacent and higher-order neighbours in the KG. Then, we maximize the mutual information between item embeddings learned from the KG and user-item matrix to establish cross-domain relationships for better CDR. Finally, we conduct extensive experiments on the newly constructed dataset and demonstrate that our model significantly outperforms the best-performing baselines.
8. Personalized recommendation system based on social relationships and historical behaviors
Yan-Li Lee, Tao Zhou, Kexin Yang, Yajun Du, Liming Pan
https://arxiv.org/abs/2206.13072
Previous studies show that recommendation algorithms based on historical behaviors of users can provide satisfactory recommendation performance. Many of these algorithms pay attention to the interest of users, while ignore the influence of social relationships on user behaviors. Social relationships not only carry intrinsic information of similar consumption tastes or behaviors, but also imply the influence of individual to its neighbors. In this paper, we assume that social relationships and historical behaviors of users are related to the same factors. Based on this assumption, we propose an algorithm to focus on social relationships useful for recommendation systems through mutual constraints from both types of information. We test the performance of our algorithm on four types of users, including all users, active users, inactive users and cold-start users. Results show that the proposed algorithm outperforms benchmarks in four types of scenarios subject to recommendation accuracy and diversity metrics. We further design a randomization model to explore the contribution of social relationships to recommendation performance, and the result shows that the contribution of social relationships in the proposed algorithm depends on the coupling strength of social relationships and historical behaviors.
9. Efficiently Leveraging Multi-level User Intent for Session-based Recommendation via Atten-Mixer Network
Peiyan Zhang, Jiayan Guo, Chaozhuo Li, Yueqi Xie, Jaeboum Kim, Yan Zhang, Xing Xie, Haohan Wang, Sunghun Kim
https://arxiv.org/abs/2206.12781
Session-based recommendation (SBR) aims to predict the user next action based on short and dynamic sessions. Recently, there has been an increasing interest in utilizing various elaborately designed graph neural networks (GNNs) to capture the pair-wise relationships among items, seemingly suggesting the design of more complicated models is the panacea for improving the empirical performance. However, these models achieve relatively marginal improvements with exponential growth in model complexity. In this paper, we dissect the classical GNN-based SBR models and empirically find that some sophisticated GNN propagations are redundant, given the readout module plays a significant role in GNN-based models. Based on this observation, we intuitively propose to remove the GNN propagation part, while the readout module will take on more responsibility in the model reasoning process. To this end, we propose the Multi-Level Attention Mixture Network (Atten-Mixer), which leverages both concept-view and instance-view readouts to achieve multi-level reasoning over item transitions. As simply enumerating all possible high-level concepts is infeasible for large real-world recommender systems, we further incorporate SBR-related inductive biases, i.e., local invariance and inherent priority to prune the search space. Experiments on three benchmarks demonstrate the effectiveness and efficiency of our proposal.
10. Evolutionary Preference Learning via Graph Nested GRU ODE for Session-based Recommendation
Jiayan Guo, Peiyan Zhang, Chaozhuo Li, Xing Xie, Yan Zhang, Sunghun Kim
https://arxiv.org/abs/2206.12779
Session-based recommendation (SBR) aims to predict the user next action based on the ongoing sessions. Recently, there has been an increasing interest in modeling the user preference evolution to capture the fine-grained user interests. While latent user preferences behind the sessions drift continuously over time, most existing approaches still model the temporal session data in discrete state spaces, which are incapable of capturing the fine-grained preference evolution and result in sub-optimal solutions. To this end, we propose Graph Nested GRU ordinary differential equation (ODE), namely GNG-ODE, a novel continuum model that extends the idea of neural ODEs to continuous-time temporal session graphs. The proposed model preserves the continuous nature of dynamic user preferences, encoding both temporal and structural patterns of item transitions into continuous-time dynamic embeddings. As the existing ODE solvers do not consider graph structure change and thus cannot be directly applied to the dynamic graph, we propose a time alignment technique, called t-Alignment, to align the updating time steps of the temporal session graphs within a batch. Empirical results on three benchmark datasets show that GNG-ODE significantly outperforms other baselines.
11. A Design of A Simple Yet Effective Exercise Recommendation System in K-12 Online Learning
Shuyan Huang, Qiongqiong Liu, Jiahao Chen, Xiangen Hu, Zitao Liu, Weiqi Luo
https://arxiv.org/abs/2206.12291
We propose a simple but effective method to recommend exercises with high quality and diversity for students. Our method is made up of three key components: (1) candidate generation module; (2) diversity-promoting module; and (3) scope restriction module. The proposed method improves the overall recommendation performance in terms of recall, and increases the diversity of the recommended candidates by 0.81% compared to the baselines.
12. Worldwide AI Ethics: a review of 200 guidelines and recommendations for AI governance
Nicholas Kluge Corrêa, Camila Galvão, James William Santos, Carolina Del Pino, Edson Pontes Pinto, Camila Barbosa, Diogo Massmann, Rodrigo Mambrini, Luiza Galvão, Edmund Terem
https://arxiv.org/abs/2206.11922
In the last decade, a great number of organizations have produced documents intended to standardize, in the normative sense, and promote guidance to our recent and rapid AI development. However, the full content and divergence of ideas presented in these documents have not yet been analyzed, except for a few meta-analyses and critical reviews of the field. In this work, we seek to expand on the work done by past researchers and create a tool for better data visualization of the contents and nature of these documents. We also provide our critical analysis of the results acquired by the application of our tool into a sample size of 200 documents.
13. Cooperative Retriever and Ranker in Deep Recommenders
Xu Huang, Defu Lian, Jin Chen, Zheng Liu, Xing Xie, Enhong Chen
https://arxiv.org/abs/2206.14649
Deep recommender systems jointly leverage the retrieval and ranking operations to generate the recommendation result. The retriever targets selecting a small set of relevant candidates from the entire items with high efficiency; while the ranker, usually more precise but time-consuming, is supposed to identify the best items out of the retrieved candidates with high precision. However, the retriever and ranker are usually trained in poorly-cooperative ways, leading to limited recommendation performances when working as an entirety. In this work, we propose a novel DRS training framework CoRR(short for Cooperative Retriever and Ranker), where the retriever and ranker can be mutually reinforced. On one hand, the retriever is learned from recommendation data and the ranker via knowledge distillation; knowing that the ranker is more precise, the knowledge distillation may provide extra weak-supervision signals for the improvement of retrieval quality. On the other hand, the ranker is trained by learning to discriminate the truth positive items from hard negative candidates sampled from the retriever. With the iteration going on, the ranker may become more precise, which in return gives rise to informative training signals for the retriever; meanwhile, with the improvement of retriever, harder negative candidates can be sampled, which contributes to a higher discriminative capability of the ranker. To facilitate the effective conduct of CoRR, an asymptotic-unbiased approximation of KL divergence is introduced for the knowledge distillation over sampled items; besides, a scalable and adaptive strategy is developed to efficiently sample from the retriever. Comprehensive experimental studies are performed over four large-scale benchmark datasets, where CoRR improves the overall recommendation quality resulting from the cooperation between retriever and ranker.
14. Welfare-Optimized Recommender Systems
Benjamin Heymann, Flavian Vasile, David Rohde
https://arxiv.org/abs/2206.13845
We present a recommender system based on the Random Utility Model. Online shoppers are modeled as rational decision makers with limited information, and the recommendation task is formulated as the problem of optimally enriching the shopper's awareness set. Notably, the price information and the shopper's Willingness-To-Pay play crucial roles. Furthermore, to better account for the commercial nature of the recommendation, we unify the retailer and shoppers' contradictory objectives into a single welfare metric, which we propose as a new recommendation goal. We test our framework on synthetic data and show its performance in a wide range of scenarios. This new framework, that was absent from the Recommender System literature, opens the door to Welfare-Optimized Recommender Systems, couponing, and price optimization.
15. Detecting Arbitrary Order Beneficial Feature Interactions for Recommender Systems
Yixin Su, Yunxiang Zhao, Sarah Erfani, Junhao Gan, Rui Zhang
https://arxiv.org/abs/2206.13764
Detecting beneficial feature interactions is essential in recommender systems, and existing approaches achieve this by examining all the possible feature interactions. However, the cost of examining all the possible higher-order feature interactions is prohibitive (exponentially growing with the order increasing). Hence existing approaches only detect limited order (e.g., combinations of up to four features) beneficial feature interactions, which may miss beneficial feature interactions with orders higher than the limitation. In this paper, we propose a hypergraph neural network based model named HIRS. HIRS is the first work that directly generates beneficial feature interactions of arbitrary orders and makes recommendation predictions accordingly. The number of generated feature interactions can be specified to be much smaller than the number of all the possible interactions and hence, our model admits a much lower running time. To achieve an effective algorithm, we exploit three properties of beneficial feature interactions, and propose deep-infomax-based methods to guide the interaction generation. Our experimental results show that HIRS outperforms state-of-the-art algorithms by up to 5% in terms of recommendation accuracy.
16. Supply-Side Equilibria in Recommender Systems
Meena Jagadeesan, Nikhil Garg, Jacob Steinhardt
https://arxiv.org/abs/2206.13489
Digital recommender systems such as Spotify and Netflix affect not only consumer behavior but also producer incentives: producers seek to supply content that will be recommended by the system. But what content will be produced? In this paper, we investigate the supply-side equilibria in content recommender systems. We model users and content as -dimensional vectors, and recommend the content that has the highest dot product with each user. The main features of our model are that the producer decision space is high-dimensional and the user base is heterogeneous. This gives rise to new qualitative phenomena at equilibrium: First, the formation of genres, where producers specialize to compete for subsets of users. Using a duality argument, we derive necessary and sufficient conditions for this specialization to occur. Second, we show that producers can achieve positive profit at equilibrium, which is typically impossible under perfect competition. We derive sufficient conditions for this to occur, and show it is closely connected to specialization of content. In both results, the interplay between the geometry of the users and the structure of producer costs influences the structure of the supply-side equilibria. At a conceptual level, our work serves as a starting point to investigate how recommender systems shape supply-side competition between producers.
17. Quality Metrics in Recommender Systems: Do We Calculate Metrics Consistently?
Yan-Martin Tamm, Rinchin Damdinov, Alexey Vasilev
https://arxiv.org/abs/2206.12858
Offline evaluation is a popular approach to determine the best algorithm in terms of the chosen quality metric. However, if the chosen metric calculates something unexpected, this miscommunication can lead to poor decisions and wrong conclusions. In this paper, we thoroughly investigate quality metrics used for recommender systems evaluation. We look at the practical aspect of implementations found in modern RecSys libraries and at the theoretical aspect of definitions in academic papers. We find that Precision is the only metric universally understood among papers and libraries, while other metrics may have different interpretations. Metrics implemented in different libraries sometimes have the same name but measure different things, which leads to different results given the same input. When defining metrics in an academic paper, authors sometimes omit explicit formulations or give references that do not contain explanations either. In 47% of cases, we cannot easily know how the metric is defined because the definition is not clear or absent. These findings highlight yet another difficulty in recommender system evaluation and call for a more detailed description of evaluation protocols.
18. Debiasing Learning for Membership Inference Attacks Against Recommender Systems
Zihan Wang, Na Huang, Fei Sun, Pengjie Ren, Zhumin Chen, Hengliang Luo, Maarten de Rijke, Zhaochun Ren
https://arxiv.org/abs/2206.12401
Learned recommender systems may inadvertently leak information about their training data, leading to privacy violations. We investigate privacy threats faced by recommender systems through the lens of membership inference. In such attacks, an adversary aims to infer whether a user's data is used to train the target recommender. To achieve this, previous work has used a shadow recommender to derive training data for the attack model, and then predicts the membership by calculating difference vectors between users' historical interactions and recommended items. State-of-the-art methods face two challenging problems: (1) training data for the attack model is biased due to the gap between shadow and target recommenders, and (2) hidden states in recommenders are not observational, resulting in inaccurate estimations of difference vectors. To address the above limitations, we propose a Debiasing Learning for Membership Inference Attacks against recommender systems (DL-MIA) framework that has four main components: (1) a difference vector generator, (2) a disentangled encoder, (3) a weight estimator, and (4) an attack model. To mitigate the gap between recommenders, a variational auto-encoder (VAE) based disentangled encoder is devised to identify recommender invariant and specific features. To reduce the estimation bias, we design a weight estimator, assigning a truth-level score for each difference vector to indicate estimation accuracy. We evaluate DL-MIA against both general recommenders and sequential recommenders on three real-world datasets. Experimental results show that DL-MIA effectively alleviates training and estimation biases simultaneously, and achieves state-of-the-art attack performance.
19. Affective Signals in a Social Media Recommender System
Jane Dwivedi-Yu, Yi-Chia Wang, Lijing Qin, Cristian Canton-Ferrer, Alon Y. Halevy
https://arxiv.org/abs/2206.12374
People come to social media to satisfy a variety of needs, such as being informed, entertained and inspired, or connected to their friends and community. Hence, to design a ranking function that gives useful and personalized post recommendations, it would be helpful to be able to predict the affective response a user may have to a post (e.g., entertained, informed, angered). This paper describes the challenges and solutions we developed to apply Affective Computing to social media recommendation systems.
20. Intelligent Request Strategy Design in Recommender System
Xufeng Qian, Yue Xu, Fuyu Lv, Shengyu Zhang, Ziwen Jiang, Qingwen Liu, Xiaoyi Zeng, Tat-Seng Chua, Fei Wu
https://arxiv.org/abs/2206.12296
Waterfall Recommender System (RS), a popular form of RS in mobile applications, is a stream of recommended items consisting of successive pages that can be browsed by scrolling. In waterfall RS, when a user finishes browsing a page, the edge (e.g., mobile phones) would send a request to the cloud server to get a new page of recommendations, known as the paging request mechanism. RSs typically put a large number of items into one page to reduce excessive resource consumption from numerous paging requests, which, however, would diminish the RSs' ability to timely renew the recommendations according to users' real-time interest and lead to a poor user experience. Intuitively, inserting additional requests inside pages to update the recommendations with a higher frequency can alleviate the problem. However, previous attempts, including only non-adaptive strategies (e.g., insert requests uniformly), would eventually lead to resource overconsumption. To this end, we envision a new learning task of edge intelligence named Intelligent Request Strategy Design (IRSD). It aims to improve the effectiveness of waterfall RSs by determining the appropriate occasions of request insertion based on users' real-time intention. Moreover, we propose a new paradigm of adaptive request insertion strategy named Uplift-based On-edge Smart Request Framework (AdaRequest). AdaRequest 1) captures the dynamic change of users' intentions by matching their real-time behaviors with their historical interests based on attention-based neural networks. 2) estimates the counterfactual uplift of user purchase brought by an inserted request based on causal inference. 3) determines the final request insertion strategy by maximizing the utility function under online resource constraints. We conduct extensive experiments on both offline dataset and online A/B test to verify the effectiveness of AdaRequest.21. Explainable discrete Collaborative Filtering
Lei Zhu; Yang Xu; Jingjing Li; Weili Guan; Zhiyong Cheng et al.
https://ieeexplore.ieee.org/abstract/document/9802915
Using hashing to learn the binary codes of users and items significantly improves the efficiency and reduces the space consumption of the recommender system. However, existing hashing-based recommender systems remain black boxes without any explainable outputs that illustrate why the system recommends the items. In this paper, we present a new end-to-end discrete recommendation framework based on the multi-task learning to simultaneously perform explainable and efficient recommendation. Toward this goal, an Explainable Discrete Collaborative Filtering (EDCF) method is proposed to preserve the user-item interaction features and semantic text features into binary hash codes by adaptively exploiting the correlations between the preference prediction task and the explanation generation task. At the online recommendation stage, EDCF makes efficient top-K recommendation by calculating the Hamming distances between the feature hash codes, and simultaneously generates natural language explanations for recommendation results through the explanation generation module. To obtain the hash codes directly from the end-to-end neural network, we introduce an attentive TextCNN and an Adaptive Tanh layer in the preference prediction task. For explanation generation, Long Short-Term Memory is employed to generate the explanations for recommendation results from the binary hash codes of user and item. Experiments demonstrate the superiority of the proposed method.欢迎干货投稿 \ 论文宣传 \ 合作交流
推荐阅读
快手+中科大 | 全曝光推荐数据集KuaiRec 2.0版本