no code implementations • 19 Nov 2023 • Abdalgader Abubaker, Takanori Maehara, Madhav Nimishakavi, Vassilis Plachouras
SPHH is consist of two self-supervised pretraining tasks that aim to simultaneously learn both local and global representations of the entities in the hypergraph by using informative representations derived from the hypergraph structure.
1 code implementation • 14 Aug 2020 • Shantanu Chandra, Pushkar Mishra, Helen Yannakoudakis, Madhav Nimishakavi, Marzieh Saeidi, Ekaterina Shutova
Existing research has modeled the structure, style, content, and patterns in dissemination of online posts, as well as the demographic traits of users who interact with them.
1 code implementation • NeurIPS 2019 • Naganand Yadati, Madhav Nimishakavi, Prateek Yadav, Vikram Nitin, Anand Louis, Partha Talukdar
In many real-world network datasets such as co-authorship, co-citation, email communication, etc., relationships are complex and go beyond pairwise.
no code implementations • ICLR 2019 • Naganand Yadati, Vikram Nitin, Madhav Nimishakavi, Prateek Yadav, Anand Louis, Partha Talukdar
Additionally, there is need to represent the direction from reactants to products.
1 code implementation • 7 Sep 2018 • Naganand Yadati, Madhav Nimishakavi, Prateek Yadav, Vikram Nitin, Anand Louis, Partha Talukdar
In many real-world network datasets such as co-authorship, co-citation, email communication, etc., relationships are complex and go beyond pairwise.
1 code implementation • 29 May 2018 • Prateek Yadav, Madhav Nimishakavi, Naganand Yadati, Shikhar Vashishth, Arun Rajkumar, Partha Talukdar
We analyse local and global properties of graphs and demonstrate settings where LCNs tend to work better than GCNs.
no code implementations • 18 Feb 2018 • Madhav Nimishakavi, Bamdev Mishra, Manish Gupta, Partha Talukdar
Besides the tensors, in many real world scenarios, side information is also available in the form of matrices which also grow in size with time.
no code implementations • NeurIPS 2018 • Madhav Nimishakavi, Pratik Jawanpuria, Bamdev Mishra
One of the popular approaches for low-rank tensor completion is to use the latent trace norm regularization.
1 code implementation • ACL 2018 • Madhav Nimishakavi, Partha Talukdar
Relation Schema Induction (RSI) is the problem of identifying type signatures of arguments of relations from unlabeled text.
1 code implementation • EMNLP 2016 • Madhav Nimishakavi, Uday Singh Saini, Partha Talukdar
To the best of our knowledge, this is the first application of tensor factorization for the RSI problem.