Is There More Pattern in Knowledge Graph? Exploring Proximity Pattern for Knowledge Graph Embedding

• URL: http://arxiv.org/abs/2110.00720v1
• Date: Sat, 2 Oct 2021 03:50:42 GMT
• Title: Is There More Pattern in Knowledge Graph? Exploring Proximity Pattern for Knowledge Graph Embedding
• Authors: Ren Li, Yanan Cao, Qiannan Zhu, Xiaoxue Li, Fang Fang
• Abstract summary: We name such semantic phenomenon in knowledge graph as proximity pattern. With the original knowledge graph, we design a Chained couPle-GNN architecture to deeply merge the two patterns. Being evaluated on FB15k-237 and WN18RR datasets, CP-GNN achieves state-of-the-art results for Knowledge Graph Completion task.
• Score: 13.17623081024394
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Modeling of relation pattern is the core focus of previous Knowledge Graph Embedding works, which represents how one entity is related to another semantically by some explicit relation. However, there is a more natural and intuitive relevancy among entities being always ignored, which is that how one entity is close to another semantically, without the consideration of any explicit relation. We name such semantic phenomenon in knowledge graph as proximity pattern. In this work, we explore the problem of how to define and represent proximity pattern, and how it can be utilized to help knowledge graph embedding. Firstly, we define the proximity of any two entities according to their statistically shared queries, then we construct a derived graph structure and represent the proximity pattern from global view. Moreover, with the original knowledge graph, we design a Chained couPle-GNN (CP-GNN) architecture to deeply merge the two patterns (graphs) together, which can encode a more comprehensive knowledge embedding. Being evaluated on FB15k-237 and WN18RR datasets, CP-GNN achieves state-of-the-art results for Knowledge Graph Completion task, and can especially boost the modeling capacity for complex queries that contain multiple answer entities, proving the effectiveness of introduced proximity pattern.

Related papers

• Survey on Embedding Models for Knowledge Graph and its Applications [0.0]
  Knowledge Graph (KG) is a graph based data structure to represent facts of the world where nodes represent real world entities or abstract concept and edges represent relation between the entities. Knowledge Graph embedding tackles the drawback by representing entities and relation in low dimensional vector space by capturing the semantic relation between them. Here, we discuss translation based and neural network based embedding models which differ based on semantic property, scoring function and architecture they use.
  arXiv  Detail & Related papers  (2024-04-14T07:15:59Z)
• Relation-Aware Question Answering for Heterogeneous Knowledge Graphs [37.38138785470231]
  Existing retrieval-based approaches solve this task by concentrating on the specific relation at different hops. We claim they fail to utilize information from head-tail entities and the semantic connection between relations to enhance the current relation representation. Our approach achieves a significant performance gain over the prior state-of-the-art.
  arXiv  Detail & Related papers  (2023-12-19T08:01:48Z)
• One-shot Scene Graph Generation [130.57405850346836]
  We propose Multiple Structured Knowledge (Relational Knowledgesense Knowledge) for the one-shot scene graph generation task. Our method significantly outperforms existing state-of-the-art methods by a large margin.
  arXiv  Detail & Related papers  (2022-02-22T11:32:59Z)
• Joint Graph Learning and Matching for Semantic Feature Correspondence [69.71998282148762]
  We propose a joint emphgraph learning and matching network, named GLAM, to explore reliable graph structures for boosting graph matching. The proposed method is evaluated on three popular visual matching benchmarks (Pascal VOC, Willow Object and SPair-71k) It outperforms previous state-of-the-art graph matching methods by significant margins on all benchmarks.
  arXiv  Detail & Related papers  (2021-09-01T08:24:02Z)
• Mutual Graph Learning for Camouflaged Object Detection [31.422775969808434]
  A major challenge is that intrinsic similarities between foreground objects and background surroundings make the features extracted by deep model indistinguishable. We design a novel Mutual Graph Learning model, which generalizes the idea of conventional mutual learning from regular grids to the graph domain. In contrast to most mutual learning approaches that use a shared function to model all between-task interactions, MGL is equipped with typed functions for handling different complementary relations.
  arXiv  Detail & Related papers  (2021-04-03T10:14:39Z)
• Learning Intents behind Interactions with Knowledge Graph for Recommendation [93.08709357435991]
  Knowledge graph (KG) plays an increasingly important role in recommender systems. Existing GNN-based models fail to identify user-item relation at a fine-grained level of intents. We propose a new model, Knowledge Graph-based Intent Network (KGIN)
  arXiv  Detail & Related papers  (2021-02-14T03:21:36Z)
• Graphonomy: Universal Image Parsing via Graph Reasoning and Transfer [140.72439827136085]
  We propose a graph reasoning and transfer learning framework named "Graphonomy" It incorporates human knowledge and label taxonomy into the intermediate graph representation learning beyond local convolutions. It learns the global and structured semantic coherency in multiple domains via semantic-aware graph reasoning and transfer.
  arXiv  Detail & Related papers  (2021-01-26T08:19:03Z)
• Context-Enhanced Entity and Relation Embedding for Knowledge Graph Completion [2.580765958706854]
  We propose a model named AggrE, which conducts efficient aggregations on entity context and relation context in multi-hops. Experiment results show that AggrE is competitive to existing models.
  arXiv  Detail & Related papers  (2020-12-13T09:20:42Z)
• GoGNN: Graph of Graphs Neural Network for Predicting Structured Entity Interactions [70.9481395807354]
  We propose a Graph of Graphs Neural Network (GoGNN), which extracts the features in both structured entity graphs and the entity interaction graph in a hierarchical way. GoGNN outperforms the state-of-the-art methods on two representative structured entity interaction prediction tasks.
  arXiv  Detail & Related papers  (2020-05-12T03:46:15Z)
• Relational Message Passing for Knowledge Graph Completion [78.47976646383222]
  We propose a relational message passing method for knowledge graph completion. It passes relational messages among edges iteratively to aggregate neighborhood information. Results show our method outperforms stateof-the-art knowledge completion methods by a large margin.
  arXiv  Detail & Related papers  (2020-02-17T03:33:41Z)

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.