Variational Reasoning over Incomplete Knowledge Graphs for Conversational Recommendation

• URL: http://arxiv.org/abs/2212.11868v2
• Date: Fri, 23 Dec 2022 06:41:01 GMT
• Title: Variational Reasoning over Incomplete Knowledge Graphs for Conversational Recommendation
• Authors: Xiaoyu Zhang, Xin Xin, Dongdong Li, Wenxuan Liu, Pengjie Ren, Zhumin Chen, Jun Ma, Zhaochun Ren
• Abstract summary: We propose the Variational Reasoning over Incomplete KGs Conversational Recommender (VRICR) Our key idea is to incorporate the large dialogue corpus naturally accompanied with CRSs to enhance the incomplete KGs. We also denote the dialogue-specific subgraphs of KGs as latent variables with categorical priors for adaptive knowledge graphs.
• Score: 48.70062671767362
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Conversational recommender systems (CRSs) often utilize external knowledge graphs (KGs) to introduce rich semantic information and recommend relevant items through natural language dialogues. However, original KGs employed in existing CRSs are often incomplete and sparse, which limits the reasoning capability in recommendation. Moreover, only few of existing studies exploit the dialogue context to dynamically refine knowledge from KGs for better recommendation. To address the above issues, we propose the Variational Reasoning over Incomplete KGs Conversational Recommender (VRICR). Our key idea is to incorporate the large dialogue corpus naturally accompanied with CRSs to enhance the incomplete KGs; and perform dynamic knowledge reasoning conditioned on the dialogue context. Specifically, we denote the dialogue-specific subgraphs of KGs as latent variables with categorical priors for adaptive knowledge graphs refactor. We propose a variational Bayesian method to approximate posterior distributions over dialogue-specific subgraphs, which not only leverages the dialogue corpus for restructuring missing entity relations but also dynamically selects knowledge based on the dialogue context. Finally, we infuse the dialogue-specific subgraphs to decode the recommendation and responses. We conduct experiments on two benchmark CRSs datasets. Experimental results confirm the effectiveness of our proposed method.

Related papers

• Knowledge Graphs and Pre-trained Language Models enhanced Representation Learning for Conversational Recommender Systems [58.561904356651276]
  We introduce the Knowledge-Enhanced Entity Representation Learning (KERL) framework to improve the semantic understanding of entities for Conversational recommender systems. KERL uses a knowledge graph and a pre-trained language model to improve the semantic understanding of entities. KERL achieves state-of-the-art results in both recommendation and response generation tasks.
  arXiv  Detail & Related papers  (2023-12-18T06:41:23Z)
• Knowledge Graph-Augmented Language Models for Knowledge-Grounded Dialogue Generation [58.65698688443091]
  We propose SUbgraph Retrieval-augmented GEneration (SURGE), a framework for generating context-relevant and knowledge-grounded dialogues with Knowledge Graphs (KGs) Our framework first retrieves the relevant subgraph from the KG, and then enforces consistency across facts by perturbing their word embeddings conditioned by the retrieved subgraph. We validate our SURGE framework on OpendialKG and KOMODIS datasets, showing that it generates high-quality dialogues that faithfully reflect the knowledge from KG.
  arXiv  Detail & Related papers  (2023-05-30T08:36:45Z)
• Improving Conversational Recommendation Systems' Quality with Context-Aware Item Meta Information [42.88448098873448]
  Conversational recommendation systems (CRS) engage with users by inferring user preferences from dialog history. Previous CRSs use knowledge graph (KG) based recommendation modules and integrate KG with language models for response generation. We propose a simple yet effective architecture comprising a pre-trained language model (PLM) and an item metadata encoder.
  arXiv  Detail & Related papers  (2021-12-15T14:12:48Z)
• Graph Based Network with Contextualized Representations of Turns in Dialogue [0.0]
  Dialogue-based relation extraction (RE) aims to extract relation(s) between two arguments that appear in a dialogue. We propose the TUrn COntext awaRE Graph Convolutional Network (TUCORE-GCN) modeled by paying attention to the way people understand dialogues.
  arXiv  Detail & Related papers  (2021-09-09T03:09:08Z)
• KECRS: Towards Knowledge-Enriched Conversational Recommendation System [50.0292306485452]
  chit-chat-based conversational recommendation systems (CRS) provide item recommendations to users through natural language interactions. external knowledge graphs (KG) have been introduced into chit-chat-based CRS. We propose the Knowledge-Enriched Conversational Recommendation System (KECRS) Experimental results on a large-scale dataset demonstrate that KECRS outperforms state-of-the-art chit-chat-based CRS.
  arXiv  Detail & Related papers  (2021-05-18T03:52:06Z)
• Learning to Ask Appropriate Questions in Conversational Recommendation [49.31942688227828]
  We propose the Knowledge-Based Question Generation System (KBQG), a novel framework for conversational recommendation. KBQG models a user's preference in a finer granularity by identifying the most relevant relations from a structured knowledge graph. Finially, accurate recommendations can be generated in fewer conversational turns.
  arXiv  Detail & Related papers  (2021-05-11T03:58:10Z)
• Improving Conversational Recommender Systems via Knowledge Graph based Semantic Fusion [77.21442487537139]
  Conversational recommender systems (CRS) aim to recommend high-quality items to users through interactive conversations. First, the conversation data itself lacks of sufficient contextual information for accurately understanding users' preference. Second, there is a semantic gap between natural language expression and item-level user preference.
  arXiv  Detail & Related papers  (2020-07-08T11:14:23Z)

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.