activity
20182021
most citedComposition-based Multi-Relational Graph Convolutional Networks

136 citations · 326 across the 7 of their papers we have counts for

collaborators

12 papers

cs.LG20211 cited

Robust Knowledge Graph Completion with Stacked Convolutions and a Student Re-Ranking Network

Justin Lovelace, Denis Newman-Griffis, Shikhar Vashishth +2

Knowledge Graph (KG) completion research usually focuses on densely connected benchmark datasets that are not representative of real KGs. We curate two KG datasets that include bio…

cs.CL202119 cited

DialoGraph: Incorporating Interpretable Strategy-Graph Networks into Negotiation Dialogues

Rishabh Joshi, Vidhisha Balachandran, Shikhar Vashishth +2

To successfully negotiate a deal, it is not enough to communicate fluently: pragmatic planning of persuasive negotiation strategies is essential. While modern dialogue agents excel…

cs.CL2019

A Re-evaluation of Knowledge Graph Completion Methods

Zhiqing Sun, Shikhar Vashishth, Soumya Sanyal +2

Knowledge Graph Completion (KGC) aims at automatically predicting missing links for large-scale knowledge graphs. A vast number of state-of-the-art KGC techniques have got publishe…

cs.LG2019136 cited

Composition-based Multi-Relational Graph Convolutional Networks

Shikhar Vashishth, Soumya Sanyal, Vikram Nitin +1

Graph Convolutional Networks (GCNs) have recently been shown to be quite successful in modeling graph-structured data. However, the primary focus has been on handling simple undire…

cs.CL2019

Neural Graph Embedding Methods for Natural Language Processing

Shikhar Vashishth

Knowledge graphs are structured representations of facts in a graph, where nodes represent entities and edges represent relationships between them. Recent research has resulted in…

cs.LG2019

InteractE: Improving Convolution-based Knowledge Graph Embeddings by Increasing Feature Interactions

Shikhar Vashishth, Soumya Sanyal, Vikram Nitin +2

Most existing knowledge graphs suffer from incompleteness, which can be alleviated by inferring missing links based on known facts. One popular way to accomplish this is to generat…