Non-translational Alignment for Multi-relational Networks

Shengnan Li, Xin Li, Rui Ye, Mingzhong Wang, Haiping Su, Yingzi Ou

Introduction

Knowledge graphs (KGs) such as DBpedia and Freebase serve as critical infrastructure for modern AI applications. However, these graphs are frequently siloed by language, hindering the creation of a unified global knowledge base. Network alignment—the process of identifying equivalent entities across different language-specific KGs (e.g., "London" in English and "Londres" in French)—is essential for bridging these gaps.

The Limitations of Translation-Based Models

Historically, network alignment has relied on translation-based embeddings, such as the TransE family. These models operate on the principle that the vector representation of a "head" entity ($h$) plus a relation ($r$) should equal the "tail" entity ($t$): $h + r \approx t$. While computationally efficient, this linear constraint struggles to represent complex local graph topologies, particularly "triangular structures."

Structural motifs and the 'triangle trap' in knowledge graphs.

As shown in Figure 4, if an entity has multiple relational paths to another entity (e.g., a person is both "born in" a city and also "lives in" that city), translation-based models may incorrectly force different relations to share the same vector or collapse entity representations. This "Triangle Trap" limits the model's ability to capture the unique structural fingerprint of nodes, ultimately degrading alignment accuracy.

The NTAM Framework

To address these limitations, researchers developed NTAM (Non-translational Alignment for Multi-relational Networks). NTAM moves away from rigid geometric constraints in favor of a flexible probabilistic framework.

1. Probabilistic Embedding

Instead of the $h + r = t$ constraint, NTAM defines the probability of a relationship based on the proximity of vectors in a $d$-dimensional space. This approach preserves specific structural motifs, ensuring that the embedding captures the local connectivity patterns of each node without being constrained by linear arithmetic.

2. Joint Embedding via Anchors

To align two disparate language networks, NTAM utilizes "anchors" (known pairs of identical entities or relations). During training, the model employs a "swap" mechanism: it deliberately replaces the representation of an entity with its known counterpart from the other language. This forces the separate networks to overlap within a shared vector space.

3. Efficient Inference

The model is optimized using Stochastic Gradient Descent (SGD) with negative sampling. By using only a single vector per node (rather than separate source and target vectors), NTAM maintains a low parameter count, which helps prevent overfitting and ensures scalability to large datasets.

Experimental Results

NTAM was evaluated on the WK3l-15k and WK3l-120k datasets, which contain cross-lingual data from DBpedia for English, French, and German.

The results demonstrate a significant performance leap over state-of-the-art translation-based baselines like MTransE and ITransE. On the English-French alignment task (WK3l-15k), NTAM achieved a Hits@1 score of 73.6%, compared to just 55.0% for ITransE. Furthermore, NTAM proved robust even with limited training seeds and avoided the error propagation issues common in iterative alignment models.

Conclusion and Future Work

By relaxing the translational constraint, NTAM provides a more expressive and accurate method for cross-lingual knowledge graph alignment. While the current model focuses purely on graph structure, future iterations aim to integrate semantic information—such as entity descriptions and textual attributes—to further enhance alignment in sparse or ambiguous regions of the network.

Summary updated

Abstract

Most existing solutions for the alignment of multi-relational networks, such as multi-lingual knowledge bases, are ``translation''-based which facilitate the network embedding via the trans-family, such as TransE. However, they cannot address triangular or other structural properties effectively. Thus, we propose a non-translational approach, which aims to utilize a probabilistic model to offer more robust solutions to the alignment task, by exploring the structural properties as well as leveraging on anchors to project each network onto the same vector space during the process of learning the representation of individual networks. The extensive experiments on four multi-lingual knowledge graphs demonstrate the effectiveness and robustness of the proposed method over a set of state-of-the-art alignment methods.
BibTeX
@inproceedings{li2018non,
  author = {Shengnan Li and Xin Li and Rui Ye and Mingzhong Wang and Haiping Su and Yingzi Ou},
  title = {{Non-translational Alignment for Multi-relational Networks}},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year = {2018},
  doi = {10.24963/ijcai.2018/581},
}
Figure