When Search Meets Recommendation: Learning Disentangled Search
Representation for Recommendation
- URL: http://arxiv.org/abs/2305.10822v1
- Date: Thu, 18 May 2023 09:04:50 GMT
- Title: When Search Meets Recommendation: Learning Disentangled Search
Representation for Recommendation
- Authors: Zihua Si, Zhongxiang Sun, Xiao Zhang, Jun Xu, Xiaoxue Zang, Yang Song,
Kun Gai, Ji-Rong Wen
- Abstract summary: We propose a search-Enhanced framework for the Sequential Recommendation (SESRec)
SESRec disentangling similar and dissimilar representations within S&R behaviors.
Experiments on both industrial and public datasets demonstrate that SESRec consistently outperforms state-of-the-art models.
- Score: 56.98380787425388
- License: http://creativecommons.org/licenses/by-nc-nd/4.0/
- Abstract: Modern online service providers such as online shopping platforms often
provide both search and recommendation (S&R) services to meet different user
needs. Rarely has there been any effective means of incorporating user behavior
data from both S&R services. Most existing approaches either simply treat S&R
behaviors separately, or jointly optimize them by aggregating data from both
services, ignoring the fact that user intents in S&R can be distinctively
different. In our paper, we propose a Search-Enhanced framework for the
Sequential Recommendation (SESRec) that leverages users' search interests for
recommendation, by disentangling similar and dissimilar representations within
S&R behaviors. Specifically, SESRec first aligns query and item embeddings
based on users' query-item interactions for the computations of their
similarities. Two transformer encoders are used to learn the contextual
representations of S&R behaviors independently. Then a contrastive learning
task is designed to supervise the disentanglement of similar and dissimilar
representations from behavior sequences of S&R. Finally, we extract user
interests by the attention mechanism from three perspectives, i.e., the
contextual representations, the two separated behaviors containing similar and
dissimilar interests. Extensive experiments on both industrial and public
datasets demonstrate that SESRec consistently outperforms state-of-the-art
models. Empirical studies further validate that SESRec successfully disentangle
similar and dissimilar user interests from their S&R behaviors.
Related papers
- Unified Active Retrieval for Retrieval Augmented Generation [69.63003043712696]
In Retrieval-Augmented Generation (RAG), retrieval is not always helpful and applying it to every instruction is sub-optimal.
Existing active retrieval methods face two challenges: 1.
They usually rely on a single criterion, which struggles with handling various types of instructions.
They depend on specialized and highly differentiated procedures, and thus combining them makes the RAG system more complicated.
arXiv Detail & Related papers (2024-06-18T12:09:02Z) - On Generative Agents in Recommendation [58.42840923200071]
Agent4Rec is a user simulator in recommendation based on Large Language Models.
Each agent interacts with personalized recommender models in a page-by-page manner.
arXiv Detail & Related papers (2023-10-16T06:41:16Z) - PARSRec: Explainable Personalized Attention-fused Recurrent Sequential
Recommendation Using Session Partial Actions [0.5801044612920815]
We propose an architecture that relies on common patterns as well as individual behaviors to tailor its recommendations for each person.
Our empirical results on Nielsen Consumer Panel dataset indicate that the proposed approach achieves up to 27.9% performance improvement.
arXiv Detail & Related papers (2022-09-16T12:07:43Z) - FairSR: Fairness-aware Sequential Recommendation through Multi-Task
Learning with Preference Graph Embeddings [14.543386085745192]
Sequential recommendation learns from the temporal dynamics of user-item interactions to predict the next ones.
This paper aims at bringing a marriage between SR and algorithmic fairness.
We propose a novel fairness-aware sequential recommendation task, in which a new metric, interaction fairness, is defined.
arXiv Detail & Related papers (2022-04-30T17:33:51Z) - RETE: Retrieval-Enhanced Temporal Event Forecasting on Unified Query
Product Evolutionary Graph [18.826901341496143]
Temporal event forecasting is a new user behavior prediction task in a unified query product evolutionary graph.
We propose a novel RetrievalEnhanced Event forecasting framework.
Unlike existing methods, we propose methods that enhance user representations via roughly connected entities in the whole graph.
arXiv Detail & Related papers (2022-02-12T19:27:56Z) - Intent Contrastive Learning for Sequential Recommendation [86.54439927038968]
We introduce a latent variable to represent users' intents and learn the distribution function of the latent variable via clustering.
We propose to leverage the learned intents into SR models via contrastive SSL, which maximizes the agreement between a view of sequence and its corresponding intent.
Experiments conducted on four real-world datasets demonstrate the superiority of the proposed learning paradigm.
arXiv Detail & Related papers (2022-02-05T09:24:13Z) - Knowledge-Enhanced Hierarchical Graph Transformer Network for
Multi-Behavior Recommendation [56.12499090935242]
This work proposes a Knowledge-Enhanced Hierarchical Graph Transformer Network (KHGT) to investigate multi-typed interactive patterns between users and items in recommender systems.
KHGT is built upon a graph-structured neural architecture to capture type-specific behavior characteristics.
We show that KHGT consistently outperforms many state-of-the-art recommendation methods across various evaluation settings.
arXiv Detail & Related papers (2021-10-08T09:44:00Z) - Analysing Mixed Initiatives and Search Strategies during Conversational
Search [31.63357369175702]
We present a model for conversational search -- from which we instantiate different observed conversational search strategies, where the agent elicits: (i) Feedback-First, or (ii) Feedback-After.
Our analysis reveals that there is no superior or dominant combination, instead it shows that query clarifications are better when asked first, while query suggestions are better when asked after presenting results.
arXiv Detail & Related papers (2021-09-13T13:30:10Z) - From Implicit to Explicit feedback: A deep neural network for modeling
sequential behaviours and long-short term preferences of online users [3.464871689508835]
Implicit and explicit feedback have different roles for a useful recommendation.
We go from the hypothesis that a user's preference at a time is a combination of long-term and short-term interests.
arXiv Detail & Related papers (2021-07-26T16:59:20Z) - Advances and Challenges in Conversational Recommender Systems: A Survey [133.93908165922804]
We provide a systematic review of the techniques used in current conversational recommender systems (CRSs)
We summarize the key challenges of developing CRSs into five directions.
These research directions involve multiple research fields like information retrieval (IR), natural language processing (NLP), and human-computer interaction (HCI)
arXiv Detail & Related papers (2021-01-23T08:53:15Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.