Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Swaraj Khadanga

dblp:224/0143 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
2since 2021 · last 2023
0009-0007-9280-3474ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 4 · 1 first-author · 2 since 2021Databases, data management, data science and information retrieval · 3 · 2 since 2021Applied, interdisciplinary, general and emerging computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
2 papers
Information retrieval · 100%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Medical and health informatics · 100%

Topics — the 8 heaviest of 9, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Information retrieval › retrieval models › sparse retrieval
learned sparse retrieval
0.712023
End-to-End Query Term Weighting · KDD 2023
Information retrieval › retrieval models
lexical retrieval
0.712023
End-to-End Query Term Weighting · KDD 2023
Information retrieval › retrieval models › term weighting
query term weighting
0.712023
End-to-End Query Term Weighting · KDD 2023
Information retrieval
retrieval models
0.712023
End-to-End Query Term Weighting · KDD 2023
Information retrieval › retrieval models › neural retrieval
dense retrieval
0.612022
Multi-Aspect Dense Retrieval · KDD 2022
Medical and health informatics
clinical decision support
0.412019
Using Clinical Notes with Time Series Data for ICU Management · EMNLP/IJCNLP (1) 2019
Medical and health informatics
clinical text processing
0.412019
Using Clinical Notes with Time Series Data for ICU Management · EMNLP/IJCNLP (1) 2019
Information retrieval
e-commerce search
0.212022
Multi-Aspect Dense Retrieval · KDD 2022

Methods — techniques the papers use, named apart from their topics

clinical note processing · 0.8ranking loss · 0.7BERT · 0.7aspect prediction · 0.6aspect embeddings · 0.6approximate nearest neighbor search · 0.6time-series modeling · 0.4time series modeling · 0.4
YearPublicationVenuePosition
2023 End-to-End Query Term Weighting
abstract
Bag-of-words based lexical retrieval systems are still the most commonly used methods for real-world search applications. Recently deep learning methods have shown promising results to improve this retrieval performance but are expensive to run in an online fashion, non-trivial to integrate into existing production systems, and might not generalize well in out-of-domain retrieval scenarios. Instead, we build on top of lexical retrievers by proposing a Term Weighting BERT (TW-BERT) model. TW-BERT learns to predict the weight for individual n-gram (e.g., uni-grams and bi-grams) query input terms. These inferred weights and terms can be used directly by a retrieval system to perform a query search. To optimize these term weights, TW-BERT incorporates the scoring function used by the search engine, such as BM25, to score query-document pairs. Given sample query-document pairs we can compute a ranking loss over these matching scores, optimizing the learned query term weights in an end-to-end fashion. Aligning TW-BERT with search engine scorers minimizes the changes needed to integrate it into existing production applications, whereas existing deep learning based search methods would require further infrastructure optimization and hardware requirements. The learned weights can be easily utilized by standard lexical retrievers and by other retrieval techniques such as query expansion. We show that TW-BERT improves retrieval performance over strong term weighting baselines within MSMARCO and in out-of-domain retrieval on TREC datasets.
Karan Samel, Cheng Li 0012, Weize Kong, Tao Chen 0008, Mingyang Zhang 0001, Shaleen Kumar Gupta, Swaraj Khadanga, Wensong Xu, Kashyap Kolipaka, Michael Bendersky, Marc Najork
KDD7
2022 Multi-Aspect Dense Retrieval
abstract
Prior work in Dense Retrieval usually encodes queries and documents using single-vector representations (also called embeddings) and performs retrieval in the embedding space using approximate nearest neighbor search. This paradigm enables efficient semantic retrieval. However, the single-vector representations can be ineffective at capturing different aspects of the queries and documents in relevance matching, especially for some vertical domains. For example, in e-commerce search, these aspects could be category, brand and color. Given a query ''white nike socks", a Dense Retrieval model may mistakenly retrieve some ''white adidas socks" while missing out the intended brand. We propose to explicitly represent multiple aspects using one embedding per aspect. We introduce an aspect prediction task to teach the model to capture aspect information with particular aspect embeddings. We design a lightweight network to fuse the aspect embeddings for representing queries and documents. Our evaluation using an e-commerce dataset shows impressive improvements over strong Dense Retrieval baselines. We also discover that the proposed aspect embeddings can enhance the interpretability of Dense Retrieval models as a byproduct.
Weize Kong, Swaraj Khadanga, Cheng Li 0012, Shaleen Kumar Gupta, Mingyang Zhang 0001, Wensong Xu, Michael Bendersky
KDD2
2019 Using Clinical Notes with Time Series Data for ICU Management
abstract
Swaraj Khadanga, Karan Aggarwal, Shafiq Joty, Jaideep Srivastava. Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP). 2019.
Swaraj Khadanga, Karan Aggarwal, Shafiq R. Joty, Jaideep Srivastava
EMNLP/IJCNLP (1)1
2018 A Structured Learning Approach with Neural Conditional Random Fields for Sleep Staging
abstract
Sleep plays a vital role in human health, both mental and physical. Sleep disorders like sleep apnea are increasing in prevalence, with the rapid increase in factors like obesity. Sleep apnea is most commonly treated with Continuous Positive Air Pressure (CPAP) therapy. Presently, however, there is no mechanism to monitor a patient's progress with CPAP. Accurate detection of sleep stages from CPAP flow signal is crucial for such a mechanism. We propose, for the first time, an automated sleep staging model based only on the flow signal. Deep neural networks have recently shown high accuracy on sleep staging by eliminating handcrafted features. However, these methods focus exclusively on extracting informative features from the input signal, without paying much attention to the dynamics of sleep stages in the output sequence. We propose an end-to-end framework that uses a combination of deep convolution and recurrent neural networks to extract high-level features from raw flow signal with a structured output layer based on a conditional random field to model the temporal transition structure of the sleep stages. We improve upon the previous methods by 10% using our model, that can be augmented to the previous sleep staging deep learning methods. We also show that our method can be used to accurately track sleep metrics like sleep efficiency calculated from sleep stages that can be deployed for monitoring the response of CPAP therapy on sleep apnea patients. Apart from the technical contributions, we expect this study to motivate new research questions in sleep science.
Karan Aggarwal, Swaraj Khadanga, Shafiq R. Joty, Louis Kazaglis, Jaideep Srivastava
IEEE BigData2