HyperS2V: A Framework for Structural Representation of Nodes in Hyper Networks

TL;DR

HyperS2V introduces a novel node embedding method for hyper networks that emphasizes structural similarity, utilizing hyper-degrees and multi-scale random walks, demonstrating superior interpretability and effectiveness in real-world applications.

Contribution

The paper proposes HyperS2V, a new framework for structural node embedding in hyper networks, focusing on hyper-degrees and multi-scale random walks for improved interpretability.

Findings

HyperS2V outperforms existing methods in interpretability.

It achieves better results on downstream tasks.

Demonstrates effectiveness on both toy and real networks.

Abstract

In contrast to regular (simple) networks, hyper networks possess the ability to depict more complex relationships among nodes and store extensive information. Such networks are commonly found in real-world applications, such as in social interactions. Learning embedded representations for nodes involves a process that translates network structures into more simplified spaces, thereby enabling the application of machine learning approaches designed for vector data to be extended to network data. Nevertheless, there remains a need to delve into methods for learning embedded representations that prioritize structural aspects. This research introduces HyperS2V, a node embedding approach that centers on the structural similarity within hyper networks. Initially, we establish the concept of hyper-degrees to capture the structural properties of nodes within hyper networks. Subsequently, a novel function is formulated to measure the structural similarity between different hyper-degree values. Lastly, we generate structural embeddings utilizing a multi-scale random walk framework. Moreover, a series of experiments, both intrinsic and extrinsic, are performed on both toy and real networks. The results underscore the superior performance of HyperS2V in terms of both interpretability and applicability to downstream tasks.