Journal Article10.1007/s11280-023-01167-x
Correlation embedding learning with dynamic semantic enhanced sampling for knowledge graph completion
5
TL;DR: A dynamic semantic sampling and correlation embedding completion framework that includes a negative sampling algorithm based on dynamic semantic similarity and a correlated embedding model that can enrich embeddings by learning the sequential and correlated information of entities and relations in the knowledge graph.
read more
About: This article is published in World Wide Web. The article was published on 19 May 2023. The article focuses on the topics: Embedding & Computer science.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Overview of Knowledge Reasoning for Knowledge Graph
Xinliang Liu,Tingyu Mao,Yanyan Shi,Yanzhao Ren +3 more
TL;DR: This paper reviews knowledge graph reasoning methods, categorizing them into triplet reasoning, causal inference, temporal inference, and commonsense reasoning, and discusses the incorporation of background knowledge to improve reasoning mechanisms and address remaining challenges.
15
A knowledge graph completion model based on triple level interaction and contrastive learning
Jie Hu,Hao Yang,Fei Teng,Shengdong Du,Tianrui Li +4 more
4
Graph-aware tensor factorization convolutional network for knowledge graph completion
Yuzhu Jin,Liu Yang +1 more
2
MHEC: One-shot relational learning of knowledge graphs completion based on multi-hop information enhancement
Ruixin Ma,Buyun Gao,Weihe Wang,Longfei Wang,Xiaoru Wang,Liang Zhao +5 more
Disentangled Relational Graph Neural Network with Contrastive Learning for knowledge graph completion
Rongzhen Li,Xue Li +1 more
TL;DR: This study introduces DRGCL, a disentangled relational graph neural network with contrastive learning, to acquire relation-aware entity representations for knowledge graph completion tasks, outperforming baseline models on three benchmark datasets.
References
DeepWalk: online learning of social representations
Bryan Perozzi,Rami Al-Rfou,Steven Skiena +2 more
- 24 Aug 2014
TL;DR: DeepWalk as mentioned in this paper uses local information obtained from truncated random walks to learn latent representations by treating walks as the equivalent of sentences, which encode social relations in a continuous vector space, which is easily exploited by statistical models.
•Proceedings Article
Translating Embeddings for Modeling Multi-relational Data
Antoine Bordes,Nicolas Usunier,Alberto Garcia-Duran,Jason Weston,Oksana Yakhnenko +4 more
- 05 Dec 2013
TL;DR: TransE is proposed, a method which models relationships by interpreting them as translations operating on the low-dimensional embeddings of the entities, which proves to be powerful since extensive experiments show that TransE significantly outperforms state-of-the-art methods in link prediction on two knowledge bases.
Freebase: a collaboratively created graph database for structuring human knowledge
Kurt Bollacker,Colin Evans,Praveen Paritosh,Tim Sturge,Jamie Taylor +4 more
- 09 Jun 2008
TL;DR: MQL provides an easy-to-use object-oriented interface to the tuple data in Freebase and is designed to facilitate the creation of collaborative, Web-based data-oriented applications.
6.1K
DBpedia: a nucleus for a web of open data
Sören Auer,Christian Bizer,Georgi Kobilarov,Jens Lehmann,Richard Cyganiak,Zachary G. Ives +5 more
- 11 Nov 2007
TL;DR: The extraction of the DBpedia datasets is described, and how the resulting information is published on the Web for human-andmachine-consumption and how DBpedia could serve as a nucleus for an emerging Web of open data.
LINE: Large-scale Information Network Embedding
Jian Tang,Meng Qu,Mingzhe Wang,Ming Zhang,Jun Yan,Qiaozhu Mei +5 more
- 18 May 2015
TL;DR: A novel network embedding method called the ``LINE,'' which is suitable for arbitrary types of information networks: undirected, directed, and/or weighted, and optimizes a carefully designed objective function that preserves both the local and global network structures.