Journal Article10.1007/s10618-022-00851-2
ContE: contextualized knowledge graph embedding for circular relations
6
TL;DR: This work proposes a novel method called ContE ( Cont extualized E mbedding) for knowledge graphs by exploring collaborative relations, which combines an explicit relation and a latent relation, where the explicit one is the original relation between two entities, and the latent one is introduced to capture the implicit interactions obtained via the context information of the two entities.
read more
About: This article is published in Data Mining and Knowledge Discovery. The article was published on 27 Oct 2022. The article focuses on the topics: Computer science & Embedding.
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
Knowledge Graph Embedding: A Survey from the Perspective of Representation Spaces
TL;DR: Knowledge graph embedding (KGE) is an increasingly popular technique that aims to represent entities and relations of knowledge graphs into low-dimensional semantic spaces for a wide spectrum of applications such as link prediction, knowledge reasoning and knowledge completion as discussed by the authors .
Knowledge Graph Embedding: A Survey from the Perspective of Representation Spaces
Jiahang Cao,Jinyuan Fang,Zaiqiao Meng,Shangsong Liang +3 more
TL;DR: KGE techniques based on representation spaces are used to represent knowledge graphs into low-dimensional semantic spaces for various applications. The article categorizes KGE models based on three mathematical perspectives of representation spaces and discusses different KGE methods over these categories. It also explores the advantages of mathematical space in different embedding needs and provides promising research directions.
21
A Benchmark on Extremely Weakly Supervised Text Classification: Reconcile Seed Matching and Prompting Approaches
TL;DR: Wang et al. as discussed by the authors presented the first XWS-TC benchmark to compare the two approaches on fair grounds, where the datasets, supervisions, and hyperparameter choices are standardized across methods.
A Benchmark on Extremely Weakly Supervised Text Classification: Reconcile Seed Matching and Prompting Approaches
Zihan Wang,Tianle Wang,Dheeraj Mekala,Jingbo Shang +3 more
- 01 Jan 2023
TL;DR: A benchmark comparing seed matching and prompting approaches for extremely weakly supervised text classification. Findings suggest that both approaches are competitive, with seed matching being more tolerant to human guidance changes and prompting being more selective to pre-trained language models.
Knowledge graph combined with user profile algorithm for personalized recommendation of leisure tourism
Tian Li,Anmin Huang +1 more
Abstract: Current recommendation systems for tourism struggle to capture the dynamic changes in user preferences. Therefore, this study proposes a knowledge graph embedding technique that combines dynamic mapping matrices to construct a tourism recommendation model. Meanwhile, bidirectional long short-term memory networks and node-level attention mechanisms are introduced to enhance the modeling ability for dynamic changes in user behavior. The experimental results on the YAGO11k dataset showed that the accuracy of the training set reached 99.4%, and the model had excellent training performance and generalization ability. In the evaluation indicators of the knowledge graph, the average ranking and average reciprocal ranking were 452 and 0.430, significantly better than the baseline, with a hit rate of up to 29.1%. This model provides an effective solution for personalized travel recommendations.
References
•Proceedings Article
Adam: A Method for Stochastic Optimization
Diederik P. Kingma,Jimmy Ba +1 more
- 01 Jan 2015
TL;DR: This work introduces Adam, an algorithm for first-order gradient-based optimization of stochastic objective functions, based on adaptive estimates of lower-order moments, and provides a regret bound on the convergence rate that is comparable to the best known results under the online convex optimization framework.
138.5K
•Proceedings Article
Attention is All you Need
Ashish Vaswani,Noam Shazeer,Niki Parmar,Jakob Uszkoreit,Llion Jones,Aidan N. Gomez,Lukasz Kaiser,Illia Polosukhin +7 more
- 12 Jun 2017
TL;DR: This paper proposed a simple network architecture based solely on an attention mechanism, dispensing with recurrence and convolutions entirely and achieved state-of-the-art performance on English-to-French translation.
Graph Attention Networks
Petar Veličković,Guillem Cucurull,Arantxa Casanova,Adriana Romero,Pietro Liò,Yoshua Bengio +5 more
- 15 Feb 2018
TL;DR: Graph Attention Networks (GATs) as mentioned in this paper leverage masked self-attentional layers to address the shortcomings of prior methods based on graph convolutions or their approximations.
•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