Fetching the paper…
Reading the bibliography…
Contrastive learning has recently attracted plenty of attention in deep graph clustering for its promising performance.
J. A. Hartigan and M. A. Wong, “Algorithm as 136: A k-means clustering algorithm,” Journal of the royal statistical society. series c (applied statistics) , vol. 28, no. 1, pp. 100–108, 1979
1979
Earlier work this paper cites.
J. A. Hartigan and M. A. Wong, “Algorithm as 136: A k-means clustering algorithm,” Journal of the royal statistical society. series c (applied statistics) , vol. 28, no. 1, pp. 100–108, 1979
1979
Earlier work this paper cites.
G. Taubin, “A signal processing approach to fair surface design,” in Proceedings of the 22nd annual conference on Computer graphics and interactive techniques , 1995, pp. 351–358
1995
Earlier work this paper cites.
2006
Earlier work this paper cites.
U. Von Luxburg, “A tutorial on spectral clustering,” Statistics and computing , vol. 17, no. 4, pp. 395–416, 2007
2007
Earlier work this paper cites.
L. Van der Maaten and G. Hinton, “Visualizing data using t-sne.” Journal of machine learning research , vol. 9, no. 11, 2008
2008
Earlier work this paper cites.
I. Goodfellow, J. Pouget-Abadie, M. Mirza, B. Xu, D. Warde-Farley, S. Ozair, A. Courville, and Y. Bengio, “Generative adversarial nets,” Advances in neural information processing systems , vol. 27, 2014
2014
Earlier work this paper cites.
2014
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.
J. Xie, R. Girshick, and A. Farhadi, “Unsupervised deep embedding for clustering analysis,” in International conference on machine learning . PMLR, 2016, pp. 478–487
2016
Earlier work this paper cites.
C. Wang, S. Pan, G. Long, X. Zhu, and J. Jiang, “Mgae: Marginalized graph autoencoder for graph clustering,” in Proceedings of the 2017 ACM on Conference on Information and Knowledge Management , 2017, pp. 889–898
2017
Earlier work this paper cites.
A. Vaswani, N. Shazeer, N. Parmar, J. Uszkoreit, L. Jones, A. N. Gomez, Ł. Kaiser, and I. Polosukhin, “Attention is all you need,” Advances in neural information processing systems , vol. 30, 2017
2017
Earlier work this paper cites.
2017
Earlier work this paper cites.
T. N. Kipf and M. Welling, “Semi-supervised classification with graph convolutional networks,” in International Conference on Learning Representations , 2017
2017
Earlier work this paper cites.
B. Yang, X. Fu, N. D. Sidiropoulos, and M. Hong, “Towards k-means-friendly spaces: Simultaneous deep learning and clustering,” in international conference on machine learning . PMLR, 2017, pp. 3861–3870
2017
Earlier work this paper cites.
X. Guo, L. Gao, X. Liu, and J. Yin, “Improved deep embedded clustering with local structure preservation.” in Ijcai , 2017, pp. 1753–1759
2017
Earlier work this paper cites.
S. Pan, R. Hu, G. Long, J. Jiang, L. Yao, and C. Zhang, “Adversarially regularized graph autoencoder for graph embedding,” in Proceedings of the 27th International Joint Conference on Artificial Intelligence , 2018, pp. 2609–2615
2018
Earlier work this paper cites.
H. Wang, J. Wang, J. Wang, M. Zhao, W. Zhang, F. Zhang, X. Xie, and M. Guo, “Graphgan: Graph representation learning with generative adversarial nets,” in Proceedings of the AAAI conference on artificial intelligence , vol. 32, no. 1, 2018
2018
Earlier work this paper cites.
R. D. Hjelm, A. Fedorov, S. Lavoie-Marchildon, K. Grewal, P. Bachman, A. Trischler, and Y. Bengio, “Learning deep representations by mutual information estimation and maximization,” in International Conference on Learning Representations , 2018
2018
Earlier work this paper cites.
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 Thirty-Second AAAI conference on artificial intelligence , 2018
2018
Earlier work this paper cites.
2019
Earlier work this paper cites.
S. Pan, R. Hu, S.-f. Fung, G. Long, J. Jiang, and C. Zhang, “Learning graph embedding with adversarial training methods,” IEEE transactions on cybernetics , vol. 50, no. 6, pp. 2475–2487, 2019
2019
Cited alongside, same era.
X. Zhang, H. Liu, Q. Li, and X.-M. Wu, “Attributed graph clustering via adaptive graph convolution,” in Proceedings of the 28th International Joint Conference on Artificial Intelligence , 2019, pp. 4327–4333
2019
Cited alongside, same era.
J. Park, M. Lee, H. J. Chang, K. Lee, and J. Y. Choi, “Symmetric graph convolutional autoencoder for unsupervised graph representation learning,” in Proceedings of the IEEE/CVF International Conference on Computer Vision , 2019, pp. 6519–6528
2019
Cited alongside, same era.
Z. Tao, H. Liu, J. Li, Z. Wang, and Y. Fu, “Adversarial graph embedding for ensemble clustering,” in International Joint Conferences on Artificial Intelligence Organization , 2019
2019
Cited alongside, same era.
J. Cheng, Q. Wang, Z. Tao, D. Xie, and Q. Gao, “Multi-view attribute graph convolution networks for clustering,” in Proceedings of the Twenty-Ninth International Conference on International Joint Conferences on Artificial Intelligence , 2021, pp. 2973–2979
2021
Later among the works it cites.
H. Zhao, X. Yang, Z. Wang, E. Yang, and C. Deng, “Graph debiased contrastive learning with joint representation clustering,” in Proc. IJCAI , 2021, pp. 3434–3440
2021
Later among the works it cites.
2021
Later among the works it cites.
H. Zhong, J. Wu, C. Chen, J. Huang, M. Deng, L. Nie, Z. Lin, and X.-S. Hua, “Graph contrastive clustering,” in Proceedings of the IEEE/CVF International Conference on Computer Vision , 2021, pp. 9224–9233
2021
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
F. Wu, A. Souza, T. Zhang, C. Fifty, T. Yu, and K. Weinberger, “Simplifying graph convolutional networks,” in International conference on machine learning . PMLR, 2019, pp. 6861–6871
2019
Cited alongside, same era.
S. Zhou, X. Liu, M. Li, E. Zhu, L. Liu, C. Zhang, and J. Yin, “Multiple kernel clustering with neighbor-kernel subspace segmentation,” IEEE transactions on neural networks and learning systems , vol. 31, no. 4, pp. 1351–1362, 2019
2019
Cited alongside, same era.
Y. Xie, T. Chen, T. Pu, H. Wu, and L. Lin, “Adversarial graph representation adaptation for cross-domain facial expression recognition,” in Proceedings of the 28th ACM international conference on Multimedia , 2020, pp. 1255–1264
2020
Cited alongside, same era.
Y. Luo, Z. Huang, Z. Wang, Z. Zhang, and M. Baktashmotlagh, “Adversarial bipartite graph learning for video domain adaptation,” in Proceedings of the 28th ACM International Conference on Multimedia , 2020, pp. 19–27
2020
Cited alongside, same era.
Z. Li, Q. Xu, Y. Jiang, X. Cao, and Q. Huang, “Quaternion-based knowledge graph network for recommendation,” in Proceedings of the 28th ACM International Conference on Multimedia , 2020, pp. 880–888
2020
Cited alongside, same era.
D. Bo, X. Wang, C. Shi, M. Zhu, E. Lu, and P. Cui, “Structural deep clustering network,” in Proceedings of The Web Conference 2020 , 2020, pp. 1400–1410
2020
Cited alongside, same era.
2020
Cited alongside, same era.
G. Cui, J. Zhou, C. Yang, and Z. Liu, “Adaptive graph encoder for attributed graph embedding,” in Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining , 2020, pp. 976–985
2020
Cited alongside, same era.
S. Thakoor, C. Tallec, M. G. Azar, M. Azabou, E. L. Dyer, R. Munos, P. Veličković, and M. Valko, “Large-scale representation learning on graphs via bootstrapping,” in International Conference on Learning Representations , 2021
2021
Later among the works it cites.
2021
Later among the works it cites.
2021
Later among the works it cites.
2021
Later among the works it cites.
2021
Later among the works it cites.
2021
Later among the works it cites.
2021
Later among the works it cites.
S. Wang, X. Liu, X. Zhu, P. Zhang, Y. Zhang, F. Gao, and E. Zhu, “Fast parameter-free multi-view subspace clustering with consensus anchor guidance,” IEEE Transactions on Image Processing , vol. 31, pp. 556–568, 2021
2021
Later among the works it cites.
S. Wang, X. Liu, L. Liu, S. Zhou, and E. Zhu, “Late fusion multiple kernel clustering with proxy graph refinement,” IEEE Transactions on Neural Networks and Learning Systems , 2021
2021
Later among the works it cites.
W. Xia, S. Wang, M. Yang, Q. Gao, J. Han, and X. Gao, “Multi-view graph embedding clustering network: Joint self-supervision and block diagonal representation,” Neural Networks , vol. 145, pp. 1–9, 2022
2022
Closest in time.
Y. Liu, W. Tu, S. Zhou, X. Liu, L. Song, X. Yang, and E. Zhu, “Deep graph clustering via dual correlation reduction,” in AAAI Conference on Artificial Intelligence , 2022
2022
Closest in time.
C. Wang, S. Pan, P. Y. Celina, R. Hu, G. Long, and C. Zhang, “Deep neighbor-aware embedding for node clustering in attributed graphs,” Pattern Recognition , vol. 122, p. 108230, 2022
2022
Closest in time.
Z. Kang, Z. Liu, S. Pan, and L. Tian, “Fine-grained attributed graph clustering,” in Proceedings of the 2022 SIAM International Conference on Data Mining (SDM) . SIAM, 2022, pp. 370–378
2022
Closest in time.
2022
Closest in time.
2022
Closest in time.
2022
Closest in time.
Y. Zhu, Y. Xu, F. Yu, Q. Liu, S. Wu, and L. Wang, “Graph contrastive learning with adaptive augmentation,” in Proceedings of the Web Conference 2021 , 2021, pp. 2069–2080
2080
Closest in time.