Fetching the paper…
Reading the bibliography…
Deep graph embedding is an important approach for community discovery.
D. D. Lee and H. S. Seung, “Learning the parts of objects by non-negative matrix factorization,” Nature , vol. 401, no. 6755, pp. 788–791, 1999
1999
Earlier work this paper cites.
S. T. Roweis and L. K. Saul, “Nonlinear dimensionality reduction by locally linear embedding,” Science , vol. 290, no. 5500, pp. 2323–2326, 2000
2000
Earlier work this paper cites.
M. Belkin and P. Niyogi, “Laplacian eigenmaps and spectral techniques for embedding and clustering,” in Advances in Neural Information Processing Systems , 2002, pp. 585–591
2002
Earlier work this paper cites.
M. E. Newman and M. Girvan, “Finding and evaluating community structure in networks,” Physical review E , vol. 69, no. 2, p. 026113, 2004
2004
Earlier work this paper cites.
2013
Earlier work this paper cites.
B. Perozzi, R. Al-Rfou, and S. Skiena, “Deepwalk: Online learning of social representations,” in Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining , 2014, pp. 701–710
2014
Earlier work this paper cites.
J. Yang and J. Leskovec, “Defining and evaluating network communities based on ground-truth,” Knowledge and Information Systems , vol. 42, no. 1, pp. 181–213, 2015
2015
Earlier work this paper cites.
J. Tang, M. Qu, M. Wang, M. Zhang, J. Yan, and Q. Mei, “Line: Large-scale information network embedding,” in Proceedings of the 24th International Conference on World Wide Web , 2015, pp. 1067–1077
2015
Earlier work this paper cites.
2015
Earlier work this paper cites.
J. Tang, “Computational models for social network analysis: A brief survey,” in Proceedings of the 26th International Conference on World Wide Web Companion , 2017, pp. 921–925
2017
Earlier work this paper cites.
T. Pang, F. Nie, and J. Han, “Flexible orthogonal neighborhood preserving embedding.” in The Twenty-Sixth International Joint Conference on Artificial Intelligence , 2017, pp. 2592–2598
2017
Earlier work this paper cites.
X. Wang, P. Cui, J. Wang, J. Pei, W. Zhu, and S. Yang, “Community preserving network embedding.” in The Thirty-First AAAI Conference on Artificial Intelligence , 2017, pp. 203–209
2017
Earlier work this paper cites.
L. F. Ribeiro, P. H. Saverese, and D. R. Figueiredo, “struc2vec: Learning node representations from structural identity,” in Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining , 2017, pp. 385–394
2017
Earlier work this paper cites.
Y. Dong, N. V. Chawla, and A. Swami, “metapath2vec: Scalable representation learning for heterogeneous networks,” in Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining , 2017, pp. 135–144
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.
W. Hamilton, Z. Ying, and J. Leskovec, “Inductive representation learning on large graphs,” in Advances in Neural Information Processing Systems , 2017, pp. 1024–1034
2017
Earlier work this paper cites.
P. Cui, X. Wang, J. Pei, and W. Zhu, “A survey on network embedding,” IEEE Transactions on Knowledge and Data Engineering , vol. 31, no. 5, pp. 833–852, 2018
2018
Earlier work this paper cites.
Z. Zhang, P. Cui, X. Wang, J. Pei, X. Yao, and W. Zhu, “Arbitrary-order proximity preserved network embedding,” in Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining , 2018, pp. 2778–2786
2018
Earlier work this paper cites.
F. Ye, C. Chen, and Z. Zheng, “Deep autoencoder-like nonnegative matrix factorization for community detection,” in Proceedings of the 27th ACM International Conference on Information and Knowledge Management , 2018, pp. 1393–1402
2018
Cited alongside, same era.
A. Bojchevski and S. G¨¹nnemann, “Deep gaussian embedding of graphs: Unsupervised inductive learning via ranking,” in International Conference on Learning Representations , 2018
2018
Cited alongside, same era.
Z. Du, X. Wang, H. Yang, J. Zhou, and J. Tang, “Sequential scenario-specific meta learner for online recommendation,” in Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining , 2019, pp. 2895–2904
2019
Cited alongside, same era.
W. Zhang, B. Paudel, L. Wang, J. Chen, H. Zhu, W. Zhang, A. Bernstein, and H. Chen, “Iteratively learning embeddings and rules for knowledge graph reasoning,” in The World Wide Web Conference , 2019, pp. 2366–2377
2019
Cited alongside, same era.
K. Xu, W. Hu, J. Leskovec, and S. Jegelka, “How powerful are graph neural networks?” in International Conference on Learning Representations , 2020
2020
Later among the works it cites.
A. Loukas, “What graph neural networks cannot learn: depth vs width,” in International Conference on Learning Representations , 2020
2020
Later among the works it cites.
M. Chen, Z. Wei, Z. Huang, B. Ding, and Y. Li, “Simple and deep graph convolutional networks,” in Proceedings of the 37th International Conference on Machine Learning , 2020
2020
Later among the works it cites.
Y. Rong, W. Huang, T. Xu, and J. Huang, “Dropedge: Towards deep graph convolutional networks on node classification,” in International Conference on Learning Representations , 2020
2020
Later among the works it cites.
D. Chen, L. Jacob, and J. Mairal, “Convolutional kernel networks for graph-structured data,” in Proceedings of the 37th International Conference on Machine Learning , 2020
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
L. Liu, Y. Ma, X. Zhu, Y. Yang, X. Hao, L. Wang, and J. Peng, “Integrating sequence and network information to enhance protein-protein interaction prediction using graph convolutional networks,” in 2019 IEEE International Conference on Bioinformatics and Biomedicine . IEEE, 2019, pp. 1762–1768
2019
Cited alongside, same era.
J. Qiu, Y. Dong, H. Ma, J. Li, C. Wang, K. Wang, and J. Tang, “Netsmf: Large-scale network embedding as sparse matrix factorization,” in The World Wide Web Conference , 2019, pp. 1509–1520
2019
Cited alongside, same era.
Z. Qiu, W. Hu, J. Wu, Z. Tang, and X. Jia, “Noise-resilient similarity preserving network embedding for social networks.” in The Twenty-Eighth International Joint Conference on Artificial Intelligence , 2019, pp. 3282–3288
2019
Cited alongside, same era.
J. Guo, L. Xu, and J. Liu, “Spine: Structural identity preserved inductive network embedding,” in The Twenty-Eighth International Joint Conference on Artificial Intelligence , 2019, pp. 2399–2405
2019
Cited alongside, same era.
D. Jin, X. You, W. Li, D. He, P. Cui, F. Fogelman-Soulié, and T. Chakraborty, “Incorporating network embedding into markov random field for better community detection,” in The Thirty-Third AAAI Conference on Artificial Intelligence , 2019, pp. 160–167
2019
Cited alongside, same era.
C. Wang, S. Pan, R. Hu, G. Long, J. Jiang, and C. Zhang, “Attributed graph clustering: A deep attentional embedding approach,” in The Twenty-Eighth International Joint Conference on Artificial Intelligence , 2019, pp. 3670–3676
2019
Cited alongside, same era.
J. Zhang, Y. Dong, Y. Wang, J. Tang, and M. Ding, “Prone: Fast and scalable network representation learning,” in The 28th International Joint Conference on Artificial Intelligence , 2019, pp. 4278–4284
2019
Cited alongside, same era.
A. Hollocou, T. Bonald, and M. Lelarge, “Modularity-based sparse soft graph clustering,” in The 22nd International Conference on Artificial Intelligence and Statistics , 2019, pp. 323–332
2019
Cited alongside, same era.
2020
Later among the works it cites.
Z. Peng, W. Huang, M. Luo, Q. Zheng, Y. Rong, T. Xu, and J. Huang, “Graph representation learning via graphical mutual information maximization,” in Proceedings of The Web Conference 2020 , 2020, pp. 259–270
2020
Later among the works it cites.
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
Later among the works it cites.
X. Zhang, C. Xu, and D. Tao, “On dropping clusters to regularize graph convolutional neural networks,” in The 16th European Conference on Computer Vision , 2020
2020
Later among the works it cites.
S. Fan, X. Wang, C. Shi, E. Lu, K. Lin, and B. Wang, “One2multi graph autoencoder for multi-view graph clustering,” in Proceedings of The Web Conference 2020 , 2020, pp. 3070–3076
2020
Later among the works it cites.
X. Wang, M. Zhu, D. Bo, P. Cui, C. Shi, and J. Pei, “Am-gcn: Adaptive multi-channel graph convolutional networks,” in Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining , 2020, pp. 1243–1253
2020
Later among the works it cites.
2020
Later among the works it cites.
2020
Later among the works it cites.
J. Qiu, Q. Chen, Y. Dong, J. Zhang, H. Yang, M. Ding, K. Wang, and J. Tang, “Gcc: Graph contrastive coding for graph neural network pre-training,” in Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining , 2020, pp. 1150–1160
2020
Later among the works it cites.
Z. Yang, M. Ding, C. Zhou, H. Yang, J. Zhou, and J. Tang, “Understanding negative sampling in graph representation learning,” in Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining , 2020, pp. 1666–1676
2020
Later among the works it cites.
Y. Chen, X. Dai, M. Liu, D. Chen, L. Yuan, and Z. Liu, “Dynamic relu,” in The 16th European Conference on Computer Vision , 2020
2020
Later among the works it cites.
T. Chen, S. Kornblith, M. Norouzi, and G. Hinton, “A simple framework for contrastive learning of visual representations,” in Proceedings of the 37th International Conference on Machine Learning , 2020
2020
Later among the works it cites.
Z. Zhou, W. Wang, W. Gao, and L. Zhang, Introduction to The Theory of Machine Learning . China Machine Press, 2020
2020
Later among the works it cites.