Fast Linear Model for Knowledge Graph Embeddings
This paper shows that a simple baseline based on a Bag-of-Words (BoW) representation learns surprisingly good knowledge graph embeddings. By casting knowledge base completion and question answering as supervised classification problems, we observe that modeling co-occurences of entities and relations leads to state-of-the-art performance with a training time of a few minutes using the open sourced library fastText.
Code (1)
Tasks
General ClassificationKnowledge Base CompletionKnowledge Graph EmbeddingsmodelQuestion AnsweringMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
A Physical Embedding Model for Knowledge Graphs
Knowledge graph embedding methods learn continuous vector representations for entities in knowledge graphs and have been used successfully in a large number of applications. We present a novel and scalable paradigm for t…
Graph EmbeddingKnowledge Graph EmbeddingKnowledge Graph EmbeddingsKnowledge Graphs+2Fast and scalable learning of neuro-symbolic representations of biomedical knowledge
In this work we address the problem of fast and scalable learning of neuro-symbolic representations for general biological knowledge. Based on a recently published comprehensive biological knowledge graph (Alshahrani, 20…
Entity EmbeddingsLink PredictionRepresentation LearningTransformation of Node to Knowledge Graph Embeddings for Faster Link Prediction in Social Networks
Recent advances in neural networks have solved common graph problems such as link prediction, node classification, node clustering, node recommendation by developing embeddings of entities and relations into vector space…
Knowledge Graph EmbeddingsLink PredictionNode ClassificationNode ClusteringRevisiting FastMap: New Applications
FastMap was first introduced in the Data Mining community for generating Euclidean embeddings of complex objects. In this dissertation, we first present FastMap to generate Euclidean embeddings of graphs in near-linear t…
Community DetectionTaCE: Time-aware Convolutional Embedding Learning for Temporal Knowledge Graph Completion
Temporal knowledge graph completion (TKGC) is a challenging task to infer the missing component for quadruples. The key challenge lies at how to integrate time information into the embeddings of entities and relations. R…
Knowledge Graph CompletionKnowledge GraphsTemporal Knowledge Graph Completion