Fetching the paper…
Reading the bibliography…
Deep learning models on graphs have achieved remarkable performance in various graph analysis tasks, e.g., node classification, link prediction, and graph clustering.
S. Kullback and R. A. Leibler, “On information and sufficiency,” The annals of mathematical statistics , vol. 22, no. 1, pp. 79–86, 1951
1951
Earlier work this paper cites.
G. Chartrand, Introductory graph theory . Courier Corporation, 1977
1977
Earlier work this paper cites.
D. Whitley, “A genetic algorithm tutorial,” Statistics and computing , vol. 4, no. 2, pp. 65–85, 1994
1994
Earlier work this paper cites.
A. K. McCallum, K. Nigam, J. Rennie, and K. Seymore, “Automating the construction of internet portals with machine learning,” Information Retrieval , vol. 3, no. 2, pp. 127–163, 2000
2000
Earlier work this paper cites.
M. E. Newman, “Mixing patterns in networks,” Physical Review E , vol. 67, no. 2, p. 026126, 2003
2003
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.
L. Danon, A. Diaz-Guilera, J. Duch, and A. Arenas, “Comparing community structure identification,” Journal of Statistical Mechanics: Theory and Experiment , vol. 2005, no. 09, p. P09008, 2005
2005
Earlier work this paper cites.
P. Sen, G. Namata, M. Bilgic, L. Getoor, B. Galligher, and T. Eliassi-Rad, “Collective classification in network data,” AI magazine , vol. 29, no. 3, pp. 93–93, 2008
2008
Earlier work this paper cites.
S. Rendle, C. Freudenthaler, Z. Gantner, and L. Schmidt-Thieme, “Bpr: Bayesian personalized ranking from implicit feedback,” in Proceedings of the twenty-fifth conference on uncertainty in artificial intelligence . AUAI Press, 2009, pp. 452–461
2009
Earlier work this paper cites.
J. M. Santos and M. Embrechts, “On the use of the adjusted rand index as a metric for evaluating supervised classification,” in International conference on artificial neural networks . Springer, 2009, pp. 175–184
2009
Earlier work this paper cites.
H. Von Stackelberg, Market structure and equilibrium . Springer Science & Business Media, 2010
2010
Earlier work this paper cites.
R. Collobert, J. Weston, L. Bottou, M. Karlen, K. Kavukcuoglu, and P. Kuksa, “Natural language processing (almost) from scratch,” Journal of machine learning research , vol. 12, no. Aug, pp. 2493–2537, 2011
2011
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.
D. M. Powers, “Evaluation: from precision, recall and f-measure to roc, informedness, markedness and correlation,” 2011
2011
Earlier work this paper cites.
L. Lü and T. Zhou, “Link prediction in complex networks: A survey,” Physica A: statistical mechanics and its applications , vol. 390, no. 6, pp. 1150–1170, 2011
2011
Earlier work this paper cites.
2013
Earlier work this paper cites.
K. Boyd, K. H. Eng, and C. D. Page, “Area under the precision-recall curve: point estimates and confidence intervals,” in Joint European conference on machine learning and knowledge discovery in databases . Springer, 2013, pp. 451–466
2013
Earlier work this paper cites.
B. Perozzi, R. Al-Rfou, and S. Skiena, “Deepwalk: Online learning of social representations,” in KDD . ACM, 2014, pp. 701–710
2014
Earlier work this paper cites.
I. J. Goodfellow, J. Pouget-Abadie, M. Mirza, B. Xu, D. Warde-Farley, S. Ozair, A. Courville, and Y. Bengio, “Generative adversarial networks,” 2014
2014
Earlier work this paper cites.
2014
Earlier work this paper cites.
O. M. Parkhi, A. Vedaldi, A. Zisserman et al. , “Deep face recognition.” in bmvc , vol. 1, no. 3, 2015, p. 6
2015
Earlier work this paper cites.
Y. Pei, N. Chakraborty, and K. Sycara, “Nonnegative matrix tri-factorization with graph regularization for community detection in social networks,” in Twenty-Fourth International Joint Conference on Artificial Intelligence , 2015
2015
Earlier work this paper cites.
2016
Earlier work this paper cites.
X. Zhu, W. Chen, W. Zheng, and X. Ma, “Gemini: A computation-centric distributed graph processing system,” in 12th { \{ USENIX } \} Symposium on Operating Systems Design and Implementation ( { \{ OSDI } \} 16) , 2016, pp. 301–316
2016
Earlier work this paper cites.
N. Papernot, P. McDaniel, I. Goodfellow, S. Jha, Z. B. Celik, and A. Swami, “Practical black-box attacks against machine learning,” in Proceedings of the 2017 ACM on Asia conference on computer and communications security . ACM, 2017, pp. 506–519
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 (ICLR) , 2017
2017
Earlier work this paper cites.
Y. Chen, Y. Nadji, A. Kountouras, F. Monrose, R. Perdisci, M. Antonakakis, and N. Vasiloglou, “Practical attacks against graph-based clustering,” in Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security . ACM, 2017, pp. 1125–1142
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 Advances in neural information processing systems , 2017, pp. 5998–6008
2017
Earlier work this paper cites.
2017
Earlier work this paper cites.
B. Krishnamurthy and M. Sarkar, “Deep-learning network architecture for object detection,” Dec. 11 2018, uS Patent 10,152,655
2018
Cited alongside, same era.
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.
J. Wang, P. Huang, H. Zhao, Z. Zhang, B. Zhao, and D. L. Lee, “Billion-scale commodity embedding for e-commerce recommendation in alibaba,” in Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining . ACM, 2018, pp. 839–848
2018
Cited alongside, same era.
L. Chen, Y. Liu, Z. Zheng, and P. Yu, “Heterogeneous neural attentive factorization machine for rating prediction,” in CIKM . ACM, 2018, pp. 833–842
2018
Cited alongside, same era.
2019
Later among the works it cites.
2019
Later among the works it cites.
2019
Later among the works it cites.
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.
D. Zügner, A. Akbarnejad, and S. Günnemann, “Adversarial attacks on neural networks for graph data,” in Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining . ACM, 2018, pp. 2847–2856
2018
Cited alongside, same era.
2018
Cited alongside, same era.
2018
Cited alongside, same era.
2018
Cited alongside, same era.
R. Hussein, D. Yang, and P. Cudré-Mauroux, “Are meta-paths necessary?: Revisiting heterogeneous graph embeddings,” in Proceedings of the 27th ACM International Conference on Information and Knowledge Management . ACM, 2018, pp. 437–446
2018
Cited alongside, same era.
Y. Sharma, “Gradient-based adversarial attacks to deep neural networks in limited access settings,” Ph.D. dissertation, COOPER UNION, 2018
2018
Cited alongside, same era.
B. Biggio and F. Roli, “Wild patterns: Ten years after the rise of adversarial machine learning,” Pattern Recognition , vol. 84, pp. 317–331, 2018
2018
Cited alongside, same era.
2019
Later among the works it cites.
H. Wu, C. Wang, Y. Tyshetskiy, A. Docherty, K. Lu, and L. Zhu, “Adversarial examples for graph data: deep insights into attack and defense,” in Proceedings of the 28th International Joint Conference on Artificial Intelligence . AAAI Press, 2019, pp. 4816–4823
2019
Later among the works it cites.
2019
Later among the works it cites.
J. Chen, L. Chen, Y. Chen, M. Zhao, S. Yu, Q. Xuan, and X. Yang, “Ga-based q-attack on community detection,” IEEE Transactions on Computational Social Systems , vol. 6, no. 3, pp. 491–503, 2019
2019
Later among the works it cites.
H. Chang, Y. Rong, T. Xu, W. Huang, H. Zhang, P. Cui, W. Zhu, and J. Huang, “A restricted black-box adversarial framework towards attacking graph embedding models,” 2019
2019
Later among the works it cites.
2019
Later among the works it cites.
H. Zhang, T. Zheng, J. Gao, C. Miao, L. Su, Y. Li, and K. Ren, “Data poisoning attack against knowledge graph embedding,” in Proceedings of the 28th International Joint Conference on Artificial Intelligence . AAAI Press, 2019, pp. 4853–4859
2019
Later among the works it cites.
K. Yang, M. Zhang, K. Chen, X. Ma, Y. Bai, and Y. Jiang, “Knightking: a fast distributed graph random walk engine,” in Proceedings of the 27th ACM Symposium on Operating Systems Principles , 2019, pp. 524–537
2019
Later among the works it cites.
D. Zhu, Z. Zhang, P. Cui, and W. Zhu, “Robust graph convolutional networks against adversarial attacks,” 2019
2019
Later among the works it cites.
2019
Later among the works it cites.
2019
Later among the works it cites.
K. Sun, Z. Lin, H. Guo, and Z. Zhu, “Virtual adversarial training on graph convolutional networks in node classification,” in Chinese Conference on Pattern Recognition and Computer Vision (PRCV) . Springer, 2019, pp. 431–443
2019
Later among the works it cites.
2019
Later among the works it cites.
2019
Later among the works it cites.
2019
Later among the works it cites.
A. Bojchevski and S. Günnemann, “Certifiable robustness to graph perturbations,” in Advances in Neural Information Processing Systems , 2019, pp. 8317–8328
2019
Later among the works it cites.
2019
Later among the works it cites.
P. Pezeshkpour, C. Irvine, Y. Tian, and S. Singh, “Investigating robustness and interpretability of link prediction via adversarial modifications,” in Proceedings of NAACL-HLT , 2019, pp. 3336–3347
2019
Later among the works it cites.
Y. Zhang, S. Khan, and M. Coates, “Comparing and detecting adversarial attacks for graph deep learning,” in Proc. Representation Learning on Graphs and Manifolds Workshop, Int. Conf. Learning Representations, New Orleans, LA, USA , 2019
2019
Later among the works it cites.
2019
Later among the works it cites.
B. A. Miller, M. Çamurcu, A. J. Gomez, K. Chan, and T. Eliassi-Rad, “Improving robustness to attacks against vertex classification,” 2019
2019
Later among the works it cites.
2019
Later among the works it cites.
F. Manessi, A. Rozza, and M. Manzo, “Dynamic graph convolutional networks,” Pattern Recognition , vol. 97, p. 107000, 2020
2020
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 Proceedings of the 27th ACM International Conference on Information and Knowledge Management . ACM, 2018, pp. 2077–2085
2085
Closest in time.
L. Chen, Y. Liu, X. He, L. Gao, and Z. Zheng, “Matching user with item set: Collaborative bundle recommendation with deep attention network,” in IJCAI , 2019, pp. 2095–2101
2095
Closest in time.