Unsupervised Entity Alignment for Temporal Knowledge Graphs

• URL: http://arxiv.org/abs/2302.00796v1
• Date: Wed, 1 Feb 2023 23:03:22 GMT
• Title: Unsupervised Entity Alignment for Temporal Knowledge Graphs
• Authors: Xiaoze Liu, Junyang Wu, Tianyi Li, Lu Chen, Yunjun Gao
• Abstract summary: We present DualMatch, which fuses temporal and relational information for entity alignment. It is able to perform EA on TKGs with or without supervision, due to its capability of effectively capturing temporal information. Experiments on three real-world TKG datasets offer the insight that DualMatch outperforms the state-of-the-art methods in terms of H@1 by 2.4% - 10.7%.
• Score: 24.830107011195302
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Entity alignment (EA) is a fundamental data integration task that identifies equivalent entities between different knowledge graphs (KGs). Temporal Knowledge graphs (TKGs) extend traditional knowledge graphs by introducing timestamps, which have received increasing attention. State-of-the-art time-aware EA studies have suggested that the temporal information of TKGs facilitates the performance of EA. However, existing studies have not thoroughly exploited the advantages of temporal information in TKGs. Also, they perform EA by pre-aligning entity pairs, which can be labor-intensive and thus inefficient. In this paper, we present DualMatch which effectively fuses the relational and temporal information for EA. DualMatch transfers EA on TKGs into a weighted graph matching problem. More specifically, DualMatch is equipped with an unsupervised method, which achieves EA without necessitating seed alignment. DualMatch has two steps: (i) encoding temporal and relational information into embeddings separately using a novel label-free encoder, Dual-Encoder; and (ii) fusing both information and transforming it into alignment using a novel graph-matching-based decoder, GM-Decoder. DualMatch is able to perform EA on TKGs with or without supervision, due to its capability of effectively capturing temporal information. Extensive experiments on three real-world TKG datasets offer the insight that DualMatch outperforms the state-of-the-art methods in terms of H@1 by 2.4% - 10.7% and MRR by 1.7% - 7.6%, respectively.

Related papers

• An Effective and Efficient Time-aware Entity Alignment Framework via Two-aspect Three-view Label Propagation [8.87467135480257]
  Entity alignment (EA) aims to find the equivalent entity pairs between different knowledge graphs (KGs) We propose an effective and efficient non-neural EA framework between TKGs, namely LightTEA. Our proposed model significantly outperforms the SOTA methods for EA between TKGs, and the time consumed by LightTEA is only dozens of seconds at most.
  arXiv  Detail & Related papers  (2023-07-12T08:51:20Z)
• A Simple Temporal Information Matching Mechanism for Entity Alignment Between Temporal Knowledge Graphs [18.451872649228196]
  We propose a simple graph neural network (GNN) model combined with a temporal information matching mechanism. We also propose a method to generate unsupervised alignment seeds via the temporal information of TKG.
  arXiv  Detail & Related papers  (2022-09-20T12:27:34Z)
• Duality-Induced Regularizer for Semantic Matching Knowledge Graph Embeddings [70.390286614242]
  We propose a novel regularizer -- namely, DUality-induced RegulArizer (DURA) -- which effectively encourages the entities with similar semantics to have similar embeddings. Experiments demonstrate that DURA consistently and significantly improves the performance of state-of-the-art semantic matching models.
  arXiv  Detail & Related papers  (2022-03-24T09:24:39Z)
• Stacked Hybrid-Attention and Group Collaborative Learning for Unbiased Scene Graph Generation [62.96628432641806]
  Scene Graph Generation aims to first encode the visual contents within the given image and then parse them into a compact summary graph. We first present a novel Stacked Hybrid-Attention network, which facilitates the intra-modal refinement as well as the inter-modal interaction. We then devise an innovative Group Collaborative Learning strategy to optimize the decoder.
  arXiv  Detail & Related papers  (2022-03-18T09:14:13Z)
• An Accurate Unsupervised Method for Joint Entity Alignment and Dangling Entity Detection [0.3965019866400874]
  We propose a novel accurate Unsupervised method for joint Entity alignment (EA) and Dangling entity detection (DED) We construct a medical cross-lingual knowledge graph dataset, MedED, providing data for both the EA and DED tasks. In the EA task, UED achieves EA results comparable to those of state-of-the-art supervised EA baselines and outperforms the current state-of-the-art EA methods by combining supervised EA data.
  arXiv  Detail & Related papers  (2022-03-10T04:08:53Z)
• Time-aware Graph Neural Networks for Entity Alignment between Temporal Knowledge Graphs [8.739319749401819]
  We propose a novel time-aware entity alignment approach based on Graph Neural Networks (TEA-GNN) Our method significantly outperforms the state-of-the-art methods due to the inclusion of time information.
  arXiv  Detail & Related papers  (2022-03-04T06:41:51Z)
• Continuous-Time Sequential Recommendation with Temporal Graph Collaborative Transformer [69.0621959845251]
  We propose a new framework Temporal Graph Sequential Recommender (TGSRec) upon our defined continuous-time bi-partite graph. TCT layer can simultaneously capture collaborative signals from both users and items, as well as considering temporal dynamics inside sequential patterns. Empirical results on five datasets show that TGSRec significantly outperforms other baselines.
  arXiv  Detail & Related papers  (2021-08-14T22:50:53Z)
• Few-Shot Electronic Health Record Coding through Graph Contrastive Learning [64.8138823920883]
  We seek to improve the performance for both frequent and rare ICD codes by using a contrastive graph-based EHR coding framework, CoGraph. CoGraph learns similarities and dissimilarities between HEWE graphs from different ICD codes so that information can be transferred among them. Two graph contrastive learning schemes, GSCL and GECL, exploit the HEWE graph structures so as to encode transferable features.
  arXiv  Detail & Related papers  (2021-06-29T14:53:17Z)
• T-GAP: Learning to Walk across Time for Temporal Knowledge Graph Completion [13.209193437124881]
  Temporal knowledge graphs (TKGs) inherently reflect the transient nature of real-world knowledge, as opposed to static knowledge graphs. We propose T-GAP, a novel model for TKG completion that maximally utilizes both temporal information and graph structure in its encoder and decoder. Our experiments demonstrate that T-GAP achieves superior performance against state-of-the-art baselines, and competently generalizes to queries with unseen timestamps.
  arXiv  Detail & Related papers  (2020-12-19T04:45:32Z)
• Dual Adversarial Auto-Encoders for Clustering [152.84443014554745]
  We propose Dual Adversarial Auto-encoder (Dual-AAE) for unsupervised clustering. By performing variational inference on the objective function of Dual-AAE, we derive a new reconstruction loss which can be optimized by training a pair of Auto-encoders. Experiments on four benchmarks show that Dual-AAE achieves superior performance over state-of-the-art clustering methods.
  arXiv  Detail & Related papers  (2020-08-23T13:16:34Z)
• EHSOD: CAM-Guided End-to-end Hybrid-Supervised Object Detection with Cascade Refinement [53.69674636044927]
  We present EHSOD, an end-to-end hybrid-supervised object detection system. It can be trained in one shot on both fully and weakly-annotated data. It achieves comparable results on multiple object detection benchmarks with only 30% fully-annotated data.
  arXiv  Detail & Related papers  (2020-02-18T08:04:58Z)

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.