Inferring Substitutable and Complementary Products with Knowledge-Aware Path Reasoning based on Dynamic Policy Network

• URL: http://arxiv.org/abs/2110.03276v1
• Date: Thu, 7 Oct 2021 09:00:36 GMT
• Title: Inferring Substitutable and Complementary Products with Knowledge-Aware Path Reasoning based on Dynamic Policy Network
• Authors: Zijing Yang, Jiabo Ye, Linlin Wang, Xin Lin, Liang He
• Abstract summary: Inferring substitutable and complementary products for a given product is an essential and fundamental concern for the recommender system. Existing approaches take advantage of the knowledge graphs to learn more evidences for inference, whereas they often suffer from invalid reasoning for lack of elegant decision making strategies. We propose a novel Knowledge-Aware Path Reasoning (KAPR) model which leverages the dynamic policy network to make explicit reasoning over knowledge graphs.
• Score: 15.723090822315454
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: Inferring the substitutable and complementary products for a given product is an essential and fundamental concern for the recommender system. To achieve this, existing approaches take advantage of the knowledge graphs to learn more evidences for inference, whereas they often suffer from invalid reasoning for lack of elegant decision making strategies. Therefore, we propose a novel Knowledge-Aware Path Reasoning (KAPR) model which leverages the dynamic policy network to make explicit reasoning over knowledge graphs, for inferring the substitutable and complementary relationships. Our contributions can be highlighted as three aspects. Firstly, we model this inference scenario as a Markov Decision Process in order to accomplish a knowledge-aware path reasoning over knowledge graphs. Secondly,we integrate both structured and unstructured knowledge to provide adequate evidences for making accurate decision-making. Thirdly, we evaluate our model on a series of real-world datasets, achieving competitive performance compared with state-of-the-art approaches. Our code is released on https://gitee.com/yangzijing flower/kapr/tree/master.

Related papers

• A Study of Situational Reasoning for Traffic Understanding [63.45021731775964]
  We devise three novel text-based tasks for situational reasoning in the traffic domain. We adopt four knowledge-enhanced methods that have shown generalization capability across language reasoning tasks in prior work. We provide in-depth analyses of model performance on data partitions and examine model predictions categorically.
  arXiv  Detail & Related papers  (2023-06-05T01:01:12Z)
• A Conceptual Model for End-to-End Causal Discovery in Knowledge Tracing [8.049552839071918]
  We take a preliminary step towards solving the problem of causal discovery in knowledge tracing. Our solution placed among the top entries in Task 3 of the NeurIPS 2022 Challenge on Causal Insights for Learning Paths in Education.
  arXiv  Detail & Related papers  (2023-05-11T21:20:29Z)
• Neurosymbolic AI for Reasoning over Knowledge Graphs: A Survey [0.0]
  We survey methods that perform neurosymbolic reasoning tasks on knowledge graphs and propose a novel taxonomy by which we can classify them. Specifically, we propose three major categories: (1) logically-informed embedding approaches, (2) embedding approaches with logical constraints, and (3) rule learning approaches.
  arXiv  Detail & Related papers  (2023-02-14T17:24:30Z)
• Knowledge is Power, Understanding is Impact: Utility and Beyond Goals, Explanation Quality, and Fairness in Path Reasoning Recommendation [12.925021362985987]
  Path reasoning is a notable recommendation approach that models high-order user-product relations. We replicated three state-of-the-art relevant path reasoning recommendation methods proposed in top-tier conferences. We studied the extent to which they meet recommendation utility and beyond objectives, explanation quality, and consumer and provider fairness.
  arXiv  Detail & Related papers  (2023-01-14T16:18:46Z)
• Prior Knowledge Guided Unsupervised Domain Adaptation [82.9977759320565]
  We propose a Knowledge-guided Unsupervised Domain Adaptation (KUDA) setting where prior knowledge about the target class distribution is available. In particular, we consider two specific types of prior knowledge about the class distribution in the target domain: Unary Bound and Binary Relationship. We propose a rectification module that uses such prior knowledge to refine model generated pseudo labels.
  arXiv  Detail & Related papers  (2022-07-18T18:41:36Z)
• MERIt: Meta-Path Guided Contrastive Learning for Logical Reasoning [63.50909998372667]
  We propose MERIt, a MEta-path guided contrastive learning method for logical ReasonIng of text. Two novel strategies serve as indispensable components of our method.
  arXiv  Detail & Related papers  (2022-03-01T11:13:00Z)
• Combining Inductive and Deductive Reasoning for Query Answering over Incomplete Knowledge Graphs [12.852658691077643]
  Current methods for embedding-based query answering over incomplete Knowledge Graphs (KGs) only focus on inductive reasoning. We propose various integration strategies into prominent representatives of embedding models. The achieved improvements in the setting that requires both inductive and deductive reasoning are from 20% to 55% in HITS@3.
  arXiv  Detail & Related papers  (2021-06-26T16:05:44Z)
• CO-NNECT: A Framework for Revealing Commonsense Knowledge Paths as Explicitations of Implicit Knowledge in Texts [12.94206336329289]
  We leverage commonsense knowledge in form of knowledge paths to establish connections between sentences. These connections can be direct (singlehop paths) or require intermediate concepts (multihop paths)
  arXiv  Detail & Related papers  (2021-05-07T10:43:43Z)
• KRISP: Integrating Implicit and Symbolic Knowledge for Open-Domain Knowledge-Based VQA [107.7091094498848]
  One of the most challenging question types in VQA is when answering the question requires outside knowledge not present in the image. In this work we study open-domain knowledge, the setting when the knowledge required to answer a question is not given/annotated, neither at training nor test time. We tap into two types of knowledge representations and reasoning. First, implicit knowledge which can be learned effectively from unsupervised language pre-training and supervised training data with transformer-based models.
  arXiv  Detail & Related papers  (2020-12-20T20:13:02Z)
• KompaRe: A Knowledge Graph Comparative Reasoning System [85.72488258453926]
  This paper introduces comparative reasoning over knowledge graphs, which aims to infer the commonality and inconsistency with respect to multiple pieces of clues. We develop KompaRe, the first of its kind prototype system that provides comparative reasoning capability over large knowledge graphs.
  arXiv  Detail & Related papers  (2020-11-06T04:57:37Z)
• A Simple Approach to Case-Based Reasoning in Knowledge Bases [56.661396189466664]
  We present a surprisingly simple yet accurate approach to reasoning in knowledge graphs (KGs) that requires emphno training, and is reminiscent of case-based reasoning in classical artificial intelligence (AI) Consider the task of finding a target entity given a source entity and a binary relation. Our non-parametric approach derives crisp logical rules for each query by finding multiple textitgraph path patterns that connect similar source entities through the given relation.
  arXiv  Detail & Related papers  (2020-06-25T06:28:09Z)

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.