Fetching the paper…
Reading the bibliography…
Graph clustering, which aims to divide nodes in the graph into several distinct clusters, is a fundamental yet challenging task.
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) , 1979
1979
Earlier work this paper cites.
M. D. Plummer and L. Lovász, Matching theory . Elsevier, 1986
1986
Earlier work this paper cites.
S. K. Pal and S. Mitra, “Multilayer perceptron, fuzzy sets, classifiaction,” 1992
1992
Earlier work this paper cites.
L. Lovász, “Random walks on graphs,” Combinatorics, Paul erdos is eighty , 1993
1993
Earlier work this paper cites.
R. S. Nickerson, “Confirmation bias: A ubiquitous phenomenon in many guises,” Review of general psychology , 1998
1998
Earlier work this paper cites.
K. Y. Yeung and W. L. Ruzzo, “Details of the adjusted rand index and clustering algorithms, supplement to the paper an empirical study on principal component analysis for clustering gene expression data,” Bioinformatics , 2001
2001
Earlier work this paper cites.
S. Petrovic, “A comparison between the silhouette index and the davies-bouldin index in labelling ids clusters,” in Proceedings of the 11th Nordic workshop of secure IT systems , 2006
2006
Earlier work this paper cites.
U. Von Luxburg, “A tutorial on spectral clustering,” Statistics and computing , 2007
2007
Earlier work this paper cites.
S. Aranganayagi and K. Thangavel, “Clustering categorical data using silhouette coefficient as a relocating measure,” in International conference on computational intelligence and multimedia applications (ICCIMA 2007) , 2007
2007
Earlier work this paper cites.
D. A. Reynolds, “Gaussian mixture models.” Encyclopedia of biometrics , 2009
2009
Earlier work this paper cites.
L. Bottou, “Large-scale machine learning with stochastic gradient descent,” in Proceedings of COMPSTAT’2010 , 2010
2010
Earlier work this paper cites.
A. Ng et al. , “Sparse autoencoder,” CS294A Lecture notes , 2011
2011
Earlier work this paper cites.
2011
Earlier work this paper cites.
C. R. Shalizi and A. C. Thomas, “Homophily and contagion are generically confounded in observational social network studies,” Sociological methods & research , 2011
2011
Earlier work this paper cites.
P. Baldi, “Autoencoders, unsupervised learning, and deep architectures,” in Proceedings of ICML workshop on unsupervised and transfer learning , 2012
2012
Earlier work this paper cites.
P. Makwana, T. Kodinariya, and P. Makwana, “Review on determining of cluster in k-means clustering review on determining number of cluster in k-means clustering,” International Journal of Advance Research in Computer Science and Management Studies , 2013
2013
Earlier work this paper cites.
F. Tian, B. Gao, Q. Cui, E. Chen, and T.-Y. Liu, “Learning deep representations for graph clustering,” in Proc. of AAAI , 2014
2014
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,” Proc. of NeurIPS , 2014
2014
Earlier work this paper cites.
2014
Earlier work this paper cites.
2014
Earlier work this paper cites.
M. Li, T. Zhang, Y. Chen, and A. J. Smola, “Efficient mini-batch training for stochastic optimization,” in Proc. of KDD , 2014
2014
Earlier work this paper cites.
A. Rodriguez and A. Laio, “Clustering by fast search and find of density peaks,” science , 2014
2014
Earlier work this paper cites.
Y. LeCun, Y. Bengio, and G. Hinton, “Deep learning,” nature , 2015
2015
Earlier work this paper cites.
S. Chang, W. Han, J. Tang, G.-J. Qi, C. C. Aggarwal, and T. S. Huang, “Heterogeneous network embedding via deep architectures,” in Proc. of KDD , 2015
2015
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.
S. Cao, W. Lu, and Q. Xu, “Deep neural networks for learning graph representations,” in Proc. of AAAI , 2016
2016
Earlier work this paper cites.
J. Xie, R. Girshick, and A. Farhadi, “Unsupervised deep embedding for clustering analysis,” in Proc. of ICML , 2016
2016
Earlier work this paper cites.
S. Zheng, Y. Song, T. Leung, and I. Goodfellow, “Improving the robustness of deep neural networks via stability training,” in Proc. of CVPR , 2016
2016
Earlier work this paper cites.
2016
Earlier work this paper cites.
A. Grover and J. Leskovec, “node2vec: Scalable feature learning for networks,” in Proc. of KDD , 2016
2016
Earlier work this paper cites.
J. Newling and F. Fleuret, “Nested mini-batch k-means,” Proc. of NeurIPS , 2016
2016
Earlier work this paper cites.
T. N. Kipf and M. Welling, “Semi-supervised classification with graph convolutional networks,” in Proc. of ICLR , 2017
2017
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
2017
Earlier work this paper cites.
X. Guo, L. Gao, X. Liu, and J. Yin, “Improved deep embedded clustering with local structure preservation.” in Proc. of IJCAI , 2017
2017
Earlier work this paper cites.
2017
Earlier work this paper cites.
W. Hamilton, Z. Ying, and J. Leskovec, “Inductive representation learning on large graphs,” Proc. of NeurIPS , 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 Proc. of ICML , 2017
2017
Earlier work this paper cites.
K. Arulkumaran, M. P. Deisenroth, M. Brundage, and A. A. Bharath, “Deep reinforcement learning: A brief survey,” IEEE Signal Processing Magazine , 2017
2017
Earlier work this paper cites.
S. Cavallari, V. W. Zheng, H. Cai, K. C.-C. Chang, and E. Cambria, “Learning community embedding with community detection and node embedding on graphs,” in Proceedings of the 2017 ACM on Conference on Information and Knowledge Management , 2017
2017
Earlier work this paper cites.
P. Veličković, G. Cucurull, A. Casanova, A. Romero, P. Liò, and Y. Bengio, “Graph attention networks,” in Proc. of ICLR , 2018
2018
Earlier work this paper cites.
2018
Earlier work this paper cites.
E. Min, X. Guo, Q. Liu, G. Zhang, J. Cui, and J. Long, “A survey of clustering with deep learning: From the perspective of network architecture,” IEEE Access , 2018
2018
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 Proc. of IJCAI , 2018
2018
Earlier work this paper cites.
Z. Ying, J. You, C. Morris, X. Ren, W. Hamilton, and J. Leskovec, “Hierarchical graph representation learning with differentiable pooling,” Proc. of NeurIPS , 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 Proc. of ICLR , 2018
2018
Earlier work this paper cites.
C. Tu, X. Zeng, H. Wang, Z. Zhang, Z. Liu, M. Sun, B. Zhang, and L. Lin, “A unified framework for community detection and network representation learning,” IEEE Transactions on Knowledge and Data Engineering , 2018
2018
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 , 2019
2019
Earlier work this paper cites.
H. Gao, J. Pei, and H. Huang, “Progan: Network embedding via proximity generative adversarial network,” in Proc. of KDD , 2019
2019
Earlier work this paper cites.
Y. Jia, Q. Zhang, W. Zhang, and X. Wang, “Communitygan: Community detection with generative adversarial nets,” in Proc. of WWW , 2019
2019
Earlier work this paper cites.
2019
Earlier work this paper cites.
J. Park, M. Lee, H. J. Chang, K. Lee, and J. Y. Choi, “Symmetric graph convolutional autoencoder for unsupervised graph representation learning,” in Proc. of ICCV , 2019
2019
Earlier work this paper cites.
X. Zhang, H. Liu, Q. Li, and X.-M. Wu, “Attributed graph clustering via adaptive graph convolution,” in Proc. of IJCAI , 2019
2019
Earlier work this paper cites.
J. Lee, I. Lee, and J. Kang, “Self-attention graph pooling,” in Proc. of ICML , 2019
2019
Earlier work this paper cites.
P. Velickovic, W. Fedus, W. L. Hamilton, P. Liò, Y. Bengio, and R. D. Hjelm, “Deep graph infomax.” ICLR (Poster) , 2019
2019
Earlier work this paper cites.
2019
Earlier work this paper cites.
A. Lutov, M. Khayati, and P. Cudré-Mauroux, “Accuracy evaluation of overlapping and multi-resolution clustering algorithms on large datasets,” in 2019 IEEE International Conference on Big Data and Smart Computing (BigComp) , 2019
2019
Earlier work this paper cites.
X. Wang and Y. Xu, “An improved index for clustering validation based on silhouette index and calinski-harabasz index,” in IOP Conference Series: Materials Science and Engineering , 2019
2019
Earlier work this paper cites.
D. Jin, B. Li, P. Jiao, D. He, and W. Zhang, “Network-specific variational auto-encoder for embedding in attribute networks.” in Proc. of IJCAI , 2019
2019
Earlier work this paper cites.
2019
Earlier work this paper cites.
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.
Z. Wang, L. Zheng, Y. Li, and S. Wang, “Linkage based face clustering via graph convolution network,” in Proc. of CVPR , 2019
2019
Cited alongside, same era.
B. Rozemberczki, R. Davies, R. Sarkar, and C. Sutton, “Gemsec: Graph embedding with self clustering,” in Proceedings of the 2019 IEEE/ACM international conference on advances in social networks analysis and mining , 2019
2019
Cited alongside, same era.
H. Alashwal, M. El Halaby, J. J. Crouse, A. Abdalla, and A. A. Moustafa, “The application of unsupervised clustering methods to alzheimer’s disease,” Frontiers in computational neuroscience , 2019
2019
Cited alongside, same era.
K. Liang, Y. Liu, S. Zhou, X. Liu, and W. Tu, “Relational symmetry based knowledge graph contrastive learning,” 2022
2022
Closest in time.
Y. Liu, Y. Zheng, D. Zhang, H. Chen, H. Peng, and S. Pan, “Towards unsupervised deep graph structure learning,” in Proceedings of the ACM Web Conference 2022 , 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 Proc. of AAAI , 2022
2022
Closest in time.
2022
Closest in time.
F. Devvrit, A. Sinha, I. Dhillon, and P. Jain, “S3gc: Scalable self-supervised graph clustering,” 2022
2022
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2020
Cited alongside, same era.
2020
Cited alongside, same era.
F. M. Bianchi, D. Grattarola, and C. Alippi, “Spectral clustering with graph neural networks for graph pooling,” in Proc. of ICML , 2020
2020
Cited alongside, same era.
S. Fan, X. Wang, C. Shi, E. Lu, K. Lin, and B. Wang, “One2multi graph autoencoder for multi-view graph clustering,” in Proc. of WWW , 2020
2020
Cited alongside, same era.
K. He, H. Fan, Y. Wu, S. Xie, and R. Girshick, “Momentum contrast for unsupervised visual representation learning,” in Proc. of CVPR , 2020
2020
Cited alongside, same era.
T. Chen, S. Kornblith, M. Norouzi, and G. Hinton, “A simple framework for contrastive learning of visual representations,” in Proc. of ICML , 2020
2020
Cited alongside, same era.
2020
Cited alongside, same era.
Y. Zhu, Y. Xu, F. Yu, Q. Liu, S. Wu, and L. Wang, “Deep Graph Contrastive Representation Learning,” in ICML Workshop on Graph Representation Learning and Beyond , 2020
2020
Cited alongside, same era.
2022
Closest in time.
H. Zhang, P. Li, R. Zhang, and X. Li, “Embedding graph auto-encoder for graph clustering,” IEEE Transactions on Neural Networks and Learning Systems , 2022
2022
Closest in time.
P. Zhu, J. Li, Y. Wang, B. Xiao, S. Zhao, and Q. Hu, “Collaborative decision-reinforced self-supervision for attributed graph clustering,” IEEE Transactions on Neural Networks and Learning Systems , 2022
2022
Closest in time.
L. Guo and Q. Dai, “Graph clustering via variational graph embedding,” Pattern Recognition , 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 , 2022
2022
Closest in time.
L. Yu, S. Pei, L. Ding, J. Zhou, L. Li, C. Zhang, and X. Zhang, “Sail: Self-augmented graph contrastive learning,” in Proc. of AAAI , 2022
2022
Closest in time.
W. Xia, Q. Wang, Q. Gao, M. Yang, and X. Gao, “Self-consistent contrastive attributed graph clustering with pseudo-label prompt,” IEEE Transactions on Multimedia , 2022
2022
Closest in time.
2022
Closest in time.
——, “Deep attention-guided graph clustering with dual self-supervision,” IEEE Transactions on Circuits and Systems for Video Technology , 2022
2022
Closest in time.
Z. Zhong, G. Gonzalez, D. Grattarola, and J. Pang, “Unsupervised network embedding beyond homophily,” Transactions on Machine Learning Research , 2022
2022
Closest in time.
2022
Closest in time.
L. Gong, S. Zhou, X. Liu, and W. Tu, “Attributed graph clustering with dual redundancy reduction,” in Proc. of IJCAI , 2022
2022
Closest in time.
R. A. Khan and M. Kleinsteuber, “Cluster-aware heterogeneous information network embedding,” in Proc. of WSDM , 2022
2022
Closest in time.
T. Li, W. Wang, P. Jiao, Y. Wang, R. Ding, H. Wu, L. Pan, and D. Jin, “Exploring temporal community structure via network embedding,” IEEE Transactions on Cybernetics , 2022
2022
Closest in time.
N. Park, R. Rossi, E. Koh, I. A. Burhanuddin, S. Kim, F. Du, N. Ahmed, and C. Faloutsos, “Cgc: Contrastive graph clustering forcommunity detection and tracking,” in Proceedings of the ACM Web Conference 2022 , 2022
2022
Closest in time.
M. Ju, T. Zhao, Q. Wen, W. Yu, N. Shah, Y. Ye, and C. Zhang, “Multi-task self-supervised graph neural networks enable strongefr task generalization,” in Proc. of ICLR , 2022
2022
Closest in time.
L. Li, S. Wang, X. Liu, E. Zhu, L. Shen, K. Li, and K. Li, “Local sample-weighted multiple kernel clustering with consensus discriminative graph,” IEEE Trans. Neural Networks , 2022
2022
Closest in time.
J. Zhang, L. Li, S. Wang, J. Liu, Y. Liu, X. Liu, and E. Zhu, “Multiple kernel clustering with dual noise minimization,” in Proc. of the 30-th ACM Int. Conf. Multimedia, Lisboa, Portugal , 2022
2022
Closest in time.
2022
Closest in time.
W. Tu, S. Zhou, X. Liu, Y. Liu, Z. Cai, E. Zhu, Z. Changwang, and J. Cheng, “Initializing then refining: A simple graph attribute imputation network,” IJCAI, pages , 2022
2022
Closest in time.
J. Xia, L. Wu, G. Wang, J. Chen, and S. Z. Li, “Progcl: Rethinking hard negative mining in graph contrastive learning,” in Proc. of ICML , 2022
2022
Closest in time.
S. Wang, X. Liu, L. Liu, W. Tu, X. Zhu, J. Liu, S. Zhou, and E. Zhu, “Highly-efficient incomplete large-scale multi-view clustering with consensus bipartite graph,” in Proc. of CVPR , 2022
2022
Closest in time.
W. Xia, Q. Gao, Q. Wang, X. Gao, C. Ding, and D. Tao, “Tensorized bipartite graph learning for multi-view clustering,” IEEE Transactions on Pattern Analysis and Machine Intelligence , 2022
2022
Closest in time.
Y. Liu, M. Jin, S. Pan, C. Zhou, Y. Zheng, F. Xia, and S. Y. Philip, “Graph self-supervised learning: A survey,” IEEE Transactions on Knowledge and Data Engineering , 2022
2022
Closest in time.
2022
Closest in time.
Y. Chen, Z. Liu, J. Li, J. McAuley, and C. Xiong, “Intent contrastive learning for sequential recommendation,” in Proceedings of the ACM Web Conference 2022 , 2022
2022
Closest in time.
G. Grunig, N. Durmus, Y. Zhang, Y. Lu, S. Pehlivan, Y. Wang, K. Doo, M. L. Cotrina-Vidal, R. Goldring, K. I. Berger et al. , “Molecular clustering analysis of blood biomarkers in world trade center exposed community members with persistent lower respiratory symptoms,” International journal of environmental research and public health , 2022
2022
Closest in time.
2022
Closest in time.
H. Xue, V. Mallawaarachchi, Y. Zhang, V. Rajan, and Y. Lin, “Repbin: Constraint-based graph representation learning for metagenomic binning,” in Proc. of AAAI , 2022
2022
Closest in time.
K. Liang, L. Meng, M. Liu, Y. Liu, W. Tu, S. Wang, S. Zhou, and X. Liu, “Learn from relational correlations and periodic events for temporal knowledge graph reasoning,” in Proc. of SIGIR , 2023
2023
Closest in time.
2023
Closest in time.
K. Liang, J. Tan, D. Zeng, Y. Huang, X. Huang, and G. Tan, “Abslearn: a gnn-based framework for aliasing and buffer-size information retrieval,” Pattern Analysis and Applications , 2023
2023
Closest in time.
S. Wang, J. Yang, J. Yao, Y. Bai, and W. Zhu, “An overview of advanced deep graph node clustering,” IEEE Transactions on Computational Social Systems , 2023
2023
Closest in time.
A. Tsitsulin, J. Palowitch, B. Perozzi, and E. Müller, “Graph clustering with graph neural networks,” Journal of Machine Learning Research , 2023
2023
Closest in time.
2023
Closest in time.
Y. Liu, X. Yang, S. Zhou, and X. Liu, “Simple contrastive graph clustering,” IEEE Transactions on Neural Networks and Learning Systems , 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 Proc. of AAAI , 2023
2023
Closest in time.
X. Yang, Y. Liu, S. Zhou, S. Wang, W. Tu, Q. Zheng, X. Liu, L. Fang, and E. Zhu, “Cluster-guided contrastive graph clustering network,” in Proc. of AAAI , 2023
2023
Closest in time.
Y. Liu, K. Liang, J. Xia, S. Zhou, X. Yang, X. Liu, and S. Z. Li, “Dink-net: Neural clustering on large graphs,” in Proc. of ICML , 2023
2023
Closest in time.
W. Shiao, U. S. Saini, Y. Liu, T. Zhao, N. Shah, and E. E. Papalexakis, “Carl-g: Clustering-accelerated representation learning on graphs,” ACM SIGKDD Explorations Newsletter , 2023
2023
Closest in time.
L. Sun, F. Wang, J. Ye, H. Peng, and P. S. Yu, “Contrastive graph clustering in curvature spaces,” 2023
2023
Closest in time.
E. Pan and Z. Kang, “Beyond homophily: Reconstructing structure for graph-agnostic clustering,” 2023
2023
Closest in time.
Y. Wen, S. Wang, Q. Liao, W. Liang, K. Liang, X. Wan, and X. Liu, “Unpaired multi-view graph clustering with cross-view structure matching,” IEEE Transactions on Neural Networks and Learning Systems , 2023
2023
Closest in time.
Y. Liu, K. Liang, J. Xia, X. Yang, S. Zhou, M. Liu, X. Liu, and S. Z. Li, “Reinforcement graph clustering with unknown cluster number,” 2023
2023
Closest in time.
2023
Closest in time.
W. Li, S. Wang, X. Guo, and E. Zhu, “Deep graph clustering with multi-level subspace fusion,” Pattern Recognition , 2023
2023
Closest in time.
S. Ding, B. Wu, X. Xu, L. Guo, and L. Ding, “Graph clustering network with structure embedding enhanced,” Pattern Recognition , 2023
2023
Closest in time.
H. Liang and J. Gao, “Wasserstein adversarially regularized graph autoencoder,” Neurocomputing , 2023
2023
Closest in time.
2023
Closest in time.
2023
Closest in time.
L. Li, J. Zhang, S. Wang, X. Liu, K. Li, and K. Li, “Multi-view bipartite graph clustering with coupled noisy feature filter,” IEEE Trans. Knowl. Data Eng. , 2023
2023
Closest in time.
2023
Closest in time.
R. Jiang, S. Han, Y. Yu, and W. Ding, “An access control model for medical big data based on clustering and risk,” Information Sciences , 2023
2023
Closest in time.