A Capsule Network-based Embedding Model for Knowledge Graph Completion and Search Personalization (N19-1)
Copied to clipboard
| Challenge: | Existing knowledge graphs with billions of triples are incomplete, i.e., missing a lot of valid triples. |
| Approach: | They propose to embed relationship triples into a capsule network using a convolution layer and multiple filters to generate feature maps. |
| Outcome: | The proposed model outperforms strong search personalization baselines on two benchmark datasets and outperformed previous state-of-the-art models on WN18RR and FB15k-237. |
Similar Papers
A Relational Memory-based Embedding Model for Triple Classification and Search Personalization (2020.acl-main)
Copied to clipboard
| Challenge: | Existing knowledge graph embedding methods do not allow for the prediction of new triples, such as for search personalization tasks. |
| Approach: | They propose a relational memory network to encode potential dependencies in relationship triples by a transformer self-attention mechanism. |
| Outcome: | The proposed model obtains state-of-the-art results on SEARCH17, WN11 and FB13 for the search personalization task, and on a convolutional neural network-based decoder. |
A Novel Embedding Model for Knowledge Base Completion Based on Convolutional Neural Network (N18-2)
Copied to clipboard
| Challenge: | Existing knowledge base embedding models are incomplete, i.e., missing a lot of valid triples. |
| Approach: | They propose a convolutional neural network embedding model for knowledge base completion that captures global relationships and transitional characteristics. |
| Outcome: | The proposed model outperforms state-of-the-art models on two benchmark datasets. |
Investigating Capsule Network and Semantic Feature on Hyperplanes for Text Classification (D19-1)
Copied to clipboard
| Challenge: | Various neural networks are designed for text classification on the basis of word embedding, but polysemy is a fundamental feature of the natural language, which brings challenges to text classification. |
| Approach: | They propose to use capsule networks to construct the vectorized representation of semantics and utilize hyperplanes to decompose each capsule to acquire the specific senses. |
| Outcome: | The proposed model extracts more discriminative semantic features and yields significant performance gain compared to baseline methods. |
MCapsNet: Capsule Network for Text with Multi-Task Learning (D18-1)
Copied to clipboard
| Challenge: | Multi-task learning has been frustrated by the interference among tasks. |
| Approach: | They propose a capsule-based multi-task learning architecture which is unified, simple and effective. |
| Outcome: | The proposed model can cluster features for each task in the network, which helps reduce the interference among tasks. |
To Copy Rather Than Memorize: A Vertical Learning Paradigm for Knowledge Graph Completion (2023.acl-long)
Copied to clipboard
Rui Li, Xu Chen, Chaozhuo Li, Yanming Shen, Jianan Zhao, Yujing Wang, Weihao Han, Hao Sun, Weiwei Deng, Qi Zhang, Xing Xie
| Challenge: | Existing methods for embedding knowledge graphs implicitly memorize relation rules to infer missing links, but they are difficult to memorize due to the inherent deficiencies of such implicit memorization strategy. |
| Approach: | They propose a vertical learning paradigm that allows to explicitly copy target information from related factual triples for more accurate prediction. |
| Outcome: | The proposed model improves generalization ability and makes distant link prediction significantly easier. |
A Semantic Filter Based on Relations for Knowledge Graph Completion (2021.emnlp-main)
Copied to clipboard
| Challenge: | Knowledge graph embedding is a new form of knowledge graphing that allows for better link prediction. |
| Approach: | They propose to use relational embedding to fit symmetry/antisymmetry and combination relationships. |
| Outcome: | The proposed model can fit symmetry/antisymmetry and combination relationships. |
Sequence-to-Sequence Knowledge Graph Completion and Question Answering (2022.acl-long)
Copied to clipboard
| Challenge: | Knowledge graph embedding (KGE) models represent each entity and relation of a knowledge graph (KG) with low-dimensional embeddable vectors. |
| Approach: | They propose to use an off-the-shelf encoder-decoder Transformer model to generate a knowledge graph embedding model that can be used for KG link prediction and incomplete KG question answering. |
| Outcome: | The proposed model outperforms baselines on multiple large-scale datasets without extensive hyperparameter tuning. |
SEEK: Segmented Embedding of Knowledge Graphs (2020.acl-main)
Copied to clipboard
| Challenge: | Existing methods for knowledge graph embedding can not make a proper trade-off between the model complexity and the model expressiveness, which makes them far from satisfactory. |
| Approach: | They propose a lightweight modeling framework that can achieve highly competitive relational expressiveness without increasing the model complexity. |
| Outcome: | The proposed framework can achieve highly competitive relational expressiveness without increasing model complexity. |
CAKE: A Scalable Commonsense-Aware Framework For Multi-View Knowledge Graph Completion (2022.acl-long)
Copied to clipboard
| Challenge: | Existing knowledge graph embedding techniques rely on fact-view data to predict missing links between entities, limiting their performance. |
| Approach: | They propose a commonsense-aware knowledge embedding framework which generates commonsensense from factual triples with entity concepts for a KGC task. |
| Outcome: | The proposed framework could produce high-quality negative triples and joint commonsense and fact-view link prediction. |
A Framework for Adapting Pre-Trained Language Models to Knowledge Graph Completion (2022.emnlp-main)
Copied to clipboard
| Challenge: | Recent work has demonstrated that entity representations can be extracted from pre-trained language models to develop knowledge graph completion models that are more robust to the naturally occurring sparsity found in knowledge graphs. |
| Approach: | They propose unsupervised and supervised methods to extract more informative representations from pre-trained language models to develop knowledge graph completion models. |
| Outcome: | The proposed model outperforms recent neural models in terms of performance and unsupervised processing methods. |