Fetching the paper…
Reading the bibliography…
In recent years, the fast rise in number of studies on graph neural network (GNN) has put it from the theories research to reality application stage.
A. Shamir, “How to share a secret,” Communications of the ACM , vol. 22, no. 11, pp. 612–613, 1979
1979
Earlier work this paper cites.
D. Demmler, T. Schneider, and M. Zohner, “Aby-a framework for efficient mixed-protocol secure two-party computation.” in NDSS , 2015
2015
Earlier work this paper cites.
Y. Aono, T. Hayashi, L. Wang, S. Moriai et al. , “Privacy-preserving deep learning via additively homomorphic encryption,” IEEE Transactions on Information Forensics and Security , vol. 13, no. 5, pp. 1333–1345, 2017
2017
Earlier work this paper cites.
J. Gilmer, S. S. Schoenholz, P. F. Riley, O. Vinyals, and G. E. Dahl, “Neural message passing for quantum chemistry,” in ICML , 2017
2017
Earlier work this paper cites.
W. L. Hamilton, R. Ying, and J. Leskovec, “Inductive representation learning on large graphs,” in NIPS , 2017
2017
Earlier work this paper cites.
K. Bonawitz, V. Ivanov, B. Kreuter, A. Marcedone, H. B. McMahan, S. Patel, D. Ramage, A. Segal, and K. Seth, “Practical secure aggregation for privacy-preserving machine learning,” in Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security , 2017, pp. 1175–1191
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.
2018
Earlier work this paper cites.
K. Xu, W. Hu, J. Leskovec, and S. Jegelka, “How powerful are graph neural networks?” in International Conference on Learning Representations , 2018
2018
Earlier work this paper cites.
P. Veličković, G. Cucurull, A. Casanova, A. Romero, P. Liò, and Y. Bengio, “Graph Attention Networks,” International Conference on Learning Representations , 2018, accepted as poster. [Online]. Available: https://openreview.net/forum?id=rJXMpikCZ
2018
Earlier work this paper cites.
O. Gupta and R. Raskar, “Distributed learning of deep neural network over multiple agents,” Journal of Network and Computer Applications , vol. 116, pp. 1–8, 2018
2018
Earlier work this paper cites.
A. Jäschke and F. Armknecht, “Unsupervised machine learning on encrypted data,” in International Conference on Selected Areas in Cryptography . Springer, 2018, pp. 453–478
2018
Earlier work this paper cites.
2018
Cited alongside, same era.
2019
Cited alongside, same era.
Q. Yang, Y. Liu, T. Chen, and Y. Tong, “Federated machine learning: Concept and applications,” ACM Transactions on Intelligent Systems and Technology (TIST) , vol. 10, no. 2, pp. 1–19, 2019
2019
Cited alongside, same era.
2019
Cited alongside, same era.
2020
Later among the works it cites.
2020
Later among the works it cites.
2020
Later among the works it cites.
A. Patra, T. Schneider, A. Suresh, and H. Yalame, “Aby2. 0: Improved mixed-protocol secure two-party computation,” in USENIX Security , vol. 21, 2020
2020
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2019
Cited alongside, same era.
2019
Cited alongside, same era.
Z. Wu, S. Pan, F. Chen, G. Long, C. Zhang, and S. Y. Philip, “A comprehensive survey on graph neural networks,” IEEE Transactions on Neural Networks and Learning Systems , 2020
2020
Cited alongside, same era.
J. Zhou, G. Cui, S. Hu, Z. Zhang, C. Yang, Z. Liu, L. Wang, C. Li, and M. Sun, “Graph neural networks: A review of methods and applications,” AI Open , vol. 1, pp. 57–81, 2020
2020
Cited alongside, same era.
E. Kurshan and H. Shen, “Graph computing for financial crime and fraud detection: Trends, challenges and outlook,” International Journal of Semantic Computing , vol. 14, no. 04, pp. 565–589, 2020
2020
Cited alongside, same era.
2020
Cited alongside, same era.
S. Ge, F. Wu, C. Wu, T. Qi, Y. Huang, and X. Xie, “Fedner: Privacy-preserving medical named entity recognition with federated learning,” arXiv e-prints , pp. arXiv–2003, 2020
2020
Cited alongside, same era.
C. He, K. Balasubramanian, E. Ceyani, Y. Rong, P. Zhao, J. Huang, M. L. Center, M. Annavaram, and S. Avestimehr, “Fedgraphnn: A federated learning system and benchmark for graph neural networks.”
Cited in the paper.
M. Byali, H. Chaudhari, A. Patra, and A. Suresh, “Flash: fast and robust framework for privacy-preserving machine learning,” Proceedings on Privacy Enhancing Technologies , vol. 2020, no. 2, pp. 459–480, 2020
2020
Later among the works it cites.
P. Mohassel, M. Rosulek, and N. Trieu, “Practical privacy-preserving k-means clustering,” Proceedings on Privacy Enhancing Technologies , vol. 2020, no. 4, pp. 414–433, 2020
2020
Later among the works it cites.
J. You, Z. Ying, and J. Leskovec, “Design space for graph neural networks,” Advances in Neural Information Processing Systems , vol. 33, 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 International Conference on Machine Learning . PMLR, 2020, pp. 1725–1735
2020
Later among the works it cites.
D. Rothchild, A. Panda, E. Ullah, N. Ivkin, I. Stoica, V. Braverman, J. Gonzalez, and R. Arora, “Fetchsgd: Communication-efficient federated learning with sketching,” in International Conference on Machine Learning . PMLR, 2020, pp. 8253–8265
2020
Later among the works it cites.
2021
Closest in time.
L. Zheng, J. Zhou, C. Chen, B. Wu, L. Wang, and B. Zhang, “Asfgnn: Automated separated-federated graph neural network,” Peer-to-Peer Networking and Applications , pp. 1–13, 2021
2021
Closest in time.