skip to main content
10.1145/3534678.3542602acmconferencesArticle/Chapter ViewAbstractPublication PageskddConference Proceedingsconference-collections
abstract
Public Access

Toward Graph Minimally-Supervised Learning

Published:14 August 2022Publication History

ABSTRACT

To model graph-structured data, graph learning, in particular deep graph learning with graph neural networks, has drawn much attention in both academic and industrial communities lately. The effectiveness of prevailing graph learning methods usually rely on abundant labeled data for model training. However, it is common that graphs are scarcely labeled since data annotation and labeling on graphs is always time and resource-consuming. Therefore, it is imperative to investigate graph learning with minimal human supervision for the low-resource settings where limited or even no labeled data is available. In this tutorial, we will focus on the state-of-the-art techniques of Graph Minimally-Supervised Learning, in particular a series of weakly-supervised learning, few-shot learning, and self-supervised learning methods on graph-structured data as well as their real-world applications. The objectives of this tutorial are to: (1) formally categorize the problems in graph minimally-supervised learning and discuss the challenges under different learning scenarios; (2) comprehensively review the existing and recent advances of graph minimally-supervised learning; and (3) elucidate open questions and future research directions. This tutorial introduces major topics within minimally-supervised learning and offers a guide to a new frontier of graph learning.

References

  1. Ding, K., Li, J., Bhanushali, R., and Liu, H. Deep anomaly detection on attributed networks. In SDM (2019).Google ScholarGoogle ScholarCross RefCross Ref
  2. Ding, K., Wang, J., Caverlee, J., and Liu, H. Meta propagation networks for few-shot semi-supervised learning on graphs. In AAAI (2022).Google ScholarGoogle ScholarCross RefCross Ref
  3. Ding, K., Wang, J., Li, J., Caverlee, J., and Liu, H. Weakly-supervised graph meta-learning for few-shot node classification. arXiv preprint arXiv:2106.06873 (2021).Google ScholarGoogle Scholar
  4. Ding, K., Wang, J., Li, J., Shu, K., Liu, C., and Liu, H. Graph prototypical networks for few-shot learning on attributed networks. In CIKM (2020).Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Ding, K., Zhou, Q., Tong, H., and Liu, H. Few-shot network anomaly detection via cross-network meta-learning. In TheWebConf (2021).Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Guo, Z., Zhang, C., Yu, W., Herr, J., Wiest, O., Jiang, M., and Chawla, N. V. Few-shot graph learning for molecular property prediction. In TheWebConf (2021).Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Hu, Z., Dong, Y., Wang, K., Chang, K.-W., and Sun, Y. Gpt-gnn: Generative pre-training of graph neural networks. In KDD (2020).Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Kipf, T. N., and Welling, M. Variational graph auto-encoders. arXiv preprint arXiv:1611.07308 (2016).Google ScholarGoogle Scholar
  9. Liu, X., Zhang, F., Hou, Z., Mian, L., Wang, Z., Zhang, J., and Tang, J. Self-supervised learning: Generative or contrastive. TKDE (2021).Google ScholarGoogle Scholar
  10. Liu, Z., Fang, Y., Liu, C., and Hoi, S. C. Relative and absolute location embedding for few-shot node classification on graph. In AAAI (2021).Google ScholarGoogle ScholarCross RefCross Ref
  11. Qiu, J., Chen, Q., Dong, Y., Zhang, J., Yang, H., Ding, M., Wang, K., and Tang, J. Gcc: Graph contrastive coding for graph neural network pre-training. In KDD (2020).Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Rong, Y., Bian, Y., Xu, T., Xie, W., Wei, Y., Huang, W., and Huang, J. Self-supervised graph transformer on large-scale molecular data. In NeurIPS (2020).Google ScholarGoogle Scholar
  13. Shchur, O., Mumme, M., Bojchevski, A., and Günnemann, S. Pitfalls of graph neural network evaluation. arXiv preprint arXiv:1811.05868 (2018).Google ScholarGoogle Scholar
  14. Wang, N., Luo, M., Ding, K., Zhang, L., Li, J., and Zheng, Q. Graph few-shot learning with attribute matching. In CIKM (2020).Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Wang, Y., Yao, Q., Kwok, J. T., and Ni, L. M. Generalizing from a few examples: A survey on few-shot learning. ACM Computing Surveys (CSUR) (2020).Google ScholarGoogle Scholar
  16. Wu, Z., Pan, S., Chen, F., Long, G., Zhang, C., and Philip, S. Y. A comprehensive survey on graph neural networks. TNNLS (2020).Google ScholarGoogle Scholar
  17. Yao, H., Zhang, C., Wei, Y., Jiang, M., Wang, S., Huang, J., Chawla, N., and Li, Z. Graph few-shot learning via knowledge transfer. In AAAI (2020).Google ScholarGoogle ScholarCross RefCross Ref
  18. You, Y., Chen, T., Sui, Y., Chen, T., Wang, Z., and Shen, Y. Graph contrastive learning with augmentations. In NeurIPS (2020).Google ScholarGoogle Scholar
  19. Zhang, C., Ding, K., Li, J., Zhang, X., Ye, Y., Chawla, N. V., and Liu, H. Few-shot learning on graphs. In IJCAI (2022).Google ScholarGoogle ScholarCross RefCross Ref
  20. Zhang, C., Yao, H., Huang, C., Jiang, M., Li, Z., and Chawla, N. V. Few-shot knowledge graph completion. In AAAI (2020).Google ScholarGoogle ScholarCross RefCross Ref
  21. Zhang, C., Yu, L., Saebi, M., Jiang, M., and Chawla, N. Few-shot multi-hop relation reasoning over knowledge bases. In EMNLP Findings (2020).Google ScholarGoogle ScholarCross RefCross Ref
  22. Zhang, Y., Qian, Y., Ye, Y., and Zhang, C. Adapting distilled knowledge for few-shot relation reasoning over knowledge graphs. In SDM (2022).Google ScholarGoogle ScholarCross RefCross Ref
  23. Zhou, Z.-H. A brief introduction to weakly supervised learning. National science review (2018).Google ScholarGoogle Scholar

Index Terms

  1. Toward Graph Minimally-Supervised Learning

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Conferences
      KDD '22: Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining
      August 2022
      5033 pages
      ISBN:9781450393850
      DOI:10.1145/3534678

      Copyright © 2022 Owner/Author

      Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 14 August 2022

      Check for updates

      Qualifiers

      • abstract

      Acceptance Rates

      Overall Acceptance Rate1,133of8,635submissions,13%

      Upcoming Conference

      KDD '24

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader