Fetching the paper…
Reading the bibliography…
Graph embedding aims to transfer a graph into vectors to facilitate subsequent graph analytics tasks like link prediction and graph clustering.
S. Pan, J. Wu, X. Zhu, C. Zhang, and Y. Wang, “Tri-party deep network representation,” in IJCAI , 2016, pp. 1895–1901
1901
Earlier work this paper cites.
Q. Lu and L. Getoor, “Link-based classification,” in ICML , 2003, pp. 496–503
2003
Earlier work this paper cites.
P. Sen, G. Namata, M. Bilgic, and et.al, “Collective classification in network data,” AI magazine , vol. 29, no. 3, p. 93, 2008
2008
Earlier work this paper cites.
J. Chang and D. Blei, “Relational topic models for document networks,” in Artificial Intelligence and Statistics , 2009, pp. 81–88
2009
Earlier work this paper cites.
L. Tang and H. Liu, “Leveraging social media networks for classification,” DMKD , vol. 23, no. 3, pp. 447–478, 2011
2011
Earlier work this paper cites.
G. Namata, B. London, L. Getoor, and et.al, “Query-driven active surveying for collective classification,” in MLG , 2012
2012
Earlier work this paper cites.
J. Leskovec and J. J. Mcauley, “Learning to discover social circles in ego networks,” in NIPS , 2012, pp. 539–547
2012
Earlier work this paper cites.
2013
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 SIGKDD . ACM, 2014, pp. 701–710
2014
Earlier work this paper cites.
I. Goodfellow, J. Pouget-Abadie, M. Mirza, and et.al, “Generative adversarial nets,” in NIPS , 2014, pp. 2672–2680
2014
Earlier work this paper cites.
F. Tian, B. Gao, Q. Cui, and et.al, “Learning deep representations for graph clustering.” in AAAI , 2014, pp. 1293–1299
2014
Earlier work this paper cites.
R. Xia, Y. Pan, L. Du, and et.al, “Robust multi-view spectral clustering via low-rank and sparse decomposition.” in AAAI , 2014, pp. 2149–2155
2014
Earlier work this paper cites.
S. Pan, J. Wu, and X. Zhu, “Cogboost: Boosting for fast cost-sensitive graph classification,” IEEE Trans. Knowl. Data Eng. , vol. 27, no. 11, pp. 2933–2946, 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 WWW , 2015, pp. 1067–1077
2015
Earlier work this paper cites.
S. Cao, W. Lu, and Q. Xu, “Grarep: Learning graph representations with global structural information,” in CIKM . ACM, 2015, pp. 891–900
2015
Earlier work this paper cites.
2015
Earlier work this paper cites.
2015
Earlier work this paper cites.
C. Yang, Z. Liu, D. Zhao, and et.al, “Network representation learning with rich text information.” in IJCAI , 2015, pp. 2111–2117
2015
Earlier work this paper cites.
2016
Earlier work this paper cites.
S. Pan, J. Wu, X. Zhu, C. Zhang, and P. S. Yu, “Joint structure feature exploration and regularization for multi-task graph classification,” IEEE Trans. Knowl. Data Eng. , vol. 28, no. 3, pp. 715–728, 2016
2016
Earlier work this paper cites.
X. Cao, Y. Zheng, C. Shi, J. Li, and B. Wu, “Link prediction in schema-rich heterogeneous information network,” in PAKDD . Springer, 2016, pp. 449–460
2016
Earlier work this paper cites.
A. Grover and J. Leskovec, “node2vec: Scalable feature learning for networks,” in SIGKDD . ACM, 2016, pp. 855–864
2016
Cited alongside, same era.
M. Ou, P. Cui, J. Pei, and et.al, “Asymmetric transitivity preserving graph embedding.” in KDD , 2016, pp. 1105–1114
2016
Cited alongside, same era.
D. Wang, P. Cui, and W. Zhu, “Structural deep network embedding,” in SIGKDD . ACM, 2016, pp. 1225–1234
2016
Cited alongside, same era.
S. Cao, W. Lu, and Q. Xu, “Deep neural networks for learning graph representations.” in AAAI , 2016, pp. 1145–1152
2016
Cited alongside, same era.
2016
Cited alongside, same era.
2017
Later among the works it cites.
F. Xiong, X. Wang, S. Pan, H. Yang, H. Wang, and C. Zhang, “Social recommendation with evolutionary opinion dynamics,” IEEE Transactions on Systems, Man, and Cybernetics: Systems , no. 99, pp. 1–13, 2018
2018
Later among the works it cites.
H. Cai, V. W. Zheng, and K. C.-C. Chang, “A comprehensive survey of graph embedding: Problems, techniques and applications,” IEEE Transactions on Knowledge and Data Engineering , 2018
2018
Later among the works it cites.
C. Shi, B. Hu, W. X. Zhao, and S. Y. Philip, “Heterogeneous information network embedding for recommendation,” IEEE Transactions on Knowledge and Data Engineering , vol. 31, no. 2, pp. 357–370, 2018
2018
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2016
Cited alongside, same era.
2016
Cited alongside, same era.
J. Li, J. Zhu, and B. Zhang, “Discriminative deep random walk for network classification,” in ACL , vol. 1, 2016, pp. 1004–1013
2016
Cited alongside, same era.
2016
Cited alongside, same era.
2016
Cited alongside, same era.
T. N. Kipf and M. Welling, “Variational graph auto-encoders,” NIPS , 2016
2016
Cited alongside, same era.
C. Wang, S. Pan, G. Long, X. Zhu, and J. Jiang, “Mgae: Marginalized graph autoencoder for graph clustering,” in CIKM . ACM, 2017, pp. 889–898
2017
Cited alongside, same era.
P. Cui, X. Wang, J. Pei, and W. Zhu, “A survey on network embedding,” IEEE Transactions on Knowledge and Data Engineering , 2018
2018
Later among the works it cites.
D. Zhang, J. Yin, X. Zhu, and C. Zhang, “Network representation learning: A survey,” IEEE Transactions on Big Data , 2018
2018
Later among the works it cites.
X. Shen and F. Chung, “Deep network embedding for graph representation learning in signed networks,” IEEE Transactions on Cybernetics , pp. 1–8, 2018
2018
Later among the works it cites.
D. Zhu, P. Cui, Z. Zhang, J. Pei, and W. Zhu, “High-order proximity preserved embedding for dynamic networks,” IEEE Transactions on Knowledge and Data Engineering , 2018
2018
Later among the works it cites.
H. Chen, B. Perozzi, Y. Hu, and S. Skiena, “HARP: hierarchical representation learning for networks,” in AAAI , 2018
2018
Later among the works it cites.
X. Shen, S. Pan, W. Liu, Y. Ong, and Q. Sun, “Discrete network embedding,” in IJCAI , 2018, pp. 3549–3555
2018
Later among the works it cites.
L. Liao, X. He, H. Zhang, and T.-S. Chua, “Attributed social network embedding,” IEEE Transactions on Knowledge and Data Engineering , pp. 1–1, 2018
2018
Later among the works it cites.
H. Yang, S. Pan, P. Zhang, L. Chen, D. Lian, and C. Zhang, “Binarized attributed network embedding,” in ICDM . IEEE, 2018, pp. 1476–1481
2018
Later among the works it cites.
Q. Dai, Q. Li, J. Tang, and D. Wang, “Adversarial network embedding,” in AAAI , 2018
2018
Later among the works it cites.
W. Yu, C. Zheng, W. Cheng, C. C. Aggarwal, D. Song, B. Zong, H. Chen, and W. Wang, “Learning deep network representations with adversarially regularized autoencoders,” in SIGKDD . ACM, 2018, pp. 2663–2671
2018
Later among the works it cites.
M. Ding, J. Tang, and J. Zhang, “Semi-supervised learning on graphs with generative adversarial nets,” in CIKM . ACM, 2018, pp. 913–922
2018
Later among the works it cites.
S. Pan, R. Hu, G. Long, J. Jiang, L. Yao, and C. Zhang, “Adversarially regularized graph autoencoder for graph embedding.” in IJCAI , 2018, pp. 2609–2615
2018
Later among the works it cites.
X. Zhou, F. Shen, L. Liu, W. Liu, L. Nie, Y. Yang, and H. T. Shen, “Graph convolutional network hashing,” IEEE Transactions on Cybernetics , pp. 1–13, 2018
2018
Later among the works it cites.
J. You, R. Ying, X. Ren, W. Hamilton, and J. Leskovec, “Graphrnn: Generating realistic graphs with deep auto-regressive models,” in ICML , 2018, pp. 5694–5703
2018
Later among the works it cites.
2019
Closest in time.
Y. F. Binbin Hu and C. Shi, “Adversarial learning on heterogeneous information network,” in KDD . ACM, 2019
2019
Closest in time.
X. Wang, H. Ji, C. Shi, B. Wang, Y. Ye, P. Cui, and P. S. Yu, “Heterogeneous graph attention network,” in The World Wide Web Conference , 2019, pp. 2022–2032
2032
Closest in time.