Dual Graph Embedding for Object-Tag LinkPrediction on the Knowledge Graph
Knowledge graphs (KGs) composed of users, objects, and tags are widely used in web applications ranging from E-commerce, social media sites to news portals. This paper concentrates on an attractive application which aims to predict the object-tag links in the KG for better tag recommendation and object explanation. When predicting the object-tag links, both the first-order and high-order proximities between entities in the KG propagate essential similarity information for better prediction. Most existing methods focus on preserving the first-order proximity between entities in the KG. However, they cannot capture the high-order proximities in an explicit way, and the adopted margin-based criterion cannot measure the first-order proximity on the global structure accurately. In this paper, we propose a novel approach named Dual Graph Embedding (DGE) that models both the first-order and high-order proximities in the KG via an auto-encoding architecture to facilitate better object-tag relation inference. Here the dual graphs contain an object graph and a tag graph that explicitly depict the high-order object-object and tag-tag proximities in the KG. The dual graph encoder in DGE then encodes these high-order proximities in the dual graphs into entity embeddings. The decoder formulates a skip-gram objective that maximizes the first-order proximity between observed object-tag pairs over the global proximity structure. With the supervision of the decoder, the embeddings derived by the encoder will be refined to capture both the first-order and high-order proximities in the KG for better link prediction. Extensive experiments on three real-world datasets demonstrate that DGE outperforms the state-of-the-art methods.
Code (0)
등록된 구현이 없습니다.
Tasks
DecoderEntity EmbeddingsGraph EmbeddingKnowledge GraphsLink PredictionObjectTAGSimilar Papers 제목 키워드 기반
Compositional Fusion of Signals in Data Embedding
Embeddings in AI convert symbolic structures into fixed-dimensional vectors, effectively fusing multiple signals. However, the nature of this fusion in real-world data is often unclear. To address this, we introduce two …
Recommendation SystemsSentenceSentence EmbeddingsWord EmbeddingsPersonalized Federated Knowledge Graph Embedding with Client-Wise Relation Graph
Federated Knowledge Graph Embedding (FKGE) has recently garnered considerable interest due to its capacity to extract expressive representations from distributed knowledge graphs, while concurrently safeguarding the priv…
Entity Embeddingsglobal-optimizationGraph EmbeddingKnowledge Graph Embedding+2KaLM: Knowledge-aligned Autoregressive Language Modeling via Dual-view Knowledge Graph Contrastive Learning
Autoregressive large language models (LLMs) pre-trained by next token prediction are inherently proficient in generative tasks. However, their performance on knowledge-driven tasks such as factual knowledge querying rema…
Contrastive LearningGraph Question AnsweringKnowledge Graph CompletionKnowledge Graphs+3Prediction of Adverse Biological Effects of Chemicals Using Knowledge Graph Embeddings
We have created a knowledge graph based on major data sources used in ecotoxicological risk assessment. We have applied this knowledge graph to an important task in risk assessment, namely chemical effect prediction. We …
Graph EmbeddingKnowledge Graph EmbeddingKnowledge Graph EmbeddingsPredictionFedE: Embedding Knowledge Graphs in Federated Setting
Knowledge graphs (KGs) consisting of triples are always incomplete, so it's important to do Knowledge Graph Completion (KGC) by predicting missing triples. Multi-Source KG is a common situation in real KG applications wh…
Graph EmbeddingKnowledge Graph CompletionKnowledge Graph EmbeddingKnowledge Graph Embeddings+1