RMNA: A Neighbor Aggregation-Based Knowledge Graph Representation Learning Model Using Rule Mining

• URL: http://arxiv.org/abs/2111.00658v2
• Date: Thu, 4 Nov 2021 08:45:26 GMT
• Title: RMNA: A Neighbor Aggregation-Based Knowledge Graph Representation Learning Model Using Rule Mining
• Authors: Ling Chen, Jun Cui, Xing Tang, Chaodu Song, Yuntao Qian, Yansheng Li, and Yongjun Zhang
• Abstract summary: Neighbor aggregation-based representation learning (NARL) models are proposed, which encode the information in the neighbors of an entity into its embeddings. We propose a NARL model named RMNA, which obtains and filters horn rules through a rule mining algorithm, and uses selected horn rules to transform valuable multi-hop neighbors into one-hop neighbors.
• Score: 9.702290899930608
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Although the state-of-the-art traditional representation learning (TRL) models show competitive performance on knowledge graph completion, there is no parameter sharing between the embeddings of entities, and the connections between entities are weak. Therefore, neighbor aggregation-based representation learning (NARL) models are proposed, which encode the information in the neighbors of an entity into its embeddings. However, existing NARL models either only utilize one-hop neighbors, ignoring the information in multi-hop neighbors, or utilize multi-hop neighbors by hierarchical neighbor aggregation, destroying the completeness of multi-hop neighbors. In this paper, we propose a NARL model named RMNA, which obtains and filters horn rules through a rule mining algorithm, and uses selected horn rules to transform valuable multi-hop neighbors into one-hop neighbors, therefore, the information in valuable multi-hop neighbors can be completely utilized by aggregating these one-hop neighbors. In experiments, we compare RMNA with the state-of-the-art TRL models and NARL models. The results show that RMNA has a competitive performance.

Related papers

• VN Network: Embedding Newly Emerging Entities with Virtual Neighbors [59.906332784508706]
  We propose a novel framework, namely Virtual Neighbor (VN) network, to address three key challenges. First, to reduce the neighbor sparsity problem, we introduce the concept of the virtual neighbors inferred by rules. Secondly, we identify both logic and symmetric path rules to capture complex patterns.
  arXiv  Detail & Related papers  (2024-02-21T03:04:34Z)
• Contrastive Neighborhood Alignment [81.65103777329874]
  We present Contrastive Neighborhood Alignment (CNA), a manifold learning approach to maintain the topology of learned features. The target model aims to mimic the local structure of the source representation space using a contrastive loss. CNA is illustrated in three scenarios: manifold learning, where the model maintains the local topology of the original data in a dimension-reduced space; model distillation, where a small student model is trained to mimic a larger teacher; and legacy model update, where an older model is replaced by a more powerful one.
  arXiv  Detail & Related papers  (2022-01-06T04:58:31Z)
• HRKD: Hierarchical Relational Knowledge Distillation for Cross-domain Language Model Compression [53.90578309960526]
  Large pre-trained language models (PLMs) have shown overwhelming performances compared with traditional neural network methods. We propose a hierarchical relational knowledge distillation (HRKD) method to capture both hierarchical and domain relational information.
  arXiv  Detail & Related papers  (2021-10-16T11:23:02Z)
• Relational Learning with Gated and Attentive Neighbor Aggregator for Few-Shot Knowledge Graph Completion [33.59045268013895]
  We propose a few-shot relational learning with global-local framework to address the above issues. For the local stage, a meta-learning based TransH method is designed to model complex relations and train our model in a few-shot learning fashion. Our model achieves 5-shot FKGC performance improvements of 8.0% on NELL-One and 2.8% on Wiki-One by the metric Hits@10.
  arXiv  Detail & Related papers  (2021-04-27T10:38:44Z)
• Learning Intents behind Interactions with Knowledge Graph for Recommendation [93.08709357435991]
  Knowledge graph (KG) plays an increasingly important role in recommender systems. Existing GNN-based models fail to identify user-item relation at a fine-grained level of intents. We propose a new model, Knowledge Graph-based Intent Network (KGIN)
  arXiv  Detail & Related papers  (2021-02-14T03:21:36Z)
• Relation-Aware Neighborhood Matching Model for Entity Alignment [8.098825914119693]
  We propose a novel Relation-aware Neighborhood Matching model named RNM for entity alignment. We show that the proposed model RNM performs better than state-of-the-art methods.
  arXiv  Detail & Related papers  (2020-12-15T07:22:39Z)
• A Unified Model for Recommendation with Selective Neighborhood Modeling [9.367539466637664]
  We propose a novel neighborhood-based recommender, where a hybrid gated network is designed to automatically separate similar neighbors from dissimilar (noisy) ones. We show that the proposed model consistently outperforms state-of-the-art neighborhood-based recommenders.
  arXiv  Detail & Related papers  (2020-10-19T08:06:16Z)
• Local Neighbor Propagation Embedding [10.120548476934186]
  We introduce neighbor propagation into Local Neighbor propagation Embedding (LNPE) LNPE enhances the local connections and interactions between neighborhoods by extending $1$-hop neighbors into $n$-hop neighbors. Experiments show that LNPE could obtain more faithful and robust embeddings with better topological and geometrical properties.
  arXiv  Detail & Related papers  (2020-06-29T12:49:22Z)
• Modeling Personalized Item Frequency Information for Next-basket Recommendation [63.94555438898309]
  Next-basket recommendation (NBR) is prevalent in e-commerce and retail industry. We argue that existing RNNs cannot directly capture item frequency information in the recommendation scenario. We propose a simple item frequency based k-nearest neighbors (kNN) method to directly utilize these critical signals.
  arXiv  Detail & Related papers  (2020-05-31T16:42:39Z)
• Neighborhood Matching Network for Entity Alignment [71.24217694278616]
  Neighborhood Matching Network (NMN) is a novel entity alignment framework. NMN estimates the similarities between entities to capture both the topological structure and the neighborhood difference. It first uses a novel graph sampling method to distill a discriminative neighborhood for each entity. It then adopts a cross-graph neighborhood matching module to jointly encode the neighborhood difference for a given entity pair.
  arXiv  Detail & Related papers  (2020-05-12T08:26:15Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.