Embedding Node Structural Role Identity Using Stress Majorization

• URL: http://arxiv.org/abs/2109.07023v1
• Date: Tue, 14 Sep 2021 23:48:16 GMT
• Title: Embedding Node Structural Role Identity Using Stress Majorization
• Authors: Lili Wang, Chenghan Huang, Weicheng Ma, Ying Lu, Soroush Vosoughi
• Abstract summary: We present a novel framework to transform the high-dimensional role identities in networks directly. Our method is flexible, in that it does not rely on specific structural similarity definitions. Our experiments show that our framework achieves superior results than existing methods in learning node role representations.
• Score: 8.485373271217606
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Nodes in networks may have one or more functions that determine their role in the system. As opposed to local proximity, which captures the local context of nodes, the role identity captures the functional "role" that nodes play in a network, such as being the center of a group, or the bridge between two groups. This means that nodes far apart in a network can have similar structural role identities. Several recent works have explored methods for embedding the roles of nodes in networks. However, these methods all rely on either approximating or indirect modeling of structural equivalence. In this paper, we present a novel and flexible framework using stress majorization, to transform the high-dimensional role identities in networks directly (without approximation or indirect modeling) to a low-dimensional embedding space. Our method is also flexible, in that it does not rely on specific structural similarity definitions. We evaluated our method on the tasks of node classification, clustering, and visualization, using three real-world and five synthetic networks. Our experiments show that our framework achieves superior results than existing methods in learning node role representations.

Related papers

• Federated Graph Semantic and Structural Learning [54.97668931176513]
  This paper reveals that local client distortion is brought by both node-level semantics and graph-level structure. We postulate that a well-structural graph neural network possesses similarity for neighbors due to the inherent adjacency relationships. We transform the adjacency relationships into the similarity distribution and leverage the global model to distill the relation knowledge into the local model.
  arXiv  Detail & Related papers  (2024-06-27T07:08:28Z)
• Bayesian Detection of Mesoscale Structures in Pathway Data on Graphs [0.0]
  mesoscale structures are integral part of the abstraction and analysis of complex systems. They can represent communities in social or citation networks, roles in corporate interactions, or core-periphery structures in transportation networks. We derive a Bayesian approach that simultaneously models the optimal partitioning of nodes in groups and the optimal higher-order network dynamics.
  arXiv  Detail & Related papers  (2023-01-16T12:45:33Z)
• DeHIN: A Decentralized Framework for Embedding Large-scale Heterogeneous Information Networks [64.62314068155997]
  We present textitDecentralized Embedding Framework for Heterogeneous Information Network (DeHIN) in this paper. DeHIN presents a context preserving partition mechanism that innovatively formulates a large HIN as a hypergraph. Our framework then adopts a decentralized strategy to efficiently partition HINs by adopting a tree-like pipeline.
  arXiv  Detail & Related papers  (2022-01-08T04:08:36Z)
• A Unified Architecture of Semantic Segmentation and Hierarchical Generative Adversarial Networks for Expression Manipulation [52.911307452212256]
  We develop a unified architecture of semantic segmentation and hierarchical GANs. A unique advantage of our framework is that on forward pass the semantic segmentation network conditions the generative model. We evaluate our method on two challenging facial expression translation benchmarks, AffectNet and RaFD, and a semantic segmentation benchmark, CelebAMask-HQ.
  arXiv  Detail & Related papers  (2021-12-08T22:06:31Z)
• Local, global and scale-dependent node roles [3.1473798197405944]
  This paper re-examines the concept of node equivalences like structural equivalence or automorphic equivalence. We show how already "shallow" roles of depth 3 or 4 carry sufficient information to perform node classification tasks with high accuracy.
  arXiv  Detail & Related papers  (2021-05-26T14:54:26Z)
• SALA: Soft Assignment Local Aggregation for Parameter Efficient 3D Semantic Segmentation [65.96170587706148]
  We focus on designing a point local aggregation function that yields parameter efficient networks for 3D point cloud semantic segmentation. We explore the idea of using learnable neighbor-to-grid soft assignment in grid-based aggregation functions.
  arXiv  Detail & Related papers  (2020-12-29T20:16:37Z)
• Inductive Graph Embeddings through Locality Encodings [0.42970700836450487]
  We look at the problem of finding inductive network embeddings in large networks without domain-dependent node/edge attributes. We propose to use a set of basic predefined local encodings as the basis of a learning algorithm. This method achieves state-of-the-art performance in tasks such as role detection, link prediction and node classification.
  arXiv  Detail & Related papers  (2020-09-26T13:09:11Z)
• Graph Prototypical Networks for Few-shot Learning on Attributed Networks [72.31180045017835]
  We propose a graph meta-learning framework -- Graph Prototypical Networks (GPN) GPN is able to perform textitmeta-learning on an attributed network and derive a highly generalizable model for handling the target classification task.
  arXiv  Detail & Related papers  (2020-06-23T04:13:23Z)
• Unsupervised Differentiable Multi-aspect Network Embedding [52.981277420394846]
  We propose a novel end-to-end framework for multi-aspect network embedding, called asp2vec. Our proposed framework can be readily extended to heterogeneous networks.
  arXiv  Detail & Related papers  (2020-06-07T19:26:20Z)
• Adversarial Deep Network Embedding for Cross-network Node Classification [27.777464531860325]
  Cross-network node classification leverages the abundant labeled nodes from a source network to help classify unlabeled nodes in a target network. In this paper, we propose an adversarial cross-network deep network embedding model to integrate adversarial domain adaptation with deep network embedding. The proposed ACDNE model achieves the state-of-the-art performance in cross-network node classification.
  arXiv  Detail & Related papers  (2020-02-18T04:30:43Z)
• A Block-based Generative Model for Attributed Networks Embedding [42.00826538556588]
  We propose a block-based generative model for attributed network embedding from a probability perspective. We use a neural network to characterize the nonlinearity between node embeddings and node attributes. The results show that our proposed method consistently outperforms state-of-the-art embedding methods for both clustering and classification tasks.
  arXiv  Detail & Related papers  (2020-01-06T03:44: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.