Fetching the paper…
Reading the bibliography…
Knowledge Graphs (KGs) are becoming increasingly essential infrastructures in many applications while suffering from incompleteness issues.
M. Nickel, L. Rosasco, and T. A. Poggio, “Holographic embeddings of knowledge graphs,” in AAAI , 2016, pp. 1955–1961
1961
Earlier work this paper cites.
M. Gutmann and A. Hyvärinen, “Noise-contrastive estimation: A new estimation principle for unnormalized statistical models,” in AISTATS , vol. 9, 2010, pp. 297–304
2010
Earlier work this paper cites.
A. Carlson, J. Betteridge, B. Kisiel, B. Settles, E. R. H. Jr., and T. M. Mitchell, “Toward an architecture for never-ending language learning,” in AAAI , 2010
2010
Earlier work this paper cites.
X. Glorot and Y. Bengio, “Understanding the difficulty of training deep feedforward neural networks,” in AISTATS , 2010, pp. 249–256
2010
Earlier work this paper cites.
M. Nickel, V. Tresp, and H. Kriegel, “A three-way model for collective learning on multi-relational data,” in ICML , 2011, pp. 809–816
2011
Earlier work this paper cites.
A. Bordes, N. Usunier, A. García-Durán, J. Weston, and O. Yakhnenko, “Translating embeddings for modeling multi-relational data,” in NeurIPS , 2013, pp. 2787–2795
2013
Earlier work this paper cites.
R. Socher, D. Chen, C. D. Manning, and A. Y. Ng, “Reasoning with neural tensor networks for knowledge base completion,” in NeurIPS , 2013, pp. 926–934
2013
Earlier work this paper cites.
A. Bordes, S. Chopra, and J. Weston, “Question answering with subgraph embeddings,” in ACL , 2014, pp. 615–620
2014
Earlier work this paper cites.
Z. Wang, J. Zhang, J. Feng, and Z. Chen, “Knowledge graph embedding by translating on hyperplanes,” in AAAI , 2014, pp. 1112–1119
2014
Earlier work this paper cites.
A. Bordes, X. Glorot, J. Weston, and Y. Bengio, “A semantic matching energy function for learning with multi-relational data,” Machine Learning , vol. 94, no. 2, pp. 233–259, 2014
2014
Earlier work this paper cites.
X. Dong, E. Gabrilovich, G. Heitz, W. Horn, N. Lao, K. Murphy, T. Strohmann, S. Sun, and W. Zhang, “Knowledge vault: A web-scale approach to probabilistic knowledge fusion,” in KDD , 2014, pp. 601–610
2014
Earlier work this paper cites.
D. Vrandečić and M. Krötzsch, “Wikidata: a free collaborative knowledgebase,” Communications of the ACM , vol. 57, no. 10, pp. 78–85, 2014
2014
Earlier work this paper cites.
B. Yang, W. Yih, X. He, J. Gao, and L. Deng, “Embedding entities and relations for learning and inference in knowledge bases,” in ICLR , 2015
2015
Earlier work this paper cites.
K. Toutanova, D. Chen, P. Pantel, H. Poon, P. Choudhury, and M. Gamon, “Representing text for joint embedding of text and knowledge bases,” in EMNLP , 2015, pp. 1499–1509
2015
Earlier work this paper cites.
Y. Lin, Z. Liu, M. Sun, Y. Liu, and X. Zhu, “Learning entity and relation embeddings for knowledge graph completion,” in AAAI , 2015, pp. 2181–2187
2015
Earlier work this paper cites.
D. P. Kingma and J. Ba, “Adam: A method for stochastic optimization,” in ICLR , 2015
2015
Earlier work this paper cites.
K. He, X. Zhang, S. Ren, and J. Sun, “Deep residual learning for image recognition,” in CVPR , 2016, pp. 770–778
2016
Earlier work this paper cites.
2016
Earlier work this paper cites.
M. Wang, J. Zhang, J. Liu, W. Hu, S. Wang, X. Li, and W. Liu, “PDD graph: Bridging electronic medical records and biomedical knowledge graphs via entity linking,” in ISWC , 2017, pp. 219–227
2017
Earlier work this paper cites.
T. Rocktäschel and S. Riedel, “End-to-end differentiable proving,” in NeurIPS , 2017, pp. 3788–3800
2017
Earlier work this paper cites.
F. Yang, Z. Yang, and W. W. Cohen, “Differentiable learning of logical rules for knowledge base reasoning,” in NeurIPS , 2017, pp. 2319–2328
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.
J. Gilmer, S. S. Schoenholz, P. F. Riley, O. Vinyals, and G. E. Dahl, “Neural message passing for quantum chemistry,” in ICML , 2017, pp. 1263–1272
2017
Earlier work this paper cites.
D. Marcheggiani and I. Titov, “Encoding sentences with graph convolutional networks for semantic role labeling,” in EMNLP , 2017, pp. 1506–1515
2017
Cited alongside, same era.
A. Vaswani, N. Shazeer, N. Parmar, J. Uszkoreit, L. Jones, A. N. Gomez, L. Kaiser, and I. Polosukhin, “Attention is all you need,” in NeurIPS , 2017, pp. 5998–6008
2017
Cited alongside, same era.
R. Çelebi, E. Yasar, H. Uyar, Ö. Gümüs, O. Dikenelli, and M. Dumontier, “Evaluation of knowledge graph embedding approaches for drug-drug interaction prediction using linked open data,” in SWAT4LS , 2018
2018
Cited alongside, same era.
T. Dettmers, P. Minervini, P. Stenetorp, and S. Riedel, “Convolutional 2d knowledge graph embeddings,” in AAAI , 2018, pp. 1811–1818
2018
Cited alongside, same era.
D. Q. Nguyen, T. D. Nguyen, D. Q. Nguyen, and D. Q. Phung, “A novel embedding model for knowledge base completion based on convolutional neural network,” in NAACL , 2018, pp. 327–333
C. Shang, Y. Tang, J. Huang, J. Bi, X. He, and B. Zhou, “End-to-end structure-aware convolutional networks for knowledge base completion,” in AAAI , 2019, pp. 3060–3067
2019
Later among the works it cites.
D. Nathani, J. Chauhan, C. Sharma, and M. Kaul, “Learning attention-based embeddings for relation prediction in knowledge graphs,” in ACL , 2019, pp. 4710–4723
2019
Later among the works it cites.
F. Wu, A. H. S. Jr., T. Zhang, C. Fifty, T. Yu, and K. Q. Weinberger, “Simplifying graph convolutional networks,” in ICML , 2019, pp. 6861–6871
2019
Later among the works it cites.
C. Fu, T. Chen, M. Qu, W. Jin, and X. Ren, “Collaborative policy learning for open knowledge graph reasoning,” in EMNLP , 2019, pp. 2672–2681
2019
Later among the works it cites.
X. Lin, Z. Quan, Z. Wang, T. Ma, and X. Zeng, “KGNN: knowledge graph neural network for drug-drug interaction prediction,” in IJCAI , 2020, pp. 2739–2745
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2018
Cited alongside, same era.
R. Das, S. Dhuliawala, M. Zaheer, L. Vilnis, I. Durugkar, A. Krishnamurthy, A. Smola, and A. McCallum, “Go for a walk and arrive at the answer: Reasoning over paths in knowledge bases using reinforcement learning,” in ICLR , 2018
2018
Cited alongside, same era.
X. V. Lin, R. Socher, and C. Xiong, “Multi-hop knowledge graph reasoning with reward shaping,” in EMNLP , 2018, pp. 3243–3253
2018
Cited alongside, same era.
P. Velickovic, G. Cucurull, A. Casanova, A. Romero, P. Liò, and Y. Bengio, “Graph attention networks,” in ICLR , 2018
2018
Cited alongside, same era.
R. Ying, R. He, K. Chen, P. Eksombatchai, W. L. Hamilton, and J. Leskovec, “Graph convolutional neural networks for web-scale recommender systems,” in KDD (Data Science track) , 2018, pp. 974–983
2018
Cited alongside, same era.
M. S. Schlichtkrull, T. N. Kipf, P. Bloem, R. van den Berg, I. Titov, and M. Welling, “Modeling relational data with graph convolutional networks,” in ESWC , 2018, pp. 593–607
2018
Cited alongside, same era.
X. V. Lin, R. Socher, and C. Xiong, “Multi-hop knowledge graph reasoning with reward shaping,” in EMNLP , 2018, pp. 3243–3253
2018
Cited alongside, same era.
H. Wang, M. Zhao, X. Xie, W. Li, and M. Guo, “Knowledge graph convolutional networks for recommender systems,” in WWW , 2019, pp. 3307–3313
2019
Cited alongside, same era.
2020
Later among the works it cites.
S. Vashishth, S. Sanyal, V. Nitin, and P. P. Talukdar, “Composition-based multi-relational graph convolutional networks,” in ICLR , 2020
2020
Later among the works it cites.
X. Lv, X. Han, L. Hou, J. Li, Z. Liu, W. Zhang, Y. Zhang, H. Kong, and S. Wu, “Dynamic anticipation and completion for multi-hop reasoning over sparse knowledge graph,” in EMNLP , 2020, pp. 5694–5703
2020
Later among the works it cites.
X. He, K. Deng, X. Wang, Y. Li, Y. Zhang, and M. Wang, “Lightgcn: Simplifying and powering graph convolution network for recommendation,” in SIGIR , 2020, pp. 639–648
2020
Later among the works it cites.
K. K. Teru, E. Denis, and W. Hamilton, “Inductive relation prediction by subgraph reasoning,” in ICML , 2020, pp. 9448–9457
2020
Later among the works it cites.
T. Chen, S. Kornblith, M. Norouzi, and G. E. Hinton, “A simple framework for contrastive learning of visual representations,” in ICML , vol. 119, 2020, pp. 1597–1607
2020
Later among the works it cites.
M. Day, “Artificial intelligence for knowledge graphs of cryptocurrency anti-money laundering in fintech,” in ASONAM , 2021, pp. 439–446
2021
Later among the works it cites.
S. Wu, M. Wang, D. Zhang, Y. Zhou, Y. Li, and Z. Wu, “Knowledge-aware dialogue generation via hierarchical infobox accessing and infobox-dialogue interaction graph network,” in IJCAI , 2021, pp. 3964–3970
2021
Later among the works it cites.
H. Ren, H. Dai, B. Dai, X. Chen, M. Yasunaga, H. Sun, D. Schuurmans, J. Leskovec, and D. Zhou, “LEGO: latent execution-guided reasoning for multi-hop question answering on knowledge graphs,” in ICML , 2021, pp. 8959–8970
2021
Later among the works it cites.
W. Chen, F. Feng, Q. Wang, X. He, C. Song, G. Ling, and Y. Zhang, “Catgcn: Graph convolutional networks with categorical node features,” IEEE Transactions on Knowledge and Data Engineering , 2021
2021
Later among the works it cites.
X. Wang, T. Huang, D. Wang, Y. Yuan, Z. Liu, X. He, and T. Chua, “Learning intents behind interactions with knowledge graph for recommendation,” in WWW , 2021, pp. 878–887
2021
Later among the works it cites.
D. Yu, Y. Yang, R. Zhang, and Y. Wu, “Knowledge embedding based graph convolutional network,” in WWW , 2021, pp. 1619–1628
2021
Later among the works it cites.
H. Wang, H. Ren, and J. Leskovec, “Relational message passing for knowledge graph completion,” in KDD , 2021
2021
Later among the works it cites.
M. Yasunaga, H. Ren, A. Bosselut, P. Liang, and J. Leskovec, “QA-GNN: reasoning with language models and knowledge graphs for question answering,” in NAACL , 2021, pp. 535–546
2021
Later among the works it cites.
D. Bo, X. Wang, C. Shi, and H. Shen, “Beyond low-frequency information in graph convolutional networks,” in AAAI , 2021, pp. 3950–3957
2021
Later among the works it cites.
I. Tolstikhin, N. Houlsby, A. Kolesnikov, L. Beyer, X. Zhai, T. Unterthiner, J. Yung, A. P. Steiner, D. Keysers, J. Uszkoreit et al. , “Mlp-mixer: An all-mlp architecture for vision,” in NeurIPS , 2021
2021
Later among the works it cites.
Z. Zhang, J. Wang, J. Ye, and F. Wu, “Rethinking graph convolutional networks in knowledge graph completion,” in WWW , 2022, pp. 798–807
2022
Closest in time.
T. Trouillon, J. Welbl, S. Riedel, É. Gaussier, and G. Bouchard, “Complex embeddings for simple link prediction,” in ICML , vol. 48, 2016, pp. 2071–2080
2080
Closest in time.