HJE: Joint Convolutional Representation Learning for Knowledge Hypergraph Completion
Knowledge hypergraph representation learning , which projects entities and n -ary relations into a low-dimensional vector space, remains a challenging area to be explored despite the ubiquity of n -ary relational facts in the real world. Current methods are always extensions of those used for knowledge graphs with shallow or deep structures. However, shallow and linear models limit the extraction capacity of the latent knowledge, while deep and non-linear models lead to the overabundance of parameters. In this paper, we propose a novel knowledge hypergraph completion model called HJE, which utilizes the powerful capability of convolutional neural networks for efficient representation learning. Interaction-enhanced 3D convolution and relation-aware 2D convolution are jointly utilized by HJE to extract explicit and implicit global knowledge and semantic information effectively without compromising the translation property of the model. Moreover, HJE constructs a unified learnable embedding matrix to capture entity position information in knowledge tuples. The entity mask mechanism can naturally couple the multilinear scoring approach for n -ary facts to speed up the training convergence of the model. Extensive experimental results on real datasets of knowledge hypergraphs and knowledge graphs demonstrate the superior performance of HJE compared with state-of-the-art baselines.
Code (0)
등록된 구현이 없습니다.
Tasks
Knowledge GraphsRepresentation LearningMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Knowledge Hypergraph Embedding Meets Relational Algebra
Embedding-based methods for reasoning in knowledge hypergraphs learn a representation for each entity and relation. Current methods do not capture the procedural rules underlying the relations in the graph. We propose a …
hypergraph embeddingKnowledge GraphsLink PredictionEvRainDrop: HyperGraph-guided Completion for Effective Frame and Event Stream Aggregation
Event cameras produce asynchronous event streams that are spatially sparse yet temporally dense. Mainstream event representation learning algorithms typically use event frames, voxels, or tensors as input. Although these…
Representation LearningHEAT: Hyperedge Attention Networks
Learning from structured data is a core machine learning task. Commonly, such data is represented as graphs, which normally only consider (typed) binary relationships between pairs of nodes. This is a substantial limitat…
Knowledge Base CompletionDeterministic tensor completion with hypergraph expanders
We provide a novel analysis of low-rank tensor completion based on hypergraph expanders. As a proxy for rank, we minimize the max-quasinorm of the tensor, which generalizes the max-norm for matrices. Our analysis is dete…
LEMMADynamic Hypergraph Convolutional Networks for Skeleton-Based Action Recognition
Graph convolutional networks (GCNs) based methods have achieved advanced performance on skeleton-based action recognition task. However, the skeleton graph cannot fully represent the motion information contained in skele…
Action RecognitionSkeleton Based Action Recognition