TY - GEN
T1 - Data Augmentation for Graph Convolutional Network on Semi-supervised Classification
AU - Tang, Zhengzheng
AU - Qiao, Ziyue
AU - Hong, Xuehai
AU - Wang, Yang
AU - Dharejo, Fayaz Ali
AU - Zhou, Yuanchun
AU - Du, Yi
N1 - Funding Information:
Acknowledgments. This work is supported in part by the Natural Science Foundation of China under Grant No. 92046017, the Natural Science Foundation of China under Grant No. 61836013, Beijing Natural Science Foundation (4212030).
Publisher Copyright:
© 2021, Springer Nature Switzerland AG.
PY - 2021
Y1 - 2021
N2 - Data augmentation aims to generate new and synthetic features from the original data, which can identify a better representation of data and improve the performance and generalizability of downstream tasks. However, data augmentation for graph-based models remains a challenging problem, as graph data is more complex than traditional data, which consists of two features with different properties: graph topology and node attributes. In this paper, we study the problem of graph data augmentation for Graph Convolutional Network (GCN) in the context of improving the node embeddings for semi-supervised node classification. Specifically, we conduct cosine similarity based cross operation on the original features to create new graph features, including new node attributes and new graph topologies, and we combine them as new pairwise inputs for specific GCNs. Then, we propose an attentional integrating model to weighted sum the hidden node embeddings encoded by these GCNs into the final node embeddings. We also conduct a disparity constraint on these hidden node embeddings when training to ensure that non-redundant information is captured from different features. Experimental results on five real-world datasets show that our method improves the classification accuracy with a clear margin (+2.5%–+84.2%) than the original GCN model.
AB - Data augmentation aims to generate new and synthetic features from the original data, which can identify a better representation of data and improve the performance and generalizability of downstream tasks. However, data augmentation for graph-based models remains a challenging problem, as graph data is more complex than traditional data, which consists of two features with different properties: graph topology and node attributes. In this paper, we study the problem of graph data augmentation for Graph Convolutional Network (GCN) in the context of improving the node embeddings for semi-supervised node classification. Specifically, we conduct cosine similarity based cross operation on the original features to create new graph features, including new node attributes and new graph topologies, and we combine them as new pairwise inputs for specific GCNs. Then, we propose an attentional integrating model to weighted sum the hidden node embeddings encoded by these GCNs into the final node embeddings. We also conduct a disparity constraint on these hidden node embeddings when training to ensure that non-redundant information is captured from different features. Experimental results on five real-world datasets show that our method improves the classification accuracy with a clear margin (+2.5%–+84.2%) than the original GCN model.
KW - Data augmentation
KW - Graph Convolutional Network
KW - Semi-supervised classification
UR - http://www.scopus.com/inward/record.url?scp=85115100328&partnerID=8YFLogxK
U2 - 10.1007/978-3-030-85899-5_3
DO - 10.1007/978-3-030-85899-5_3
M3 - Conference contribution
AN - SCOPUS:85115100328
SN - 9783030858988
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 33
EP - 48
BT - Web and Big Data - 5th International Joint Conference, APWeb-WAIM 2021, Proceedings
A2 - U, Leong Hou
A2 - Spaniol, Marc
A2 - Sakurai, Yasushi
A2 - Chen, Junying
PB - Springer Science and Business Media Deutschland GmbH
T2 - 5th International Joint Conference on Asia-Pacific Web and Web-Age Information Management, APWeb-WAIM 2021
Y2 - 23 August 2021 through 25 August 2021
ER -