Multi-Scale Aggregation Graph Neural Networks Based on Feature Similarity for Semi-Supervised Learning.

Area of Science:

• Graph Neural Networks
• Machine Learning
• Data Mining

Background:

• Extracting meaningful data from graph-structured data is crucial across diverse fields like social networks and knowledge graphs.
• The increasing availability of structured data necessitates advanced mining and learning techniques.
• Current graph analysis methods face challenges in effectively utilizing feature information for semi-supervised learning.

Purpose of the Study:

• To propose a novel graph neural network model, the Multi-scale Aggregation Graph Neural Network (MAGN), for semi-supervised learning on graph-structured data.
• To enhance the representation ability of graph neural networks through multi-scale neighborhood aggregation.
• To provide a simple and general method for learning from graph data with limited labeled examples.

Main Methods:

• Constructing a similarity matrix based on feature similarity between adjacent nodes.
• Generating feature extractors using the similarity matrix for multi-scale feature propagation.
• Aggregating multi-scale propagated features using a mean-pooling operation.

Main Results:

• The proposed MAGN model demonstrates competitive performance on various open benchmark datasets.
• MAGN effectively improves model representation ability via multi-scale neighborhood aggregation.
• The method achieves strong results in semi-supervised learning scenarios with minimal labeled data.

Conclusions:

• MAGN offers a powerful and versatile approach to semi-supervised learning for graph-structured data.
• The feature similarity-based aggregation strategy enhances the model's capacity to capture complex graph patterns.
• MAGN presents a promising alternative to existing graph neural network architectures for data mining applications.