1 code implementation • 18 Jun 2024 • Tianqi Zhao, Ngan Thi Dong, Alan Hanjalic, Megha Khosla
Therefore, we define homophily and Cross-Class Neighborhood Similarity for multi-label classification and investigate $9$ collected multi-label datasets.
1 code implementation • 3 Jun 2024 • Tianqi Zhao, Alan Hanjalic, Megha Khosla
To foster fair evaluation and recognize challenges in CL settings, several evaluation frameworks have been proposed, focusing mainly on the single- and multi-label classification task on euclidean data.
1 code implementation • 5 Apr 2024 • Ziyu Li, Hilco van der Wilk, Danning Zhan, Megha Khosla, Alessandro Bozzon, Rihan Hai
Pre-trained deep learning (DL) models are increasingly accessible in public repositories, i. e., model zoos.
no code implementations • 2 Nov 2023 • Jurek Leonhardt, Henrik Müller, Koustav Rudra, Megha Khosla, Abhijit Anand, Avishek Anand
Dual-encoder-based dense retrieval models have become the standard in IR.
no code implementations • 2 Oct 2023 • Simone Piaggesi, Megha Khosla, André Panisson, Avishek Anand
Towards that, we first develop new metrics that measure the global interpretability of embedding vectors based on the marginal contribution of the embedding dimensions to predicting graph structure.
no code implementations • 1 Jun 2023 • Iyiola E. Olatunji, Anmar Hizber, Oliver Sihlovec, Megha Khosla
Graph neural networks (GNNs) have shown promising results on real-life datasets and applications, including healthcare, finance, and education.
1 code implementation • 20 Apr 2023 • Tianqi Zhao, Ngan Thi Dong, Alan Hanjalic, Megha Khosla
As our second contribution, we define homophily and Cross-Class Neighborhood Similarity for the multi-label scenario and provide a thorough analyses of the collected $9$ multi-label datasets.
no code implementations • 22 Jul 2022 • Megha Khosla
Graph Machine Learning (GraphML), whereby classical machine learning is generalized to irregular graph domains, has enjoyed a recent renaissance, leading to a dizzying array of models and their applications in several domains.
1 code implementation • 29 Jun 2022 • Iyiola E. Olatunji, Mandeep Rathee, Thorben Funke, Megha Khosla
Based on the different kinds of auxiliary information available to the adversary, we propose several graph reconstruction attacks.
1 code implementation • 28 Jun 2022 • Mandeep Rathee, Thorben Funke, Avishek Anand, Megha Khosla
Given a GNN model, several interpretability approaches exist to explain GNN models with diverse (sometimes conflicting) evaluation methodologies.
no code implementations • 26 Nov 2021 • Thi Ngan Dong, Graham Brogden, Gisa Gerold, Megha Khosla
We developed a multitask transfer learning approach that exploits the information of around 24 million protein sequences and the interaction patterns from the human interactome to counter the problem of small training datasets.
1 code implementation • 12 Oct 2021 • Jurek Leonhardt, Koustav Rudra, Megha Khosla, Abhijit Anand, Avishek Anand
In this paper, we propose the Fast-Forward index -- a simple vector forward index that facilitates ranking documents using interpolation of lexical and semantic scores -- as a replacement for contextual re-rankers and dense indexes based on nearest neighbor search.
1 code implementation • 27 Sep 2021 • Soumyadeep Roy, Sudip Chakraborty, Aishik Mandal, Gunjan Balde, Prakhar Sharma, Anandhavelu Natarajan, Megha Khosla, Shamik Sural, Niloy Ganguly
Online medical forums have become a predominant platform for answering health-related information needs of consumers.
1 code implementation • 18 Sep 2021 • Iyiola E. Olatunji, Thorben Funke, Megha Khosla
With the increasing popularity of graph neural networks (GNNs) in several sensitive applications like healthcare and medicine, concerns have been raised over the privacy aspects of trained GNNs.
no code implementations • 8 Aug 2021 • Thi Ngan Dong, Megha Khosla
To effectively test the generalization capability of our model, we construct large-scale experiments on standard benchmark datasets as well as our proposed larger independent test sets and case studies.
no code implementations • 23 Jun 2021 • Mandeep Rathee, Zijian Zhang, Thorben Funke, Megha Khosla, Avishek Anand
However, GNNs remain hard to interpret as the interplay between node features and graph structure is only implicitly learned.
1 code implementation • 18 May 2021 • Thorben Funke, Megha Khosla, Mandeep Rathee, Avishek Anand
In this paper, we lay down some of the fundamental principles that an explanation method for graph neural networks should follow and introduce a metric RDT-Fidelity as a measure of the explanation's effectiveness.
no code implementations • 16 Apr 2021 • Jens Rauch, Iyiola E. Olatunji, Megha Khosla
When applying outlier detection in settings where data is sensitive, mechanisms which guarantee the privacy of the underlying data are needed.
1 code implementation • 13 Apr 2021 • Iyiola E. Olatunji, Jens Rauch, Matthias Katzensteiner, Megha Khosla
Mining health data can lead to faster medical decisions, improvement in the quality of treatment, disease prevention, reduced cost, and it drives innovative solutions within the healthcare sector.
no code implementations • 18 Jan 2021 • Megha Khosla, Avishek Anand
We study the classical weighted perfect matchings problem for bipartite graphs or sometimes referred to as the assignment problem, i. e., given a weighted bipartite graph $G = (U\cup V, E)$ with weights $w : E \rightarrow \mathcal{R}$ we are interested to find the maximum matching in $G$ with the minimum/maximum weight.
Data Structures and Algorithms Discrete Mathematics Combinatorics
1 code implementation • 17 Jan 2021 • Iyiola E. Olatunji, Wolfgang Nejdl, Megha Khosla
While choosing the simplest possible attack model that utilizes the posteriors of the trained model (black-box access), we thoroughly analyze the properties of GNNs and the datasets which dictate the differences in their robustness towards MI attack.
no code implementations • 1 Jan 2021 • Thorben Funke, Megha Khosla, Avishek Anand
Graph Neural Networks (GNNs) are a flexible and powerful family of models that build nodes' representations on irregular graph-structured data.
1 code implementation • 29 Apr 2020 • Vikram Waradpande, Daniel Kudenko, Megha Khosla
Motivated by the recent success of node representations for several graph analytical tasks we specifically investigate the capability of node representation learning methods to effectively encode the topology of the underlying MDP in Deep RL.
no code implementations • 29 Apr 2020 • Jaspreet Singh, Zhenye Wang, Megha Khosla, Avishek Anand
In extensive quantitative experiments we show that our approach outperforms other model agnostic explanation approaches across pointwise, pairwise and listwise LTR models in validity while not compromising on completeness.
1 code implementation • 22 Apr 2020 • Jurek Leonhardt, Avishek Anand, Megha Khosla
The extraction of main content from web pages is an important task for numerous applications, ranging from usability aspects, like reader views for news articles in web browsers, to information retrieval or natural language processing.
no code implementations • 11 Oct 2019 • Maximilian Idahl, Megha Khosla, Avishek Anand
In this paper we propose and study the novel problem of explaining node embeddings by finding embedded human interpretable subspaces in already trained unsupervised node representation embeddings.
no code implementations • 19 Mar 2019 • Megha Khosla, Vinay Setty, Avishek Anand
However, there is no common ground for systematic comparison of embeddings to understand their behavior for different graphs and tasks.
1 code implementation • 7 Dec 2018 • Avishek Anand, Megha Khosla, Jaspreet Singh, Jan-Hendrik Zab, Zijian Zhang
In this paper, we propose a scalable approach to train word embeddings by partitioning the input space instead in order to scale to massive text corpora while not sacrificing the performance of the embeddings.
no code implementations • 22 Oct 2018 • Megha Khosla, Jurek Leonhardt, Wolfgang Nejdl, Avishek Anand
We also unearth the limitations of evaluations on directed graphs in previous works and propose a clear strategy for evaluating link prediction and graph reconstruction in directed graphs.