Papers by Naganand Yadati
GAINER: Graph Machine Learning with Node-specific Radius for Classification of Short Texts and Documents (2024.eacl-long)
Copied to clipboard
| Challenge: | Recent advances in Graph Machine Learning (GML) have led to the development of numerous models tailored for processing text for various natural language applications. |
| Approach: | They propose a framework called Graph mAchine learnIng with Node-spEcific Radius that is aimed at graph-based NLP. |
| Outcome: | The proposed framework is non-neural and novel for graph-based NLP. |
Knowledge Base Question Answering through Recursive Hypergraphs (2021.eacl-main)
Copied to clipboard
| Challenge: | Existing methods for Knowledge Base Question Answering (KBQA) do not explicitly incorporate the recursive relational group structure in the given knowledge base. |
| Approach: | They propose a method to model KBs through recursive hypergraphs using hypergraph data. |
| Outcome: | The proposed method is based on recursive hypergraphs and has been released on multiple benchmarks. |
Graph-based Deep Learning in Natural Language Processing (D19-2)
Copied to clipboard
| Challenge: | This tutorial aims to introduce graph-based deep learning techniques such as Graph Convolutional Networks (GCNs) for Natural Language Processing (NLP) |
| Approach: | It provides a brief introduction to graph-based deep learning techniques such as Graph Convolutional Networks (GCNs) for Natural Language Processing (NLP). |
| Outcome: | This tutorial provides a brief introduction to graph-based deep learning techniques such as Graph Convolutional Networks (GCNs) for natural language processing (NLP). |