返回
M-Evolve: Structural-Mapping-Based Data Augmentation for Graph Classification
DOI:10.1109/TNSE.2020.3032950.png)
摘要
En 中文
Graph classification, which aims to identify the category labels of graphs, plays a significant role in drug classification, toxicity detection, protein analysis etc. However, the limitation of scale in the benchmark datasets makes it easy for graph classification models to fall into over-fitting and undergeneralization. To improve this, we introduce data augmentation on graphs (i.e. graph augmentation) and present four methods: random mapping, vertex-similarity mapping, motif-random mapping and motif-similarity mapping, to generate more weakly labeled data for small-scale benchmark datasets via heuristic transformation of graph structures. Furthermore, we propose a generic model evolution framework, named M-Evolve, which combines graph augmentation, data filtration and model retraining to optimize pre-trained graph classifiers. Experiments on six benchmark datasets demonstrate that the proposed framework helps existing graph classification models alleviate over-fitting and undergeneralization in the training on small-scale benchmark datasets, which successfully yields an average improvement of 3-13% accuracy on graph classification tasks.
Keyword:
Kernel
Data models
Benchmark testing
Brain modeling
Reliability
Training
Task analysis
Graph classification
Data augmentation
Model evolution
Vertex similarity
Motif
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
I
IF:
7.9
论文数:
2.6K
被引数:
10.0K
机构
引用论文
The Resource Hazards Model for the Critical Infrastructure of the State Emergency Management Process
An Unsupervised Embedding Learning Feature Representation Scheme for Network Big Data Analysis一种面向网络大数据分析的无监督嵌入学习特征表示方案

