Representation Learning of Graphs Using Graph Convolutional Multilayer Networks Based on Motifs

• URL: http://arxiv.org/abs/2007.15838v1
• Date: Fri, 31 Jul 2020 04:18:20 GMT
• Title: Representation Learning of Graphs Using Graph Convolutional Multilayer Networks Based on Motifs
• Authors: Xing Li, Wei Wei, Xiangnan Feng, Xue Liu, Zhiming Zheng
• Abstract summary: mGCMN is a novel framework which utilizes node feature information and the higher order local structure of the graph. It will greatly improve the learning efficiency of the graph neural network and promote a brand-new learning mode establishment.
• Score: 17.823543937167848
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The graph structure is a commonly used data storage mode, and it turns out that the low-dimensional embedded representation of nodes in the graph is extremely useful in various typical tasks, such as node classification, link prediction , etc. However, most of the existing approaches start from the binary relationship (i.e., edges) in the graph and have not leveraged the higher order local structure (i.e., motifs) of the graph. Here, we propose mGCMN -- a novel framework which utilizes node feature information and the higher order local structure of the graph to effectively generate node embeddings for previously unseen data. Through research we have found that different types of networks have different key motifs. And the advantages of our method over the baseline methods have been demonstrated in a large number of experiments on citation network and social network datasets. At the same time, a positive correlation between increase of the classification accuracy and the clustering coefficient is revealed. It is believed that using high order structural information can truly manifest the potential of the network, which will greatly improve the learning efficiency of the graph neural network and promote a brand-new learning mode establishment.

Related papers

• Harnessing Collective Structure Knowledge in Data Augmentation for Graph Neural Networks [25.12261412297796]
  Graph neural networks (GNNs) have achieved state-of-the-art performance in graph representation learning. We propose a novel approach, namely collective structure knowledge-augmented graph neural network (CoS-GNN)
  arXiv  Detail & Related papers  (2024-05-17T08:50:00Z)
• GTAGCN: Generalized Topology Adaptive Graph Convolutional Networks [5.166599023304314]
  We derive a hybrid approach based on two established techniques as generalized aggregation networks and topology adaptive graph convolution networks. Results are at par with literature results and better for handwritten strokes as sequenced data, where graph structures have not been explored.
  arXiv  Detail & Related papers  (2024-03-22T10:02:13Z)
• DGNN: Decoupled Graph Neural Networks with Structural Consistency between Attribute and Graph Embedding Representations [62.04558318166396]
  Graph neural networks (GNNs) demonstrate a robust capability for representation learning on graphs with complex structures. A novel GNNs framework, dubbed Decoupled Graph Neural Networks (DGNN), is introduced to obtain a more comprehensive embedding representation of nodes. Experimental results conducted on several graph benchmark datasets verify DGNN's superiority in node classification task.
  arXiv  Detail & Related papers  (2024-01-28T06:43:13Z)
• GNN-LoFI: a Novel Graph Neural Network through Localized Feature-based Histogram Intersection [51.608147732998994]
  Graph neural networks are increasingly becoming the framework of choice for graph-based machine learning. We propose a new graph neural network architecture that substitutes classical message passing with an analysis of the local distribution of node features.
  arXiv  Detail & Related papers  (2024-01-17T13:04:23Z)
• Supervised Contrastive Learning with Structure Inference for Graph Classification [5.276232626689567]
  We propose a graph neural network based on supervised contrastive learning and structure inference for graph classification. With the integration of label information, the one-vs-many contrastive learning can be extended to a many-vs-many setting. Experiment results show the effectiveness of the proposed method compared with recent state-of-the-art methods.
  arXiv  Detail & Related papers  (2022-03-15T07:18:46Z)
• A Robust and Generalized Framework for Adversarial Graph Embedding [73.37228022428663]
  We propose a robust framework for adversarial graph embedding, named AGE. AGE generates the fake neighbor nodes as the enhanced negative samples from the implicit distribution. Based on this framework, we propose three models to handle three types of graph data.
  arXiv  Detail & Related papers  (2021-05-22T07:05:48Z)
• Representation Learning of Reconstructed Graphs Using Random Walk Graph Convolutional Network [12.008472517000651]
  We propose wGCN -- a novel framework that utilizes random walk to obtain the node-specific mesoscopic structures of the graph. We believe that combining high-order local structural information can more efficiently explore the potential of the network.
  arXiv  Detail & Related papers  (2021-01-02T10:31:14Z)
• Co-embedding of Nodes and Edges with Graph Neural Networks [13.020745622327894]
  Graph embedding is a way to transform and encode the data structure in high dimensional and non-Euclidean feature space. CensNet is a general graph embedding framework, which embeds both nodes and edges to a latent feature space. Our approach achieves or matches the state-of-the-art performance in four graph learning tasks.
  arXiv  Detail & Related papers  (2020-10-25T22:39:31Z)
• GCC: Graph Contrastive Coding for Graph Neural Network Pre-Training [62.73470368851127]
  Graph representation learning has emerged as a powerful technique for addressing real-world problems. We design Graph Contrastive Coding -- a self-supervised graph neural network pre-training framework. We conduct experiments on three graph learning tasks and ten graph datasets.
  arXiv  Detail & Related papers  (2020-06-17T16:18:35Z)
• Progressive Graph Convolutional Networks for Semi-Supervised Node Classification [97.14064057840089]
  Graph convolutional networks have been successful in addressing graph-based tasks such as semi-supervised node classification. We propose a method to automatically build compact and task-specific graph convolutional networks.
  arXiv  Detail & Related papers  (2020-03-27T08:32:16Z)
• Tensor Graph Convolutional Networks for Multi-relational and Robust Learning [74.05478502080658]
  This paper introduces a tensor-graph convolutional network (TGCN) for scalable semi-supervised learning (SSL) from data associated with a collection of graphs, that are represented by a tensor. The proposed architecture achieves markedly improved performance relative to standard GCNs, copes with state-of-the-art adversarial attacks, and leads to remarkable SSL performance over protein-to-protein interaction networks.
  arXiv  Detail & Related papers  (2020-03-15T02:33:21Z)

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.