Graph Attribute Aggregation Network with Progressive Margin Folding

Penghui Sun, Jingwei Qu, Xiaoqing Lyu, Haibin Ling, Zhi TangarXiv 2019 · arXiv

Introduction

In Graph Convolutional Neural Networks (GCNNs), the "convolution" operation—extracting features from nodes and their neighborhoods—has seen significant advancement. However, the "aggregation" or pooling phase, which reduces the graph to higher levels of abstraction, remains a challenge. Standard pooling methods often treat all nodes equally, which can lead to the premature destruction of critical local structures, such as molecular scaffolds or rings, especially in complex chemical tasks.

The GAAN Architecture

To address these limitations, the Graph Attribute Aggregation Network (GAAN) introduces a structure-aware approach to graph learning. The architecture consists of feature optimization, specialized convolution layers, and a novel pooling strategy.

The GAAN architecture overview, highlighting the GAC and PMF layers.

Graph Attribute Convolution (GAC)

The first major component is the Graph Attribute Convolution (GAC) layer. Unlike standard convolutions that primarily focus on vertex features, GAC explicitly integrates both vertex and edge attributes. By categorizing vertices and edges into groups based on intrinsic properties (e.g., atom type or bond type), the model applies specific learnable weights to each category, ensuring that the rich chemical information of the graph is preserved during feature extraction.

Progressive Margin Folding (PMF)

The core innovation of GAAN is Progressive Margin Folding (PMF). Instead of traditional downsampling, PMF iteratively "folds" the outer margin elements of a graph into its interior.

Step-by-step illustration of the Progressive Margin Folding (PMF) process on a molecular graph.

The Folding Mechanism

PMF distinguishes between "internal" and "margin" nodes. Margin nodes, such as leaf nodes with a degree of one, have their feature information mathematically folded into their internal neighbors using learnable parameters. This ensures that information is preserved rather than pruned.

Structural Awareness

A key feature of PMF is its respect for chemical reality. The algorithm identifies cycles (rings) and protects them from collapse until they have only a single connection remaining to the rest of the graph. At that point, the ring is collapsed into a single "surrogate" vertex. This hierarchical abstraction allows the network to maintain the integrity of important functional groups throughout the learning process.

Experimental Evaluation

The GAAN model was evaluated on eight public molecular datasets from the MoleculeNet benchmark, covering both physiology (classification) and physical chemistry (regression).

Key Results

  • Classification: On the ClinTox dataset, GAAN achieved a Mean ROC-AUC of 0.8877, outperforming other state-of-the-art models like AGCN (0.8678).
  • Regression: On the ESOL dataset, GAAN reached a Root Mean Square Error (RMSE) of 0.2936, showing significant improvement over the Neural Fingerprint (NFP) model (0.4955).

The results indicate that GAAN is particularly effective for small molecular graphs where every node and edge contributes significantly to the overall property.

Conclusion

By shifting the focus from simple pruning to information-preserving "folding," the Graph Attribute Aggregation Network offers a more nuanced way to handle graph data. PMF ensures that critical structural motifs are maintained, leading to superior performance in chemical property prediction and drug discovery tasks. Future work may involve extending these techniques to non-chemical domains, such as social network analysis.

Summary updated

Abstract

Graph convolutional neural networks (GCNNs) have been attracting increasing research attention due to its great potential in inference over graph structures. However, insufficient effort has been devoted to the aggregation methods between different convolution graph layers. In this paper, we introduce a graph attribute aggregation network (GAAN) architecture. Different from the conventional pooling operations, a graph-transformation-based aggregation strategy, progressive margin folding, PMF, is proposed for integrating graph features. By distinguishing internal and margin elements, we provide an approach for implementing the folding iteratively. And a mechanism is also devised for preserving the local structures during progressively folding. In addition, a hypergraph-based representation is introduced for transferring the aggregated information between different layers. Our experiments applied to the public molecule datasets demonstrate that the proposed GAAN outperforms the existing GCNN models with significant effectiveness.
BibTeX
@misc{sun2019graph,
  author = {Penghui Sun and Jingwei Qu and Xiaoqing Lyu and Haibin Ling and Zhi Tang},
  title = {{Graph Attribute Aggregation Network with Progressive Margin Folding}},
  year = {2019},
  eprint = {1905.05347},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/1905.05347},
}
Figure