Unsupervised Framework for Evaluating and Explaining Structural Node Embeddings of Graphs

• URL: http://arxiv.org/abs/2306.10770v1
• Date: Mon, 19 Jun 2023 08:27:02 GMT
• Title: Unsupervised Framework for Evaluating and Explaining Structural Node Embeddings of Graphs
• Authors: Ashkan Dehghan, Kinga Siuta, Agata Skorupka, Andrei Betlen, David Miller, Bogumil Kaminski, Pawel Pralat
• Abstract summary: An embedding is a mapping from a set of nodes of a network into a real vector space. For classical embeddings there exists a framework which helps data scientists to identify (in an unsupervised way) a few embeddings that are worth further investigation. In this paper we propose a framework for unsupervised ranking of structural graph embeddings.
• Score: 2.539920413471809
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: An embedding is a mapping from a set of nodes of a network into a real vector space. Embeddings can have various aims like capturing the underlying graph topology and structure, node-to-node relationship, or other relevant information about the graph, its subgraphs or nodes themselves. A practical challenge with using embeddings is that there are many available variants to choose from. Selecting a small set of most promising embeddings from the long list of possible options for a given task is challenging and often requires domain expertise. Embeddings can be categorized into two main types: classical embeddings and structural embeddings. Classical embeddings focus on learning both local and global proximity of nodes, while structural embeddings learn information specifically about the local structure of nodes' neighbourhood. For classical node embeddings there exists a framework which helps data scientists to identify (in an unsupervised way) a few embeddings that are worth further investigation. Unfortunately, no such framework exists for structural embeddings. In this paper we propose a framework for unsupervised ranking of structural graph embeddings. The proposed framework, apart from assigning an aggregate quality score for a structural embedding, additionally gives a data scientist insights into properties of this embedding. It produces information which predefined node features the embedding learns, how well it learns them, and which dimensions in the embedded space represent the predefined node features. Using this information the user gets a level of explainability to an otherwise complex black-box embedding algorithm.

Related papers

• Decoupled Subgraph Federated Learning [57.588938805581044]
  We address the challenge of federated learning on graph-structured data distributed across multiple clients. We present a novel framework for this scenario, named FedStruct, that harnesses deep structural dependencies. We validate the effectiveness of FedStruct through experimental results conducted on six datasets for semi-supervised node classification.
  arXiv  Detail & Related papers  (2024-02-29T13:47:23Z)
• Local Graph Embeddings Based on Neighbors Degree Frequency of Nodes [0.0]
  We propose a strategy for graph machine learning and network analysis by defining certain local features and vector representations of nodes. By extending the notion of the degree of a node via Breath-First Search, a general family of bf centrality functions is defined. We show that centrality and closeness can be learned by applying deep learning to these local features.
  arXiv  Detail & Related papers  (2022-07-30T07:07:30Z)
• SHGNN: Structure-Aware Heterogeneous Graph Neural Network [77.78459918119536]
  This paper proposes a novel Structure-Aware Heterogeneous Graph Neural Network (SHGNN) to address the above limitations. We first utilize a feature propagation module to capture the local structure information of intermediate nodes in the meta-path. Next, we use a tree-attention aggregator to incorporate the graph structure information into the aggregation module on the meta-path. Finally, we leverage a meta-path aggregator to fuse the information aggregated from different meta-paths.
  arXiv  Detail & Related papers  (2021-12-12T14:18:18Z)
• A Multi-purposed Unsupervised Framework for Comparing Embeddings of Undirected and Directed Graphs [0.0]
  We extend the framework for evaluating graph embeddings that was recently introduced by the authors. A good embedding should capture the underlying graph topology and structure, node-to-node relationship, and other relevant information. The framework is flexible, scalable, and can deal with undirected/directed, weighted/unweighted graphs.
  arXiv  Detail & Related papers  (2021-11-30T20:20:30Z)
• Graph Embedding with Hierarchical Attentive Membership [35.998704625736394]
  A latent hierarchical grouping of nodes exists in a global perspective, where each node manifests its membership to a specific group. Most prior works ignore such latent groups and nodes' membership to different groups, not to mention the hierarchy, when modeling the neighborhood structure. We propose a novel hierarchical attentive membership model for graph embedding, where the latent memberships for each node are dynamically discovered based on its neighboring context.
  arXiv  Detail & Related papers  (2021-10-31T22:00:48Z)
• Node Proximity Is All You Need: Unified Structural and Positional Node and Graph Embedding [18.25557372049711]
  We present PhUSION, a proximity-based unified framework for computing structural and positional node embeddings. By aggregating the PhUSION node embeddings, we obtain graph-level features that model information lost by previous graph feature learning and kernel methods.
  arXiv  Detail & Related papers  (2021-02-26T16:48:39Z)
• Hierarchical Graph Capsule Network [78.4325268572233]
  We propose hierarchical graph capsule network (HGCN) that can jointly learn node embeddings and extract graph hierarchies. To learn the hierarchical representation, HGCN characterizes the part-whole relationship between lower-level capsules (part) and higher-level capsules (whole)
  arXiv  Detail & Related papers  (2020-12-16T04:13:26Z)
• HOSE-Net: Higher Order Structure Embedded Network for Scene Graph Generation [20.148175528691905]
  This paper presents a novel structure-aware embedding-to-classifier(SEC) module to incorporate both local and global structural information of relationships into the output space. We also propose a hierarchical semantic aggregation(HSA) module to reduce the number of subspaces by introducing higher order structural information. The proposed HOSE-Net achieves the state-of-the-art performance on two popular benchmarks of Visual Genome and VRD.
  arXiv  Detail & Related papers  (2020-08-12T07:58:13Z)
• node2coords: Graph Representation Learning with Wasserstein Barycenters [59.07120857271367]
  We introduce node2coords, a representation learning algorithm for graphs. It learns simultaneously a low-dimensional space and coordinates for the nodes in that space. Experimental results demonstrate that the representations learned with node2coords are interpretable.
  arXiv  Detail & Related papers  (2020-07-31T13:14:25Z)
• Graph Neural Networks with Composite Kernels [60.81504431653264]
  We re-interpret node aggregation from the perspective of kernel weighting. We present a framework to consider feature similarity in an aggregation scheme. We propose feature aggregation as the composition of the original neighbor-based kernel and a learnable kernel to encode feature similarities in a feature space.
  arXiv  Detail & Related papers  (2020-05-16T04:44:29Z)
• Graph Inference Learning for Semi-supervised Classification [50.55765399527556]
  We propose a Graph Inference Learning framework to boost the performance of semi-supervised node classification. For learning the inference process, we introduce meta-optimization on structure relations from training nodes to validation nodes. Comprehensive evaluations on four benchmark datasets demonstrate the superiority of our proposed GIL when compared against state-of-the-art methods.
  arXiv  Detail & Related papers  (2020-01-17T02:52:30Z)

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.