Semi-Supervised Graph Classification: A Hierarchical Graph Perspective-Reference-Cited by-同舟云学术

Semi-Supervised Graph Classification: A Hierarchical Graph Perspective

Published:2019 Issue: Volume: Page:
ISSN:
Container-title:The World Wide Web Conference on - WWW '19
language:
Short-container-title:

Author:

Li Jia¹,Rong Yu²,Cheng Hong¹,Meng Helen¹,Huang Wenbing²,Huang Junzhou²

Affiliation:

1. The Chinese University of Hong Kong, Hong Kong

2. Tencent AI Lab, China

Publisher

ACM Press

Reference35 articles.

1. M. Bilgic, L. Mihalkova, and L. Getoor. 2010. Active learning for networked data. In ICML. 79-86.

2. B. Bollobás and O. M. Riordan. 2003. Mathematical results on scale-free random graphs. Handbook of graphs and networks: from the genome to the internet (2003), 1-34.

3. K. M. Borgwardt and H.-P. Kriegel. 2005. Shortest-path kernels on graphs. In ICDM. 74-81.

4. K. M. Borgwardt, C. S. Ong, S. Schönauer, S.V.N. Vishwanathan, A. J. Smola, and H.-P. Kriegel. 2005. Protein function prediction via graph kernels. In ISMB. 47-56.

5. H. Dai, B. Dai, and L. Song. 2016. Discriminative embeddings of latent variable models for structured data. In ICML. 2702-2711.

Cited by 97 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Graph classification using high-difference-frequency subgraph embedding;Neurocomputing;2024-11

2. On the effectiveness of hybrid pooling in mixup-based graph learning for language processing;Journal of Systems and Software;2024-10

3. ZeroG: Investigating Cross-dataset Zero-shot Transferability in Graphs;Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining;2024-08-24

4. Heuristic Learning with Graph Neural Networks: A Unified Framework for Link Prediction;Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining;2024-08-24

5. Reimagining Graph Classification from a Prototype View with Optimal Transport: Algorithm and Theorem;Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining;2024-08-24