COOKIE: A Dataset for Conversational Recommendation over Knowledge Graphs in E-commerce

• URL: http://arxiv.org/abs/2008.09237v1
• Date: Fri, 21 Aug 2020 00:11:31 GMT
• Title: COOKIE: A Dataset for Conversational Recommendation over Knowledge Graphs in E-commerce
• Authors: Zuohui Fu, Yikun Xian, Yaxin Zhu, Yongfeng Zhang, Gerard de Melo
• Abstract summary: We present a new dataset for conversational recommendation over knowledge graphs in e-commerce platforms called COOKIE. The dataset is constructed from an Amazon review corpus by integrating both user-agent dialogue and custom knowledge graphs for recommendation.
• Score: 64.95907840457471
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In this work, we present a new dataset for conversational recommendation over knowledge graphs in e-commerce platforms called COOKIE. The dataset is constructed from an Amazon review corpus by integrating both user-agent dialogue and custom knowledge graphs for recommendation. Specifically, we first construct a unified knowledge graph and extract key entities between user--product pairs, which serve as the skeleton of a conversation. Then we simulate conversations mirroring the human coarse-to-fine process of choosing preferred items. The proposed baselines and experiments demonstrate that our dataset is able to provide innovative opportunities for conversational recommendation.

Related papers

• Leveraging Knowledge Graph Embedding for Effective Conversational Recommendation [4.079573593766921]
  We propose a knowledge graph based conversational recommender system (referred as KG-CRS) Specifically, we first integrate the user-item graph and item-attribute graph into a dynamic graph, dynamically changing during the dialogue process by removing negative items or attributes. We then learn informative embedding of users, items, and attributes by also considering propagation through neighbors on the graph.
  arXiv  Detail & Related papers  (2024-08-02T15:38:55Z)
• Parameter-Efficient Conversational Recommender System as a Language Processing Task [52.47087212618396]
  Conversational recommender systems (CRS) aim to recommend relevant items to users by eliciting user preference through natural language conversation. Prior work often utilizes external knowledge graphs for items' semantic information, a language model for dialogue generation, and a recommendation module for ranking relevant items. In this paper, we represent items in natural language and formulate CRS as a natural language processing task.
  arXiv  Detail & Related papers  (2024-01-25T14:07:34Z)
• AUGUST: an Automatic Generation Understudy for Synthesizing Conversational Recommendation Datasets [56.052803235932686]
  We propose a novel automatic dataset synthesis approach that can generate both large-scale and high-quality recommendation dialogues. In doing so, we exploit: (i) rich personalized user profiles from traditional recommendation datasets, (ii) rich external knowledge from knowledge graphs, and (iii) the conversation ability contained in human-to-human conversational recommendation datasets.
  arXiv  Detail & Related papers  (2023-06-16T05:27:14Z)
• Multi-grained Hypergraph Interest Modeling for Conversational Recommendation [75.65483522949857]
  We propose a novel multi-grained hypergraph interest modeling approach to capture user interest beneath intricate historical data. In our approach, we first employ the hypergraph structure to model users' historical dialogue sessions and form a session-based hypergraph, which captures coarse-grained, session-level relations. We further conduct multi-grained hypergraph convolution on the two kinds of hypergraphs, and utilize the enhanced representations to develop interest-aware CRS.
  arXiv  Detail & Related papers  (2023-05-04T13:13:44Z)
• Talk the Walk: Synthetic Data Generation for Conversational Music Recommendation [62.019437228000776]
  We present TalkWalk, which generates realistic high-quality conversational data by leveraging encoded expertise in widely available item collections. We generate over one million diverse conversations in a human-collected dataset.
  arXiv  Detail & Related papers  (2023-01-27T01:54:16Z)
• COLA: Improving Conversational Recommender Systems by Collaborative Augmentation [9.99763097964222]
  We propose a collaborative augmentation (COLA) method to improve both item representation learning and user preference modeling. We construct an interactive user-item graph from all conversations, which augments item representations with user-aware information. To improve user preference modeling, we retrieve similar conversations from the training corpus, where the involved items and attributes that reflect the user's potential interests are used to augment the user representation.
  arXiv  Detail & Related papers  (2022-12-15T12:37:28Z)
• 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)
• 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.