Fetching the paper…
Reading the bibliography…
The history of artificial intelligence (AI) has witnessed the significant impact of high-quality data on various deep learning models, such as ImageNet for AlexNet and ResNet.
A. Filtser, M. Kapralov, and N. Nouri, “Graph spanners by sketching in dynamic streams and the simultaneous communication model,” in SODA . SIAM, 2021, pp. 1894–1913
1913
Earlier work this paper cites.
L. Franceschi, M. Niepert, M. Pontil, and X. He, “Learning discrete structures for graph neural networks,” in ICML . PMLR, 2019, pp. 1972–1982
1982
Earlier work this paper cites.
D. Peleg and A. A. Schäffer, “Graph spanners,” Journal of graph theory , vol. 13, no. 1, pp. 99–116, 1989
1989
Earlier work this paper cites.
G. Karypis and V. Kumar, “Multilevel graph partitioning schemes,” in ICPP (3) , 1995, pp. 113–122
1995
Earlier work this paper cites.
A. A. Benczúr and D. R. Karger, “Approximating s-t minimum cuts in Õ(n2) time,” in STOC . New York, NY, USA: Association for Computing Machinery, 1996, p. 47–55. [Online]. Available: https://doi.org/10.1145/237814.237827
1996
Earlier work this paper cites.
R. Tibshirani, “Regression shrinkage and selection via the lasso,” JRSSB , vol. 58, no. 1, pp. 267–288, 1996
1996
Earlier work this paper cites.
A. Benczur and D. R. Karger, “Randomized approximation schemes for cuts and flows in capacitated graphs,” arXiv preprint cs/0207078 , 2002
2002
Earlier work this paper cites.
M. Newman, “Mixing patterns in networks.” Physical review. E, Statistical, nonlinear, and soft matter physics , 2002
2002
Earlier work this paper cites.
J. L. Gross and J. Yellen, Handbook of graph theory . CRC press, 2003
2003
Earlier work this paper cites.
K. M. Borgwardt and H. Kriegel, “Shortest-path kernels on graphs,” in ICDM , 2005
2005
Earlier work this paper cites.
K. Chen, Matrix preconditioning techniques and applications . Cambridge University Press, 2005, vol. 19
2005
Earlier work this paper cites.
P. Sen, G. Namata, M. Bilgic, L. Getoor, B. Galligher, and T. Eliassi-Rad, “Collective classification in network data,” AI magazine , vol. 29, no. 3, pp. 93–93, 2008
2008
Earlier work this paper cites.
A. C. Muresan and Y. Notay, “Analysis of aggregation-based multigrid,” SIAM Journal on Scientific Computing , vol. 30, no. 2, pp. 1082–1103, 2008
2008
Earlier work this paper cites.
N. Shervashidze, S. V. N. Vishwanathan, T. Petri, K. Mehlhorn, and K. M. Borgwardt, “Efficient graphlet kernels for large graph comparison,” in AISTATS , 2009
2009
Earlier work this paper cites.
J. Deng, W. Dong, R. Socher, L.-J. Li, K. Li, and L. Fei-Fei, “Imagenet: A large-scale hierarchical image database,” in CVPR , 2009
2009
Earlier work this paper cites.
M. Kumar, B. Packer, and D. Koller, “Self-paced learning for latent variable models,” NeurIPS , vol. 23, 2010
2010
Earlier work this paper cites.
W. S. Fung, R. Hariharan, N. J. Harvey, and D. Panigrahi, “A general framework for graph sparsification,” in STOC , 2011, pp. 71–80
2011
Earlier work this paper cites.
A. Krizhevsky, I. Sutskever, and G. E. Hinton, “Imagenet classification with deep convolutional neural networks,” Communications of the ACM , vol. 60, pp. 84 – 90, 2012
2012
Earlier work this paper cites.
J. Ye and J. Liu, “Sparse methods for biomedical data,” ACM Sigkdd Explorations Newsletter , vol. 14, no. 1, pp. 4–15, 2012
2012
Earlier work this paper cites.
P. Hu and W. Lau, “A survey and taxonomy of graph sampling,” ArXiv , vol. abs/1308.5865, 2013
2013
Earlier work this paper cites.
2013
Earlier work this paper cites.
E. M. Airoldi, T. B. Costa, and S. H. Chan, “Stochastic blockmodel approximation of a graphon: Theory and consistent estimation,” NeurIPS , vol. 26, 2013
2013
Earlier work this paper cites.
B. Perozzi, R. Al-Rfou, and S. Skiena, “Deepwalk: online learning of social representations,” in KDD , 2014
2014
Earlier work this paper cites.
K. He, X. Zhang, S. Ren, and J. Sun, “Deep residual learning for image recognition,” in CVPR , 2015
2015
Earlier work this paper cites.
2015
Earlier work this paper cites.
A. Grover and J. Leskovec, “node2vec: Scalable feature learning for networks,” in KDD , 2016
2016
Earlier work this paper cites.
M. M. Bronstein, J. Bruna, Y. LeCun, A. D. Szlam, and P. Vandergheynst, “Geometric deep learning: Going beyond euclidean data,” IEEE SPM , 2016
2016
Earlier work this paper cites.
V. Sadhanala, Y.-X. Wang, and R. Tibshirani, “Graph sparsification approaches for laplacian smoothing,” in AISTATS . PMLR, 2016, pp. 1250–1259
2016
Earlier work this paper cites.
T. N. Kipf and M. Welling, “Variational graph auto-encoders,” arXiv preprint arXiv:1611.07308 , 2016
2016
Earlier work this paper cites.
D. Wang, P. Cui, and W. Zhu, “Structural deep network embedding,” in KDD , 2016, pp. 1225–1234
2016
Earlier work this paper cites.
T. N. Kipf and M. Welling, “Semi-supervised classification with graph convolutional networks,” in ICLR , 2017
2017
Earlier work this paper cites.
W. Hamilton, Z. Ying, and J. Leskovec, “Inductive representation learning on large graphs,” NeurIPS , 2017
2017
Earlier work this paper cites.
P. Cui, X. Wang, J. Pei, and W. Zhu, “A survey on network embedding,” IEEE TKDE , 2017
2017
Earlier work this paper cites.
2017
Earlier work this paper cites.
2017
Earlier work this paper cites.
P. Velickovic, G. Cucurull, A. Casanova, A. Romero, P. Liò, and Y. Bengio, “Graph attention networks,” in ICLR , 2018
2018
Earlier work this paper cites.
2018
Earlier work this paper cites.
R. Ying, R. He, K. Chen, P. Eksombatchai, W. L. Hamilton, and J. Leskovec, “Graph convolutional neural networks for web-scale recommender systems,” in Proceedings of the 24th ACM SIGKDD international conference on knowledge discovery & data mining , 2018, pp. 974–983
2018
Earlier work this paper cites.
2018
Earlier work this paper cites.
A. Loukas and P. Vandergheynst, “Spectrally approximating large graphs with smaller graphs,” in ICML . PMLR, 2018, pp. 3237–3246
2018
Earlier work this paper cites.
2018
Earlier work this paper cites.
J. You, R. Ying, X. Ren, W. Hamilton, and J. Leskovec, “Graphrnn: Generating realistic graphs with deep auto-regressive models,” in ICML , 2018
2018
Earlier work this paper cites.
W. Huang, T. Zhang, Y. Rong, and J. Huang, “Adaptive sampling towards fast graph representation learning,” NeurIPS , vol. 31, 2018
2018
Earlier work this paper cites.
R. Ying, R. He, K. Chen, P. Eksombatchai, W. L. Hamilton, and J. Leskovec, “Graph convolutional neural networks for web-scale recommender systems,” in KDD , 2018
2018
Earlier work this paper cites.
H. Gao and H. Huang, “Self-paced network embedding,” in KDD , 2018, pp. 1406–1415
2018
Earlier work this paper cites.
D. Zhou, J. He, H. Yang, and W. Fan, “Sparc: Self-paced network representation for few-shot rare category characterization,” in KDD , 2018, pp. 2807–2816
2018
Earlier work this paper cites.
Z. Yang, J. Zhao, B. Dhingra, K. He, W. W. Cohen, R. R. Salakhutdinov, and Y. LeCun, “Glomo: Unsupervised learning of transferable relational graphs,” NeurIPS , vol. 31, 2018
2018
Earlier work this paper cites.
R. Li, S. Wang, F. Zhu, and J. Huang, “Adaptive graph convolutional neural networks,” in AAAI , vol. 32, no. 1, 2018
2018
Earlier work this paper cites.
Q. Li, Z. Han, and X.-M. Wu, “Deeper insights into graph convolutional networks for semi-supervised learning,” in AAAI , vol. 32, no. 1, 2018
2018
Earlier work this paper cites.
L. Gao, H. Yang, C. Zhou, J. Wu, S. Pan, and Y. Hu, “Active discriminative network representation learning,” in IJCAI , 2018
2018
Earlier work this paper cites.
K. Kuang, P. Cui, S. Athey, R. Xiong, and B. Li, “Stable prediction across unknown environments,” in KDD . ACM, 2018, pp. 1617–1626
2018
Earlier work this paper cites.
B. Jiang, Z. Zhang, D. Lin, J. Tang, and B. Luo, “Semi-supervised learning with graph learning-convolutional networks,” in CVPR , 2019
2019
Earlier work this paper cites.
L. Yang, Z. Kang, X. Cao, D. Jin, B. Yang, and Y. Guo, “Topology optimization based graph convolutional network,” in IJCAI , 2019
2019
Earlier work this paper cites.
W.-L. Chiang, X. Liu, S. Si, Y. Li, S. Bengio, and C.-J. Hsieh, “Cluster-gcn: An efficient algorithm for training deep and large graph convolutional networks,” in KDD , 2019, pp. 257–266
2019
Earlier work this paper cites.
H. Zeng, H. Zhou, A. Srivastava, R. Kannan, and V. Prasanna, “Accurate, efficient and scalable graph embedding,” in IPDPS . IEEE, 2019, pp. 462–471
2019
Earlier work this paper cites.
D. Zou, Z. Hu, Y. Wang, S. Jiang, Y. Sun, and Q. Gu, “Layer-dependent importance sampling for training deep and large graph convolutional networks,” NeurIPS , 2019
2019
Earlier work this paper cites.
2019
Earlier work this paper cites.
C. Zhang, D. Song, C. Huang, A. Swami, and N. V. Chawla, “Heterogeneous graph neural network,” in KDD , 2019, pp. 793–803
2019
Earlier work this paper cites.
F. Feng, X. He, J. Tang, and T.-S. Chua, “Graph adversarial training: Dynamically regularizing based on graph structure,” IEEE TKDE , vol. 33, no. 6, pp. 2493–2504, 2019
2019
Earlier work this paper cites.
V. Verma, A. Lamb, C. Beckham, A. Najafi, I. Mitliagkas, D. Lopez-Paz, and Y. Bengio, “Manifold mixup: Better representations by interpolating hidden states,” in ICML . PMLR, 2019, pp. 6438–6447
2019
Earlier work this paper cites.
Z. Wu, S. Pan, F. Chen, G. Long, C. Zhang, and P. S. Yu, “A comprehensive survey on graph neural networks,” IEEE Transactions on Neural Networks and Learning Systems , 2019
2019
Earlier work this paper cites.
Y. Feng, H. You, Z. Zhang, R. Ji, and Y. Gao, “Hypergraph neural networks,” in AAAI , 2019
2019
Earlier work this paper cites.
2019
Earlier work this paper cites.
J. Klicpera, S. Weißenberger, and S. Günnemann, “Diffusion improves graph learning,” in NeurIPS , 2019
2019
Earlier work this paper cites.
C. Gong, J. Yang, and D. Tao, “Multi-modal curriculum learning over graphs,” TIST , 2019
2019
Earlier work this paper cites.
L. Yang, Z. Chen, J. Gu, and Y. Guo, “Dual self-paced graph convolutional network: Towards reducing attribute distortions induced by topology.” in IJCAI , 2019
2019
Earlier work this paper cites.
C. Huang, B. Shi, X. Zhang, X. Wu, and N. V. Chawla, “Similarity-aware network embedding with self-paced learning,” in CIKM , 2019, pp. 2113–2116
2019
Earlier work this paper cites.
J. Ma, W. Tang, J. Zhu, and Q. Mei, “A flexible generative framework for graph-based semi-supervised learning,” NeurIPS , vol. 32, 2019
2019
Earlier work this paper cites.
Y. Zhang, S. Pal, M. Coates, and D. Ustebay, “Bayesian graph convolutional neural networks for semi-supervised classification,” in AAAI , vol. 33, no. 01, 2019, pp. 5829–5836
2019
Earlier work this paper cites.
2019
Earlier work this paper cites.
2019
Earlier work this paper cites.
P. Liu, S. Chang, X. Huang, J. Tang, and J. C. K. Cheung, “Contextualized non-local neural networks for sequence learning,” in AAAI , vol. 33, no. 01, 2019, pp. 6762–6769
2019
Earlier work this paper cites.
B. Jiang, Z. Zhang, D. Lin, J. Tang, and B. Luo, “Semi-supervised learning with graph learning-convolutional networks,” in IEEE/CVF , 2019, pp. 11 313–11 320
2019
Earlier work this paper cites.
L. Yang, Z. Kang, X. Cao, D. Jin, B. Yang, and Y. Guo, “Topology optimization based graph convolutional network.” in IJCAI , 2019, pp. 4054–4061
2019
Earlier work this paper cites.
J. You, R. Ying, and J. Leskovec, “Position-aware graph neural networks,” in ICML , vol. 97, 2019, pp. 7134–7143
2019
Earlier work this paper cites.
D. Ming, C. Ding, and F. Nie, “A probabilistic derivation of lasso and l12-norm feature selections,” in AAAI , vol. 33, no. 01, 2019, pp. 4586–4593
2019
Earlier work this paper cites.
J. Li, R. Guo, C. Liu, and H. Liu, “Adaptive Unsupervised Feature Selection on Attributed Networks,” in KDD . Association for Computing Machinery, 2019, pp. 92–100
2019
Earlier work this paper cites.
2019
Earlier work this paper cites.
S. Hu, M. Qu, Z. Liu, and J. Tang, “Transfer active learning for graph neural networks,” 2019
2019
Earlier work this paper cites.
2019
Earlier work this paper cites.
S. Zhang, H. Tong, J. Xu, and R. Maciejewski, “Graph convolutional networks: a comprehensive review,” Computational Social Networks , vol. 6, no. 1, pp. 1–23, 2019
2019
Earlier work this paper cites.
K. Xu, W. Hu, J. Leskovec, and S. Jegelka, “How powerful are graph neural networks?” in ICLR , 2019
2019
Earlier work this paper cites.
J.-X. Zhong, N. Li, W. Kong, S. Liu, T. H. Li, and G. Li, “Graph convolutional label noise cleaner: Train a plug-and-play action classifier for anomaly detection,” in IEEE/CVF , 2019, pp. 1237–1246
2019
Earlier work this paper cites.
J. Cohen, E. Rosenfeld, and J. Z. Kolter, “Certified adversarial robustness via randomized smoothing,” in ICML , vol. 97, 2019, pp. 1310–1320
2019
Earlier work this paper cites.
A. Bojchevski and S. Günnemann, “Certifiable robustness to graph perturbations,” in NeurIPS , 2019, pp. 8317–8328
2019
Earlier work this paper cites.
W. Jin, Y. Ma, X. Liu, X. Tang, S. Wang, and J. Tang, “Graph structure learning for robust graph neural networks,” in KDD , 2020
2020
Earlier work this paper cites.
D. Chen, Y. Lin, W. Li, P. Li, J. Zhou, and X. Sun, “Measuring and relieving the over-smoothing problem for graph neural networks from the topological view,” in AAAI , 2020
2020
Earlier work this paper cites.
X. Zhang and M. Zitnik, “Gnnguard: Defending graph neural networks against adversarial attacks,” in NeurIPS , 2020
2020
Earlier work this paper cites.
C. Zheng, B. Zong, W. Cheng, D. Song, J. Ni, W. Yu, H. Chen, and W. Wang, “Robust graph representation learning via neural sparsification,” in ICML , H. D. III and A. Singh, Eds., vol. 119. PMLR, 13–18 Jul 2020, pp. 11 458–11 468
2020
Earlier work this paper cites.
S. Chang, Y. Zhang, M. Yu, and T. S. Jaakkola, “Invariant rationalization,” in ICML , 2020
2020
Earlier work this paper cites.
Y. You, T. Chen, Y. Sui, T. Chen, Z. Wang, and Y. Shen, “Graph contrastive learning with augmentations,” NeurIPS , vol. 33, pp. 5812–5823, 2020
2020
Earlier work this paper cites.
Y. Wang, W. Wang, Y. Liang, Y. Cai, J. Liu, and B. Hooi, “Nodeaug: Semi-supervised node classification with data augmentation,” in KDD , 2020, pp. 207–217
2020
Earlier work this paper cites.
2020
Earlier work this paper cites.
W. Hu, M. Fey, M. Zitnik, Y. Dong, H. Ren, B. Liu, M. Catasta, and J. Leskovec, “Open graph benchmark: Datasets for machine learning on graphs,” NeurIPS , vol. 33, pp. 22 118–22 133, 2020
2020
Cited alongside, same era.
2020
Cited alongside, same era.
R. Ahmed, G. Bodwin, F. D. Sahneh, K. Hamm, M. J. L. Jebelli, S. Kobourov, and R. Spence, “Graph spanners: A tutorial review,” Computer Science Review , vol. 37, p. 100253, 2020
2020
Cited alongside, same era.
M. Kapralov, A. Mousavifar, C. Musco, C. Musco, N. Nouri, A. Sidford, and J. Tardos, “Fast and space efficient spectral sparsification in dynamic streams,” in SIAM . SIAM, 2020, pp. 1814–1833
2020
Cited alongside, same era.
2022
Later among the works it cites.
Y. Chen, S. Khanna, and H. Li, “On weighted graph sparsification by linear sketching,” in FOCS . IEEE, 2022, pp. 474–485
2022
Later among the works it cites.
J. Li, T. Zhang, H. Tian, S. Jin, M. Fardad, and R. Zafarani, “Graph sparsification with graph convolutional networks,” INT J DATA SCI , pp. 1–14, 2022
2022
Later among the works it cites.
J. Chen, Y. Saad, and Z. Zhang, “Graph coarsening: from scientific computing to machine learning,” SeMA Journal , pp. 1–37, 2022
2022
Later among the works it cites.
W. Jin, X. Tang, H. Jiang, Z. Li, D. Zhang, J. Tang, and B. Yin, “Condensing graphs via one-step gradient matching,” in KDD , 2022, pp. 720–730
2022
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
V. N. Ioannidis, S. Chen, and G. B. Giannakis, “Pruned graph scattering transforms,” in ICLR , 2020
2020
Cited alongside, same era.
——, “Sgcn: A graph sparsifier based on graph convolutional networks,” in PAKDD . Springer, 2020, pp. 275–287
2020
Cited alongside, same era.
Y. Jin, A. Loukas, and J. JaJa, “Graph coarsening with preserved spectral properties,” in AISTATS . PMLR, 2020, pp. 4452–4462
2020
Cited alongside, same era.
2020
Cited alongside, same era.
N. Goyal, H. V. Jain, and S. Ranu, “Graphgen: A scalable approach to domain-agnostic labeled graph generation,” in WWW , 2020
2020
Cited alongside, same era.
Y. Zhu, Y. Xu, F. Yu, Q. Liu, S. Wu, and L. Wang, “Deep graph contrastive representation learning,” CoRR , 2020
2020
Cited alongside, same era.
W. Feng, J. Zhang, Y. Dong, Y. Han, H. Luan, Q. Xu, Q. Yang, E. Kharlamov, and J. Tang, “Graph random neural networks for semi-supervised learning on graphs,” in NeurIPS , 2020
2020
Cited alongside, same era.
Z. Hu, Y. Dong, K. Wang, K. Chang, and Y. Sun, “GPT-GNN: generative pre-training of graph neural networks,” in KDD , 2020
2020
Cited alongside, same era.
Later among the works it cites.
2022
Later among the works it cites.
2022
Later among the works it cites.
K. Martinkus, A. Loukas, N. Perraudin, and R. Wattenhofer, “Spectre: Spectral conditioning helps to overcome the expressivity limits of one-shot graph generators,” in ICML . PMLR, 2022, pp. 15 159–15 179
2022
Later among the works it cites.
T. Luo, Z. Mo, and S. J. Pan, “Fast graph generation via spectral diffusion.” CoRR , 2022
2022
Later among the works it cites.
Q. Tan, N. Liu, X. Huang, R. Chen, S. Choi, and X. Hu, “MGAE: masked autoencoders for self-supervised learning on graphs,” CoRR , 2022
2022
Later among the works it cites.
J. Yoo, S. Shim, and U. Kang, “Model-agnostic augmentation for accurate graph classification,” in WWW , 2022
2022
Later among the works it cites.
K. Hassani and A. H. K. Ahmadi, “Learning graph augmentations to learn graph representations,” CoRR , 2022
2022
Later among the works it cites.
T. Zhao, X. Tang, D. Zhang, H. Jiang, N. Rao, Y. Song, P. Agrawal, K. Subbian, B. Yin, and M. Jiang, “Autogda: Automated graph data augmentation for node classification,” in LoG , 2022
2022
Later among the works it cites.
Z. Zhang, Q. Liu, Q. Hu, and C.-K. Lee, “Hierarchical graph transformer with adaptive node sampling,” NeurIPS , vol. 35, pp. 21 171–21 183, 2022
2022
Later among the works it cites.
2022
Later among the works it cites.
2022
Later among the works it cites.
U. Ahmed, J. C.-W. Lin, and G. Srivastava, “Hyper-graph-based attention curriculum learning using a lexical algorithm for mental health,” PRL , 2022
2022
Later among the works it cites.
M. Gong, H. Zhou, A. Qin, W. Liu, and Z. Zhao, “Self-paced co-training of graph neural networks for semi-supervised node classification,” IEEE TNNLS , 2022
2022
Later among the works it cites.
R. Li, T. Zhong, X. Jiang, G. Trajcevski, J. Wu, and F. Zhou, “Mining spatio-temporal relations via self-paced graph contrastive learning,” in KDD , 2022, pp. 936–944
2022
Later among the works it cites.
Q. Sun, J. Li, H. Peng, J. Wu, X. Fu, C. Ji, and S. Y. Philip, “Graph structure learning with variational information bottleneck,” 2022
2022
Later among the works it cites.
N. Yin and Z. Luo, “Generic structure extraction with bi-level optimization for graph structure learning,” Entropy , 2022
2022
Later among the works it cites.
V. P. Dwivedi, A. T. Luu, T. Laurent, Y. Bengio, and X. Bresson, “Graph neural networks with learnable structural and positional representations,” in ICLR . OpenReview.net, 2022
2022
Later among the works it cites.
H. Wang, H. Yin, M. Zhang, and P. Li, “Equivariant and stable positional encoding for more powerful graph neural networks,” in ICLR , 2022
2022
Later among the works it cites.
S. K. Maurya, X. Liu, and T. Murata, “Not All Neighbors are Friendly: Learning to Choose Hop Features to Improve Node Classification,” in Proceedings of the 31st ACM International Conference on Information & Knowledge Management . ACM, 2022, pp. 4334–4338
2022
Later among the works it cites.
D. Jin, R. Wang, T. Wang, D. He, W. Ding, Y. Huang, L. Wang, and W. Pedrycz, “Amer: A new attribute-missing network embedding approach,” IEEE Transactions on Cybernetics , 2022
2022
Later among the works it cites.
K. Wang, Y. Yu, C. Huang, Z. Zhao, and J. Dong, “Heterogeneous graph neural network for attribute completion,” Knowledge-Based Systems , vol. 251, p. 109171, 2022
2022
Later among the works it cites.
D. He, C. Liang, C. Huo, Z. Feng, D. Jin, L. Yang, and W. Zhang, “Analyzing heterogeneous networks with missing attributes by unsupervised contrastive learning,” TNNLS , 2022
2022
Later among the works it cites.
M. Sun, K. Zhou, X. He, Y. Wang, and X. Wang, “Gppt: Graph pre-training and prompt tuning to generalize graph neural networks,” in KDD , 2022, pp. 1717–1727
2022
Later among the works it cites.
X. Han, Z. Jiang, N. Liu, and X. Hu, “G-mixup: Graph data augmentation for graph classification,” in ICML . PMLR, 2022, pp. 8230–8248
2022
Later among the works it cites.
J. Park, H. Shim, and E. Yang, “Graph transplant: Node saliency-guided graph mixup with local structure preservation,” in AAAI , vol. 36, no. 7, 2022, pp. 7966–7974
2022
Later among the works it cites.
H. He, J. Wang, Z. Zhang, and F. Wu, “Compressing deep graph neural networks via adversarial knowledge distillation,” in KDD , 2022, pp. 534–544
2022
Later among the works it cites.
Q. Tan, D. Zha, S.-H. Choi, L. Li, R. Chen, and X. Hu, “Double wins: Boosting accuracy and efficiency of graph neural networks by reliable knowledge distillation,” 2022
2022
Later among the works it cites.
J. Guo, D. Chen, and C. Wang, “Alignahead: Online cross-layer knowledge extraction on graph neural networks,” in IJCNN . IEEE, 2022, pp. 1–8
2022
Later among the works it cites.
C. Zhang, J. Liu, K. Dang, and W. Zhang, “Multi-scale distillation from multiple graph neural networks,” in AAAI , vol. 36, no. 4, 2022, pp. 4337–4344
2022
Later among the works it cites.
L. Wu, H. Lin, Y. Huang, and S. Z. Li, “Knowledge distillation improves graph structure augmentation for graph neural networks,” NurIPS , vol. 35, pp. 11 815–11 827, 2022
2022
Later among the works it cites.
Y. He and Y. Ma, “Sgkd: A scalable and effective knowledge distillation framework for graph representation learning,” in ICDMW . IEEE, 2022, pp. 666–673
2022
Later among the works it cites.
X. Li, Y. Wu, V. Rakesh, Y. Lin, H. Yang, and F. Wang, “Smartquery: An active learning framework for graph neural networks through hybrid uncertainty reduction,” in CIKM , 2022
2022
Later among the works it cites.
L. Cui, X. Tang, S. Katariya, N. Rao, P. Agrawal, K. Subbian, and D. Lee, “Allie: Active learning on large-scale imbalanced graphs,” in WWW , 2022
2022
Later among the works it cites.
Y. Zhang, H. Tong, Y. Xia, Y. Zhu, Y. Chi, and L. Ying, “Batch active learning with graph neural networks via multi-agent deep reinforcement learning,” in AAAI , 2022
2022
Later among the works it cites.
2022
Later among the works it cites.
J. Kang, Q. Zhou, and H. Tong, “Jurygcn: quantifying jackknife uncertainty on graph convolutional networks,” in KDD , 2022
2022
Later among the works it cites.
J. Liu, Y. Wang, B. Hooi, R. Yang, and X. Xiao, “Lscale: Latent space clustering-based active learning for node classification,” in ECML-PKDD , 2022
2022
Later among the works it cites.
2022
Later among the works it cites.
X. Guo and L. Zhao, “A systematic survey on deep generative models for graph generation,” TPAMI , 2022
2022
Later among the works it cites.
Y. Zhu, Y. Du, Y. Wang, Y. Xu, J. Zhang, Q. Liu, and S. Wu, “A survey on deep graph generation: Methods and applications,” in LoG , 2022
2022
Later among the works it cites.
2022
Later among the works it cites.
J. Xu, R. Huang, X. JIANG, Y. Cao, C. Yang, C. Wang, and Y. Yang, “Better with less: Data-active pre-training of graph neural networks,” 2022
2022
Later among the works it cites.
L. Wu, P. Cui, J. Pei, L. Zhao, and X. Guo, “Graph neural networks: foundation, frontiers and applications,” in KDD , 2022, pp. 4840–4841
2022
Later among the works it cites.
2022
Later among the works it cites.
L. Sun, Y. Dou, C. Yang, K. Zhang, J. Wang, S. Y. Philip, L. He, and B. Li, “Adversarial attack and defense on graph data: A survey,” IEEE TKDE , 2022
2022
Later among the works it cites.
R. Wang, X. Wang, C. Shi, and L. Song, “Uncovering the structural fairness in graph contrastive learning,” in NeurIPS , 2022
2022
Later among the works it cites.
S. Fan, X. Wang, C. Shi, K. Kuang, N. Liu, and B. Wang, “Debiased graph neural networks with agnostic label selection bias,” IEEE TNNLS , 2022
2022
Later among the works it cites.
2023
Closest in time.
L. Lin, J. Chen, and H. Wang, “Spectral augmentation for self-supervised learning on graphs,” in ICLR . OpenReview.net, 2023
2023
Closest in time.
A. Ghose, Y. Zhang, J. Hao, and M. Coates, “Spectral augmentations for graph contrastive learning,” in AISTATS , ser. Proceedings of Machine Learning Research, vol. 206. PMLR, 2023, pp. 11 213–11 266
2023
Closest in time.
2023
Closest in time.
X. Wang, D. Bo, C. Shi, S. Fan, Y. Ye, and P. S. Yu, “A survey on heterogeneous graph embedding: Methods, techniques, applications and sources,” IEEE TBD , vol. 9, no. 2, pp. 415–436, 2023
2023
Closest in time.
2023
Closest in time.
Z. Xu, Y. Chen, M. Pan, H. Chen, M. Das, H. Yang, and H. Tong, “Kernel ridge regression-based graph dataset distillation,” in KDD , 2023, pp. 2850–2861
2023
Closest in time.
2023
Closest in time.
2023
Closest in time.
X. Chen, J. He, X. Han, and L. Liu, “Efficient and degree-guided graph generation via discrete diffusion modeling,” in ICML , vol. 202, 2023, pp. 4585–4610
2023
Closest in time.
Y. Luo, M. McThrow, W. Y. Au, T. Komikado, K. Uchino, K. Maruhashi, and S. Ji, “Automated data augmentations for graph classification,” in ICLR , 2023
2023
Closest in time.
X. Wei, X. Gong, Y. Zhan, B. Du, Y. Luo, and W. Hu, “Clnode: Curriculum learning for node classification,” in WSDM , 2023
2023
Closest in time.
Y. Liu, X. Yang, S. Zhou, X. Liu, Z. Wang, K. Liang, W. Tu, L. Li, J. Duan, and C. Chen, “Hard sample aware network for contrastive deep graph clustering,” in AAAI , 2023
2023
Closest in time.
H. Wang, K. Zhou, X. Zhao, J. Wang, and J.-R. Wen, “Curriculum pre-training heterogeneous subgraph transformer for top-n recommendation,” TOIS , 2023
2023
Closest in time.
L. Chen, H. Xu, Z. Wang, C. Wang, and Y. Jiang, “Self-paced learning based graph convolutional neural network for mixed integer programming (student abstract),” in AAAI , vol. 37, no. 13, 2023, pp. 16 188–16 189
2023
Closest in time.
P. Zhou, X. Liu, L. Du, and X. Li, “Self-paced adaptive bipartite graph learning for consensus clustering,” TKDD , 2023
2023
Closest in time.
D. Lim, J. D. Robinson, L. Zhao, T. E. Smidt, S. Sra, H. Maron, and S. Jegelka, “Sign and basis invariant networks for spectral graph representation learning,” in ICLR , 2023
2023
Closest in time.
B. Jiang, B. Wang, and B. Luo, “Sparse norm regularized attribute selection for graph neural networks,” Pattern Recognition , vol. 137, p. 109265, 2023
2023
Closest in time.
2023
Closest in time.
C. Li, Y. Yan, J. Fu, Z. Zhao, and Q. Zeng, “Hetregat-fc: Heterogeneous residual graph attention network via feature completion,” Information Sciences , vol. 632, pp. 424–438, 2023
2023
Closest in time.
Y. Guo, C. Yang, Y. Chen, J. Liu, C. Shi, and J. Du, “A data-centric framework to endow graph neural networks with out-of-distribution detection ability,” KDD , 2023
2023
Closest in time.
X. Sun, H. Cheng, J. Li, B. Liu, and J. Guan, “All in one: Multi-task prompting for graph neural networks,” 2023
2023
Closest in time.
2023
Closest in time.
Z. Liu, X. Yu, Y. Fang, and X. Zhang, “Graphprompt: Unifying pre-training and downstream tasks for graph neural networks,” in WWW , 2023
2023
Closest in time.
M. Navarro and S. Segarra, “Graphmad: Graph mixup for data augmentation using data-driven convex clustering,” in ICASSP . IEEE, 2023, pp. 1–5
2023
Closest in time.
Z. Guo, C. Zhang, Y. Fan, Y. Tian, C. Zhang, and N. V. Chawla, “Boosting graph neural networks via adaptive knowledge distillation,” in AAAI , vol. 37, no. 6, 2023, pp. 7793–7801
2023
Closest in time.
C. Yang, Y. Guo, Y. Xu, C. Shi, J. Liu, C. Wang, X. Li, N. Guo, and H. Yin, “Learning to distill graph neural networks,” in WSDM , 2023, pp. 123–131
2023
Closest in time.
Y. Dong, B. Zhang, Y. Yuan, N. Zou, Q. Wang, and J. Li, “Reliant: Fair knowledge distillation for graph neural networks,” in SDM . SIAM, 2023, pp. 154–162
2023
Closest in time.
Y. Li, J. Yin, and L. Chen, “Informative pseudo-labeling for graph neural networks with few labels,” Data Mining and Knowledge Discovery , vol. 37, no. 1, pp. 228–254, 2023
2023
Closest in time.
T. Yang, M. Zhou, Y. Wang, Z. Lin, L. Pan, B. Cui, and Y. Tong, “Mitigating semantic confusion from hostile neighborhood for graph active learning,” in CIKM , 2023
2023
Closest in time.
2023
Closest in time.
2023
Closest in time.
2023
Closest in time.
J. Xia, H. Lin, Y. Xu, C. Tan, L. Wu, S. Li, and S. Z. Li, “Gnn cleaner: Label cleaner for graph structured data,” IEEE TKDE , 2023
2023
Closest in time.
T. Fang, Y. Zhang, Y. Yang, C. Wang, and L. Chen, “Universal prompt tuning for graph neural networks,” NeurIPS , 2023
2023
Closest in time.
2023
Closest in time.
2023
Closest in time.
2023
Closest in time.
2023
Closest in time.
2023
Closest in time.
M. Yoon, T. Gervet, B. Shi, S. Niu, Q. He, and J. Yang, “Performance-adaptive sampling strategy towards fast and accurate graph neural networks,” in KDD , 2021, pp. 2046–2056
2056
Closest in time.