Dynamic Labeling for Unlabeled Graph Neural Networks

• URL: http://arxiv.org/abs/2102.11485v1
• Date: Tue, 23 Feb 2021 04:30:35 GMT
• Title: Dynamic Labeling for Unlabeled Graph Neural Networks
• Authors: Zeyu Sun, Wenjie Zhang, Lili Mou, Qihao Zhu, Yingfei Xiong, Lu Zhang
• Abstract summary: Graph neural networks (GNNs) rely on node embeddings to represent a node as a vector by its identity, type, or content. Existing GNNs either assign random labels to nodes or assign one embedding to all nodes, which fails to distinguish one node from another. In this paper, we analyze the limitation of existing approaches in two types of classification tasks, graph classification and node classification.
• Score: 34.65037955481084
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Existing graph neural networks (GNNs) largely rely on node embeddings, which represent a node as a vector by its identity, type, or content. However, graphs with unlabeled nodes widely exist in real-world applications (e.g., anonymized social networks). Previous GNNs either assign random labels to nodes (which introduces artefacts to the GNN) or assign one embedding to all nodes (which fails to distinguish one node from another). In this paper, we analyze the limitation of existing approaches in two types of classification tasks, graph classification and node classification. Inspired by our analysis, we propose two techniques, Dynamic Labeling and Preferential Dynamic Labeling, that satisfy desired properties statistically or asymptotically for each type of the task. Experimental results show that we achieve high performance in various graph-related tasks.

Related papers

• Learning on Graphs with Out-of-Distribution Nodes [33.141867473074264]
  Graph Neural Networks (GNNs) are state-of-the-art models for performing prediction tasks on graphs. This work defines the problem of graph learning with out-of-distribution nodes. We propose Out-of-Distribution Graph Attention Network (OODGAT), a novel GNN model which explicitly models the interaction between different kinds of nodes.
  arXiv  Detail & Related papers  (2023-08-13T08:10:23Z)
• Contrastive Meta-Learning for Few-shot Node Classification [54.36506013228169]
  Few-shot node classification aims to predict labels for nodes on graphs with only limited labeled nodes as references. We create a novel contrastive meta-learning framework on graphs, named COSMIC, with two key designs.
  arXiv  Detail & Related papers  (2023-06-27T02:22:45Z)
• Seq-HGNN: Learning Sequential Node Representation on Heterogeneous Graph [57.2953563124339]
  We propose a novel heterogeneous graph neural network with sequential node representation, namely Seq-HGNN. We conduct extensive experiments on four widely used datasets from Heterogeneous Graph Benchmark (HGB) and Open Graph Benchmark (OGB)
  arXiv  Detail & Related papers  (2023-05-18T07:27:18Z)
• Improving Graph Neural Networks on Multi-node Tasks with Labeling Tricks [14.41064333206723]
  We propose textlabeling trick, which first labels nodes in the graph according to their relationships with the target node set before applying a GNN. Our work explains the superior performance of previous node-labeling-based methods and establishes a theoretical foundation for using GNNs for multi-node representation learning.
  arXiv  Detail & Related papers  (2023-04-20T04:03:40Z)
• Semi-Supervised Hierarchical Graph Classification [54.25165160435073]
  We study the node classification problem in the hierarchical graph where a 'node' is a graph instance. We propose the Hierarchical Graph Mutual Information (HGMI) and present a way to compute HGMI with theoretical guarantee. We demonstrate the effectiveness of this hierarchical graph modeling and the proposed SEAL-CI method on text and social network data.
  arXiv  Detail & Related papers  (2022-06-11T04:05:29Z)
• Label-Enhanced Graph Neural Network for Semi-supervised Node Classification [32.64730237473914]
  We present a label-enhanced learning framework for Graph Neural Networks (GNNs) It first models each label as a virtual center for intra-class nodes and then jointly learns the representations of both nodes and labels. Our approach could not only smooth the representations of nodes belonging to the same class, but also explicitly encode the label semantics into the learning process of GNNs.
  arXiv  Detail & Related papers  (2022-05-31T09:48:47Z)
• Label Propagation across Graphs: Node Classification using Graph Neural Tangent Kernels [12.445026956430826]
  Graph neural networks (GNNs) have achieved superior performance on node classification tasks. Our work considers a challenging inductive setting where a set of labeled graphs are available for training while the unlabeled target graph is completely separate. Under the implicit assumption that the testing and training graphs come from similar distributions, our goal is to develop a labeling function that generalizes to unobserved connectivity structures.
  arXiv  Detail & Related papers  (2021-10-07T19:42:35Z)
• On Positional and Structural Node Features for Graph Neural Networks on Non-attributed Graphs [12.213147724959628]
  Graph neural networks (GNNs) have been widely used in various graph-related problems such as node classification and graph classification. It is not well understood how GNNs work without natural node features, especially regarding the various ways to construct artificial ones. In this paper, we point out the two types of artificial node features,i.e., positional and structural node features, and provide insights on why each of them is more appropriate for certain tasks.
  arXiv  Detail & Related papers  (2021-07-03T20:37:26Z)
• Inverse Graph Identification: Can We Identify Node Labels Given Graph Labels? [89.13567439679709]
  Graph Identification (GI) has long been researched in graph learning and is essential in certain applications. This paper defines a novel problem dubbed Inverse Graph Identification (IGI) We propose a simple yet effective method that makes the node-level message passing process using Graph Attention Network (GAT) under the protocol of GI.
  arXiv  Detail & Related papers  (2020-07-12T12:06:17Z)
• Sequential Graph Convolutional Network for Active Learning [53.99104862192055]
  We propose a novel pool-based Active Learning framework constructed on a sequential Graph Convolution Network (GCN) With a small number of randomly sampled images as seed labelled examples, we learn the parameters of the graph to distinguish labelled vs unlabelled nodes. We exploit these characteristics of GCN to select the unlabelled examples which are sufficiently different from labelled ones.
  arXiv  Detail & Related papers  (2020-06-18T00:55:10Z)
• Structural Temporal Graph Neural Networks for Anomaly Detection in Dynamic Graphs [54.13919050090926]
  We propose an end-to-end structural temporal Graph Neural Network model for detecting anomalous edges in dynamic graphs. In particular, we first extract the $h$-hop enclosing subgraph centered on the target edge and propose the node labeling function to identify the role of each node in the subgraph. Based on the extracted features, we utilize Gated recurrent units (GRUs) to capture the temporal information for anomaly detection.
  arXiv  Detail & Related papers  (2020-05-15T09:17:08Z)

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.