Exposing Multi-Relational Networks to Single-Relational Network Analysis Algorithms

TL;DR

This paper introduces an algebraic framework that transforms multi-relational networks into single-relational networks, enabling the application of existing single-relational analysis algorithms to more complex, heterogeneous data structures.

Contribution

The paper proposes a novel algebraic method for converting multi-relational networks into single-relational networks, facilitating the use of existing analysis algorithms.

Findings

Provides a formal algebraic framework for network transformation

Enables application of single-relational algorithms to multi-relational data

Enhances analysis capabilities for complex network structures

Abstract

Many, if not most network analysis algorithms have been designed specifically for single-relational networks; that is, networks in which all edges are of the same type. For example, edges may either represent "friendship," "kinship," or "collaboration," but not all of them together. In contrast, a multi-relational network is a network with a heterogeneous set of edge labels which can represent relationships of various types in a single data structure. While multi-relational networks are more expressive in terms of the variety of relationships they can capture, there is a need for a general framework for transferring the many single-relational network analysis algorithms to the multi-relational domain. It is not sufficient to execute a single-relational network analysis algorithm on a multi-relational network by simply ignoring edge labels. This article presents an algebra for mapping multi-relational networks to single-relational networks, thereby exposing them to single-relational network analysis algorithms.