paper-with-me

Papers

Orthogonal Relation Transforms with Graph Context Modeling for Knowledge Graph Embedding

2019-11-09 · ACL 2020 6 · Yun Tang, Jing Huang, Guangtao Wang, Xiaodong He, Bo-Wen Zhou

Translational distance-based knowledge graph embedding has shown progressive improvements on the link prediction task, from TransE to the latest state-of-the-art RotatE. However, N-1, 1-N and N-N predictions still remain challenging. In this work, we propose a novel translational distance-based approach for knowledge graph link prediction. The proposed method includes two-folds, first we extend the RotatE from 2D complex domain to high dimension space with orthogonal transforms to model relations for better modeling capacity. Second, the graph context is explicitly modeled via two directed context representations. These context representations are used as part of the distance scoring function to measure the plausibility of the triples during training and inference. The proposed approach effectively improves prediction accuracy on the difficult N-1, 1-N and N-N cases for knowledge graph link prediction task. The experimental results show that it achieves better performance on two benchmark data sets compared to the baseline RotatE, especially on data set (FB15k-237) with many high in-degree connection nodes.

📄 PDF Abstract BibTeX arXiv:1911.04910

Code (0)

등록된 구현이 없습니다.

Tasks

Graph EmbeddingKnowledge Graph EmbeddingLink PredictionPredictionRelation

Methods 이 논문이 사용한 방법론

Self-Adversarial Negative Sampling 설명 없음
RotatE RotatE is a method for generating graph embeddings which is able to model and infer various relation patterns including: symmetry/antisymmetry, inversion, and composition.…
TransE TransE is an energy-based model that produces knowledge base embeddings. It models relationships by interpreting them as translations operating on the low-dimensional…

Similar Papers 제목 키워드 기반

Orthogonal Transforms for Signals on Directed Graphs

2021-10-15 · Julia Barrufet, Antonio Ortega

In this paper we consider the problem of defining transforms for signals on directed graphs, with a specific focus on defective graphs where the corresponding graph operator cannot be diagonalized. Our proposed method is…

Learning Fast Sparsifying Transforms

2016-11-24 · Cristian Rusu, John Thompson

Given a dataset, the task of learning a transform that allows sparse representations of the data bears the name of dictionary learning. In many applications, these learned dictionaries represent the data much better than…

Dictionary Learning

Generalizing Knowledge Graph Embedding with Universal Orthogonal Parameterization

2024-05-14 · Rui Li, Chaozhuo Li, Yanming Shen, Zeyu Zhang 외

Recent advances in knowledge graph embedding (KGE) rely on Euclidean/hyperbolic orthogonal relation transformations to model intrinsic logical patterns and topological structures. However, existing approaches are confine…

Graph EmbeddingKnowledge Graph EmbeddingKnowledge Graphs

Orthogonal and Non-Orthogonal Signal Representations Using New Transformation Matrices Having NPM Structure

2021-06-20 · Shaik Basheeruddin Shah, Vijay Kumar Chakka, Arikatla Satyanarayana Reddy

In this paper, we introduce two types of real-valued sums known as Complex Conjugate Pair Sums (CCPSs) denoted as CCPS$^{(1)}$ and CCPS$^{(2)}$, and discuss a few of their properties. Using each type of CCPSs and their c…

Geography-Aware Large Language Models for Next POI Recommendation

2025-05-18 · Zhao Liu, Wei Liu, Huajie Zhu, Jianxing Yu 외

The next Point-of-Interest (POI) recommendation task aims to predict users' next destinations based on their historical movement data and plays a key role in location-based services and personalized applications. Accurat…

Large Language Model