Weighted Graph Classification by Self-Aligned Graph Convolutional Networks Using Self-Generated Structural Features

  • Xuefei Zheng
  • Min Zhang
  • Jiawei Hu
  • Weifu ChenEmail author
  • Guocan Feng
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11257)


Directed weighted graphs are important graph data. The weights and directions of the edges carry rich information which can be utilized in many areas. For instance, in a cashflow network, the direction and amount of a transfer can be used to detect social ties or criminal organizations. Hence it is important to study the weighted graph classification problems. In this paper, we present a graph classification algorithm called Self-Aligned graph convolutional network (SA-GCN) for weighted graph classification. SA-GCN first normalizes a given graph so that graphs are trimmed and aligned in correspondence. Following that structural features are extracted from the edge weights and graph structures. And finally the model is trained in an adversarial way to make the model more robust. Experiments on benchmark datasets showed that the proposed model could achieve competitive results and outperformed some popular state-of-the-art graph classification methods.


Graph classification Graph convolutional networks Graph normalization Structural features Adversarial training 



This work is partially supported by the NSFC under grants Nos. 61673018, 61272338, 61703443 and Guangzhou Science and Technology Founding Committee under grant No. 201804010255 and Guangdong Province Key Laboratory of Computer Science.


  1. 1.
    Abadi, M., et al.: TensorFlow: a system for large-scale machine learning. In: OSDI 2016, pp. 265–283 (2016)Google Scholar
  2. 2.
    Belkin, M., Niyogi, P.: Laplacian eigenmaps for dimensionality reduction and data representation. Neural Comput. 15(6), 1373–1396 (2003)CrossRefGoogle Scholar
  3. 3.
    Bruna, J., Zaremba, W., Szlam, A., Lecun, Y.: Spectral networks and locally connected networks on graphs. In: International Conference on Learning Representations (2014)Google Scholar
  4. 4.
    Defferrard, M., Bresson, X., Vandergheynst, P.: Convolutional neural networks on graphs with fast localized spectral filtering. In: Advances in Neural Information Processing Systems, pp. 3844–3852 (2016)Google Scholar
  5. 5.
    Diestel, R.: Graph Theory, 3rd edn. Springer, Heidelberg (2006)zbMATHGoogle Scholar
  6. 6.
    Goodfellow, I., Shlens, J., Szegedy, C.: Explaining and harnessing adversarial examples (2015)Google Scholar
  7. 7.
    LeCun, Y., Bottou, L., Bengio, Y., Haffner, P.: Gradient-based learning applied to document recognition. Proc. IEEE 86(11), 2278–2324 (1998)CrossRefGoogle Scholar
  8. 8.
    LeCun, Y., Bengio, Y., Hinton, G.: Deep learning. Nature 521, 436–444 (2015)CrossRefGoogle Scholar
  9. 9.
    McKay, B., Piperno, A.: Practical graph isomorphism, II. J. Symb. Comput. 60, 94–112 (2014)MathSciNetCrossRefGoogle Scholar
  10. 10.
    Newman, M.: Networks: An Introduction. Oxford University Press, Oxford (2010)CrossRefGoogle Scholar
  11. 11.
    Niepert, M., Ahmed, M., Kutzkov, K.: Learning convolutional neural networks for graphs. In: Proceedings of the 33rd International Conference on Machine Learning, pp. 2014–2023 (2016)Google Scholar
  12. 12.
    Page, L., Brin, S., Motwani, R., Winograd, T.: The PageRank citation ranking: bringing order to the web. Technical report, Stanford InfoLab (1999)Google Scholar
  13. 13.
    Shervashidze, N., Borgwardt, K.M.: Fast subtree kernels on graphs. In: Advances in Neural Information Processing Systems, pp. 1660–1668 (2009)Google Scholar
  14. 14.
    Shi, J., Malik, J.: Normalized cuts and image segmentation. IEEE Trans. Pattern Anal. Mach. Intell. 22(8), 888–905 (2000)CrossRefGoogle Scholar
  15. 15.
    Vapnik, V.: Statistical Learning Theory. Wiley, New York (1998)zbMATHGoogle Scholar
  16. 16.
    Vishwanathan, S., Schraudolph, N., Kondor, R., Borgwardt, K.: Graph kernels. J. Mach. Learn. Res. 11(Apr), 1201–1242 (2010)MathSciNetzbMATHGoogle Scholar
  17. 17.
    Von Luxburg, U.: A tutorial on spectral clustering. Stat. Comput. 17(4), 395–416 (2007)MathSciNetCrossRefGoogle Scholar
  18. 18.
    Weisfeiler, B., Lehman, A.A.: A reduction of a graph to a canonical form and an algebra arising during this reduction. Nauchno-Tech. Informatsiya 2(9), 12–16 (1968)Google Scholar
  19. 19.
    Yanardag, P., Vishwanathan, S.: Deep graph kernels. In: Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1365–1374. ACM (2015)Google Scholar
  20. 20.
    Zhang, M., Cui, Z., Neumann, M., Chen, Y.: An end-to-end deep learning architecture for graph classification (2018)Google Scholar

Copyright information

© Springer Nature Switzerland AG 2018

Authors and Affiliations

  • Xuefei Zheng
    • 1
    • 2
  • Min Zhang
    • 1
  • Jiawei Hu
    • 2
  • Weifu Chen
    • 1
    Email author
  • Guocan Feng
    • 1
  1. 1.School of MathematicsSun Yat-sen UniversityGuangzhouChina
  2. 2.Tencent-CDG-FITShenzhenChina

Personalised recommendations