Fetching the paper…
Reading the bibliography…
Heterogeneous graphs (HGs) also known as heterogeneous information networks have become ubiquitous in real-world scenarios; therefore, HG embedding, which aims to learn representations in a lower-dimension space while preserving the heterogeneous structures and semantics for downstream tasks (e.g., node/graph classification, node clustering, link prediction), has drawn considerable attentions in recent years.
B. Weisfeiler and A. A. Lehman, “A reduction of a graph to a canonical form and an algebra arising during this reduction,” Nauchno-Technicheskaya Informatsia , vol. 2, no. 9, pp. 12–16, 1968
1968
Earlier work this paper cites.
S. Helgason, Differential geometry, Lie groups, and symmetric spaces . Academic press, 1979
1979
Earlier work this paper cites.
R. Milo, S. Shen-Orr, S. Itzkovitz, N. Kashtan, D. Chklovskii, and U. Alon, “Network motifs: simple building blocks of complex networks,” Science , vol. 298, no. 5594, pp. 824–827, 2002
2002
Earlier work this paper cites.
G. Jeh and J. Widom, “Scaling personalized web search,” in WWW , 2003, pp. 271–279
2003
Earlier work this paper cites.
M. E. Newman, “Modularity and community structure in networks,” Proceedings of the national academy of sciences , vol. 103, no. 23, pp. 8577–8582, 2006
2006
Earlier work this paper cites.
J. Tang, J. Zhang, L. Yao, J. Li, L. Zhang, and Z. Su, “Arnetminer: extraction and mining of academic social networks,” in KDD . ACM, 2008, pp. 990–998
2008
Earlier work this paper cites.
Y. Sun, J. Han, X. Yan, P. S. Yu, and T. Wu, “Pathsim: Meta path-based top-k similarity search in heterogeneous information networks,” Proceedings of the VLDB Endowment , vol. 4, no. 11, pp. 992–1003, 2011
2011
Earlier work this paper cites.
A. P. Felt, M. Finifter, E. Chin, S. Hanna, and D. Wagner, “A survey of mobile malware in the wild,” in Proceedings of the 1st ACM workshop on Security and privacy in smartphones and mobile devices , 2011, pp. 3–14
2011
Earlier work this paper cites.
Y. Sun and J. Han, “Mining heterogeneous information networks: a structural analysis approach,” SIGKDD Explorations , vol. 14, no. 2, pp. 20–28, 2012
2012
Earlier work this paper cites.
A. Bordes, N. Usunier, A. Garcia-Duran, J. Weston, and O. Yakhnenko, “Translating embeddings for modeling multi-relational data,” in NIPS , 2013, pp. 2787–2795
2013
Earlier work this paper cites.
T. Mikolov, I. Sutskever, K. Chen, G. S. Corrado, and J. Dean, “Distributed representations of words and phrases and their compositionality,” in NIPS , 2013, pp. 3111–3119
2013
Earlier work this paper cites.
M. Jamali and L. V. S. Lakshmanan, “Heteromf: recommendation in heterogeneous information networks using context dependent factor models,” in WWW . International World Wide Web Conferences Steering Committee / ACM, 2013, pp. 643–654
2013
Earlier work this paper cites.
X. Yu, X. Ren, Y. Sun, B. Sturt, U. Khandelwal, Q. Gu, B. Norick, and J. Han, “Recommendation in heterogeneous information networks with implicit user feedback,” in RecSys . ACM, 2013, pp. 347–350
2013
Earlier work this paper cites.
B. Perozzi, R. Al-Rfou, and S. Skiena, “Deepwalk: Online learning of social representations,” in KDD , 2014, pp. 701–710
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,” in NIPS , 2014, pp. 2672–2680
2014
Earlier work this paper cites.
2014
Earlier work this paper cites.
C. Shi, X. Kong, Y. Huang, P. S. Yu, and B. Wu, “Hetesim: A general framework for relevance measure in heterogeneous networks,” IEEE Trans. Knowl. Data Eng. , vol. 26, no. 10, pp. 2479–2492, 2014
2014
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.
J. Tang, M. Qu, and Q. Mei, “Pte: Predictive text embedding through large-scale heterogeneous text networks,” in KDD . ACM, 2015, pp. 1165–1174
2015
Earlier work this paper cites.
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 KDD . ACM, 2015, pp. 119–128
2015
Earlier work this paper cites.
C. Shi, Z. Zhang, P. Luo, P. S. Yu, Y. Yue, and B. Wu, “Semantic path based personalized recommendation on weighted heterogeneous information networks,” in CIKM . ACM, 2015, pp. 453–462
2015
Earlier work this paper cites.
Z. Huang, Y. Zheng, R. Cheng, Y. Sun, N. Mamoulis, and X. Li, “Meta structure: Computing relevance in large heterogeneous information networks,” in KDD . ACM, 2016, pp. 1595–1604
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.
H. Gui, J. Liu, F. Tao, M. Jiang, B. Norick, and J. Han, “Large-scale embedding learning in heterogeneous event data,” in ICDM . IEEE, 2016, pp. 907–912
2016
Earlier work this paper cites.
A. Grover and J. Leskovec, “node2vec: Scalable feature learning for networks,” in KDD . ACM, 2016, pp. 855–864
2016
Earlier work this paper cites.
T. N. Kipf and M. Welling, “Variational graph auto-encoders,” CoRR , vol. abs/1611.07308, 2016
2016
Earlier work this paper cites.
S. Hou, Y. Ye, Y. Song, and M. Abdulhayoglu, “Hindroid: An intelligent android malware detection system based on structured heterogeneous information network,” in KDD , 2017, pp. 1507–1515
2017
Earlier work this paper cites.
Y. Dong, N. V. Chawla, and A. Swami, “metapath2vec: Scalable representation learning for heterogeneous networks,” in KDD . ACM, 2017, pp. 135–144
2017
Earlier work this paper cites.
T.-y. Fu, W.-C. Lee, and Z. Lei, “Hin2vec: Explore meta-paths in heterogeneous information networks for representation learning,” in CIKM . ACM, 2017, pp. 1797–1806
2017
Earlier work this paper cites.
C. Shi, Y. Li, J. Zhang, Y. Sun, and P. S. Yu, “A survey of heterogeneous information network analysis,” IEEE Trans. Knowl. Data Eng. , vol. 29, no. 1, pp. 17–37, 2017
2017
Earlier work this paper cites.
X. Wang, P. Cui, J. Wang, J. Pei, W. Zhu, and S. Yang, “Community preserving network embedding,” in AAAI , 2017
2017
Earlier work this paper cites.
T. Chen and Y. Sun, “Task-guided and path-augmented heterogeneous network embedding for author identification,” in WSDM . ACM, 2017, pp. 295–304
2017
Earlier work this paper cites.
L. Xu, X. Wei, J. Cao, and P. S. Yu, “Embedding of embedding (eoe): Joint embedding for coupled heterogeneous networks,” in WSDM . ACM, 2017, pp. 741–749
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,” in NIPS , 2017, pp. 5998–6008
2017
Earlier work this paper cites.
H. Zhao, Q. Yao, J. Li, Y. Song, and D. L. Lee, “Meta-graph based recommendation fusion over heterogeneous information networks,” in KDD . ACM, 2017, pp. 635–644
2017
Earlier work this paper cites.
Z. Liu, V. W. Zheng, Z. Zhao, F. Zhu, K. C.-C. Chang, M. Wu, and J. Ying, “Semantic proximity search on heterogeneous graph by proximity embedding,” in AAAI , 2017
2017
Earlier work this paper cites.
M. M. Bronstein, J. Bruna, Y. LeCun, A. Szlam, and P. Vandergheynst, “Geometric deep learning: Going beyond euclidean data,” IEEE Signal Process. Mag. , vol. 34, no. 4, pp. 18–42, 2017
2017
Earlier work this paper cites.
J. Zhang, C. Xia, C. Zhang, L. Cui, Y. Fu, and P. S. Yu, “BL-MNE: emerging heterogeneous social network embedding through broad learning with aligned autoencoder,” in ICDM . IEEE Computer Society, 2017, pp. 605–614
2017
Earlier work this paper cites.
Y. Ye, T. Li, D. Adjeroh, and S. S. Iyengar, “A survey on malware detection using data mining techniques,” ACM Computing Surveys (CSUR) , vol. 50, no. 3, pp. 1–40, 2017
2017
Earlier work this paper cites.
Y. Xiao, J. Zhang, and L. Deng, “Prediction of lncrna-protein interactions using hetesim scores based on heterogeneous networks,” Scientific reports , vol. 7, no. 1, pp. 1–12, 2017
2017
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.
S. Narayanaswamy, B. Paige, J. van de Meent, A. Desmaison, N. D. Goodman, P. Kohli, F. D. Wood, and P. H. S. Torr, “Learning disentangled representations with semi-supervised deep generative models,” in NIPS , 2017, pp. 5925–5935
2017
Earlier work this paper cites.
2017
Earlier work this paper cites.
C. Shi, B. Hu, W. X. Zhao, and P. S. Yu, “Heterogeneous information network embedding for recommendation,” IEEE Transactions on Knowledge and Data Engineering , vol. 31, no. 2, pp. 357–370, 2018
2018
Earlier work this paper cites.
B. Hu, C. Shi, W. X. Zhao, and P. S. Yu, “Leveraging meta-path based context for top-n recommendation with a neural co-attention model,” in KDD . ACM, 2018, pp. 1531–1540
2018
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.
H. Chen, H. Yin, W. Wang, H. Wang, Q. V. H. Nguyen, and X. Li, “Pme: projected metric embedding on heterogeneous networks for link prediction,” in KDD . ACM, 2018, pp. 1177–1186
2018
Earlier work this paper cites.
Y. Fan, S. Hou, Y. Zhang, Y. Ye, and M. Abdulhayoglu, “Gotcha-sly malware! scorpion a metagraph2vec based malware detection system,” in KDD , 2018, pp. 253–262
2018
Earlier work this paper cites.
A. Hosseini, T. Chen, W. Wu, Y. Sun, and M. Sarrafzadeh, “Heteromed: Heterogeneous information network for medical diagnosis,” in CIKM , 2018, pp. 763–772
2018
Earlier work this paper cites.
D. Zhang, J. Yin, X. Zhu, and C. Zhang, “Network representation learning: A survey,” IEEE transactions on Big Data , 2018
2018
Earlier work this paper cites.
P. Goyal and E. Ferrara, “Graph embedding techniques, applications, and performance: A survey,” Knowledge-Based Systems , vol. 151, pp. 78–94, 2018
2018
Cited alongside, same era.
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 , vol. 30, no. 9, pp. 1616–1637, 2018
2018
Cited alongside, same era.
D. Zhang, J. Yin, X. Zhu, and C. Zhang, “Metagraph2vec: complex semantic path augmented heterogeneous network embedding,” in PAKDD . Springer, 2018, pp. 196–208
2018
Cited alongside, same era.
Z. Liu, V. W. Zheng, Z. Zhao, Z. Li, H. Yang, M. Wu, and J. Ying, “Interactive paths embedding for semantic proximity search on heterogeneous graphs,” in KDD . ACM, 2018, pp. 1860–1869
2018
Cited alongside, same era.
R. Bian, Y. S. Koh, G. Dobbie, and A. Divoli, “Network embedding and change modeling in dynamic heterogeneous networks,” in SIGIR . ACM, 2019, pp. 861–864
2019
Later among the works it cites.
A. M. Fard, E. Bagheri, and K. Wang, “Relationship prediction in dynamic heterogeneous information networks,” in ECIR , ser. Lecture Notes in Computer Science, vol. 11437. Springer, 2019, pp. 19–34
2019
Later among the works it cites.
Y. Ji, C. Shi, F. Zhuang, and P. S. Yu, “Integrating topic model and heterogeneous information network for aspect mining with rating bias,” in PAKDD (1) , ser. Lecture Notes in Computer Science, vol. 11439. Springer, 2019, pp. 160–171
2019
Later among the works it cites.
J. Zhang, B. Dong, and P. S. Yu, “Deep diffusive neural network based fake news detection from heterogeneous social networks,” in BigData . IEEE, 2019, pp. 1259–1266
2019
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2018
Cited alongside, same era.
2018
Cited alongside, same era.
Y. Shi, H. Gui, Q. Zhu, L. Kaplan, and J. Han, “Aspem: Embedding learning by aspects in heterogeneous information networks,” in SDM . SIAM, 2018, pp. 144–152
2018
Cited alongside, same era.
Y. Shi, Q. Zhu, F. Guo, C. Zhang, and J. Han, “Easing embedding learning by comprehensive transcription of heterogeneous information networks,” in KDD . ACM, 2018, pp. 2190–2199
2018
Cited alongside, same era.
R. Matsuno and T. Murata, “MELL: effective embedding method for multiplex networks,” in WWW . ACM, 2018, pp. 1261–1268
2018
Cited alongside, same era.
H. Zhang, L. Qiu, L. Yi, and Y. Song, “Scalable multiplex network embedding.” in IJCAI , vol. 18, 2018, pp. 3082–3088
2018
Cited alongside, same era.
R. Hussein, D. Yang, and P. Cudré-Mauroux, “Are meta-paths necessary?: Revisiting heterogeneous graph embeddings,” in CIKM , 2018, pp. 437–446
2018
Cited alongside, same era.
K. Tu, P. Cui, X. Wang, F. Wang, and W. Zhu, “Structural deep embedding for hyper-networks,” in AAAI , 2018
2018
Cited alongside, same era.
J. Hu, S. Qian, Q. Fang, and C. Xu, “Hierarchical graph semantic pooling network for multi-modal community question answer matching,” in ACM Multimedia . ACM, 2019, pp. 1157–1165
2019
Later among the works it cites.
I. Chami, Z. Ying, C. Ré, and J. Leskovec, “Hyperbolic graph convolutional neural networks,” in NeurIPS , 2019, pp. 4869–4880
2019
Later among the works it cites.
Q. Liu, M. Nickel, and D. Kiela, “Hyperbolic graph neural networks,” in NeurIPS , 2019, pp. 8228–8239
2019
Later among the works it cites.
H. Peng, J. Li, Q. Gong, Y. Song, Y. Ning, K. Lai, and P. S. Yu, “Fine-grained event categorization with heterogeneous graph convolutional networks,” in IJCAI . ijcai.org, 2019, pp. 3238–3245
2019
Later among the works it cites.
W. Chen, Y. Gu, Z. Ren, X. He, H. Xie, T. Guo, D. Yin, and Y. Zhang, “Semi-supervised user profiling with heterogeneous graph attention networks.” in IJCAI , vol. 19, 2019, pp. 2116–2122
2019
Later among the works it cites.
A. Li, Z. Qin, R. Liu, Y. Yang, and D. Li, “Spam review detection with graph convolutional networks,” in CIKM , 2019, pp. 2703–2711
2019
Later among the works it cites.
S. Wang, Z. Chen, X. Yu, D. Li, J. Ni, L. Tang, J. Gui, Z. Li, H. Chen, and P. S. Yu, “Heterogeneous graph matching networks for unknown malware detection,” in IJCAI , 2019, pp. 3762–3770
2019
Later among the works it cites.
H. Zhao, Y. Zhou, Y. Song, and D. L. Lee, “Motif enhanced recommendation over heterogeneous information network,” in CIKM , 2019, pp. 2189–2192
2019
Later among the works it cites.
P. Velickovic, W. Fedus, W. L. Hamilton, P. Liò, Y. Bengio, and R. D. Hjelm, “Deep graph infomax,” in ICLR (Poster) . OpenReview.net, 2019
2019
Later among the works it cites.
A. J. Bose and W. L. Hamilton, “Compositional fairness constraints for graph embeddings,” in ICML , ser. Proceedings of Machine Learning Research, vol. 97. PMLR, 2019, pp. 715–724
2019
Later among the works it cites.
2019
Later among the works it cites.
T. A. Rahman, B. Surma, M. Backes, and Y. Zhang, “Fairwalk: Towards fair graph embedding,” in IJCAI . ijcai.org, 2019, pp. 3289–3295
2019
Later among the works it cites.
J. Ma, C. Zhou, P. Cui, H. Yang, and W. Zhu, “Learning disentangled representations for recommendation,” in NeurIPS , 2019, pp. 5712–5723
2019
Later among the works it cites.
H. Wang, M. Zhao, X. Xie, W. Li, and M. Guo, “Knowledge graph convolutional networks for recommender systems,” in WWW . ACM, 2019, pp. 3307–3313
2019
Later among the works it cites.
L. Hu, S. Xu, C. Li, C. Yang, C. Shi, N. Duan, X. Xie, and M. Zhou, “Graph neural news recommendation with unsupervised preference disentanglement,” in ACL , 2020
2020
Closest in time.
Y. Cao, H. Peng, and P. S. Yu, “Multi-information source HIN for medical concept embedding,” in PAKDD (2) , ser. Lecture Notes in Computer Science, vol. 12085. Springer, 2020, pp. 396–408
2020
Closest in time.
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 , 2020
2020
Closest in time.
Z. Zhang, P. Cui, and W. Zhu, “Deep learning on graphs: A survey,” IEEE Transactions on Knowledge and Data Engineering , 2020
2020
Closest in time.
Y. Dong, Z. Hu, K. Wang, Y. Sun, and J. Tang, “Heterogeneous network representation learning,” in IJCAI . ijcai.org, 2020, pp. 4861–4867
2020
Closest in time.
2020
Closest in time.
W. Zhang, Y. Fang, Z. Liu, M. Wu, and X. Zhang, “mg2vec: Learning relationship-preserving heterogeneous graph representations via metagraph embedding,” IEEE Transactions on Knowledge and Data Engineering , 2020
2020
Closest in time.
X. Wang, Y. Lu, C. Shi, R. Wang, P. Cui, and S. Mou, “Dynamic heterogeneous information network embedding with meta-path based proximity,” IEEE Transactions on Knowledge and Data Engineering , 2020
2020
Closest in time.
L. Yang, Z. Xiao, W. Jiang, Y. Wei, Y. Hu, and H. Wang, “Dynamic heterogeneous graph embedding using hierarchical attentions,” in ECIR , ser. Lecture Notes in Computer Science, vol. 12036. Springer, 2020, pp. 425–432
2020
Closest in time.
X. Fu, J. Zhang, Z. Meng, and I. King, “Magnn: Metapath aggregated graph neural network forheterogeneous graph embedding,” WWW , 2020
2020
Closest in time.
H. Hong, H. Guo, Y. Lin, X. Yang, Z. Li, and J. Ye, “An attention-based graph neural network for heterogeneous structural learning,” AAAI , 2020
2020
Closest in time.
Z. Hu, Y. Dong, K. Wang, and Y. Sun, “Heterogeneous graph transformer,” WWW , 2020
2020
Closest in time.
J. Zhao, X. Wang, C. Shi, Z. Liu, and Y. Ye, “Network schema preserving heterogeneous information network embedding,” in IJCAI , 2020
2020
Closest in time.
L. Hu, C. Li, C. Shi, C. Yang, and C. Shao, “Graph neural news recommendation with long-term and short-term interest modeling,” Information Processing & Management , vol. 57, no. 2, p. 102142, 2020
2020
Closest in time.
Z. Liu, M. Wan, S. Guo, K. Achan, and P. S. Yu, “Basconv: Aggregating heterogeneous interactions for basket recommendation with graph convolutional neural network,” in SDM . SIAM, 2020, pp. 64–72
2020
Closest in time.
2020
Closest in time.
S. Yao, T. Wang, and X. Wan, “Heterogeneous graph transformer for graph-to-sequence learning,” in ACL . Association for Computational Linguistics, 2020, pp. 7145–7154
2020
Closest in time.
Z. Liu, M. Wan, S. Guo, K. Achan, and P. S. Yu, “Basconv: Aggregating heterogeneous interactions for basket recommendation with graph convolutional neural network,” in SDM . SIAM, 2020, pp. 64–72
2020
Closest in time.
K. Zhao, T. Bai, B. Wu, B. Wang, Y. Zhang, Y. Yang, and J. Nie, “Deep adversarial completion for sparse heterogeneous information network embedding,” in WWW . ACM / IW3C2, 2020, pp. 508–518
2020
Closest in time.
J. Xu, Z. Zhu, J. Zhao, X. Liu, M. Shan, and J. Guo, “Gemini: A novel and universal heterogeneous graph information fusing framework for online recommendations,” in Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining , 2020, pp. 3356–3365
2020
Closest in time.
Y. Gao, X. Li, H. Peng, B. Fang, and P. S. Yu, “Hincti: A cyber threat intelligence modeling and identification system based on heterogeneous information network,” IEEE Transactions on Knowledge and Data Engineering , 2020
2020
Closest in time.
W. Luo, H. Zhang, X. Yang, L. Bo, X. Yang, Z. Li, X. Qie, and J. Ye, “Dynamic heterogeneous graph neural network for real-time event prediction,” in Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining , 2020, pp. 3213–3223
2020
Closest in time.
H. Hong, Y. Lin, X. Yang, Z. Li, K. Fu, Z. Wang, X. Qie, and J. Ye, “Heteta: Heterogeneous information network embedding for estimating time of arrival,” in Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining , 2020, pp. 2444–2454
2020
Closest in time.
2020
Closest in time.
K. Sun, Z. Lin, and Z. Zhu, “Multi-stage self-supervised learning for graph convolutional networks on graphs with few labeled nodes,” in AAAI . AAAI Press, 2020, pp. 5892–5899
2020
Closest in time.
2020
Closest in time.
2020
Closest in time.
Z. Hu, Y. Dong, K. Wang, K. Chang, and Y. Sun, “GPT-GNN: generative pre-training of graph neural networks,” in KDD , 2020, pp. 1857–1867
2020
Closest in time.
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 KDD , 2020, pp. 1150–1160
2020
Closest in time.
2020
Closest in time.
2020
Closest in time.
C. Shi, J. Ding, X. Cao, L. Hu, B. Wu, and X. Li, “Entity set expansion in knowledge graph: a heterogeneous information network perspective,” Frontiers Comput. Sci. , vol. 15, no. 1, p. 151307, 2021
2021
Closest in time.
X. Wang, H. Ji, C. Shi, B. Wang, Y. Ye, P. Cui, and P. S. Yu, “Heterogeneous graph attention network,” in WWW . ACM, 2019, pp. 2022–2032
2032
Closest in time.
Z. Liu, C. Chen, X. Yang, J. Zhou, X. Li, and L. Song, “Heterogeneous graph neural networks for malicious account detection,” in CIKM , 2018, pp. 2077–2085
2085
Closest in time.