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

Sunil Mohan

dblp:79/6251 · DBLP profile ↗
← Back
6ranked-venue papers
2as first author
2since 2021 · last 2022
—ORCID · none

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

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

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%
Theoretical computer science
1 paper
Algorithms and data structures · 100%

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

TopicWeightPapersLastEvidence papers
Information retrieval › document retrieval › domain-specific retrieval
biomedical information retrieval
0.312018
A Fast Deep Learning Model for Textual Relevance in Biomedical Information Retrieval · WWW 2018
Information retrieval › retrieval models
neural retrieval
0.312018
A Fast Deep Learning Model for Textual Relevance in Biomedical Information Retrieval · WWW 2018
Information retrieval › ranking › search ranking
relevance ranking
0.312018
A Fast Deep Learning Model for Textual Relevance in Biomedical Information Retrieval · WWW 2018
Information retrieval
diversified retrieval
0.212014
Latent dirichlet allocation based diversified retrieval for e-commerce search · WSDM 2014
Information retrieval
search result diversification
0.212014
Latent dirichlet allocation based diversified retrieval for e-commerce search · WSDM 2014
Information retrieval › evaluation › effectiveness metrics
diversity metrics
0.112014
Latent dirichlet allocation based diversified retrieval for e-commerce search · WSDM 2014
Information retrieval › query understanding
query intent understanding
0.112014
Latent dirichlet allocation based diversified retrieval for e-commerce search · WSDM 2014
Information retrieval
retrieval evaluation
0.112014
Latent dirichlet allocation based diversified retrieval for e-commerce search · WSDM 2014

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

word embeddings · 0.3feed-forward networks · 0.3convolutional neural network · 0.3latent dirichlet allocation · 0.2
YearPublicationVenuePosition
2022 A Distant Supervision Corpus for Extracting Biomedical Relationships Between Chemicals, Diseases and Genes
abstract
We introduce ChemDisGene, a new dataset for training and evaluating multi-class multi-label biomedical relation extraction models. Our dataset contains 80k biomedical research abstracts labeled with mentions of chemicals, diseases, and genes, portions of which human experts labeled with 18 types of biomedical relationships between these entities (intended for evaluation), and the remainder of which (intended for training) has been distantly labeled via the CTD database with approximately 78% accuracy. In comparison to similar preexisting datasets, ours is both substantially larger and cleaner; it also includes annotations linking mentions to their entities. We also provide three baseline deep neural network relation extraction models trained and evaluated on our new dataset.
Sunil Mohan, Michaela Torkar, Andrew McCallum
LREC2
2021 Clustering-based Inference for Biomedical Entity Linking
abstract
Rico Angell, Nicholas Monath, Sunil Mohan, Nishant Yadav, Andrew McCallum. Proceedings of the 2021 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies. 2021.
Rico Angell, Nicholas Monath, Sunil Mohan, Nishant Yadav, Andrew McCallum
NAACL-HLT3
2020 Using error decay prediction to overcome practical issues of deep active learning for named entity recognition
Haw-Shiuan Chang, Shankar Vembu, Sunil Mohan, Rheeya Uppaal, Andrew McCallum
Mach. Learn.3
2018 A Fast Deep Learning Model for Textual Relevance in Biomedical Information Retrieval
abstract
Publications in the life sciences are characterized by a large technical vocabulary, with many lexical and semantic variations for expressing the same concept. Towards addressing the problem of relevance in biomedical literature search, we introduce a deep learning model for the relevance of a document's text to a keyword style query. Limited by a relatively small amount of training data, the model uses pre-trained word embeddings. With these, the model first computes a variable-length Delta matrix between the query and document, representing a difference between the two texts, which is then passed through a deep convolution stage followed by a deep feed-forward network to compute a relevance score. This results in a fast model suitable for use in an online search engine. The model is robust and outperforms comparable state-of-the-art deep learning approaches.
Sunil Mohan, Nicolas Fiorini, Sun Kim, Zhiyong Lu
WWW1
2014 Latent dirichlet allocation based diversified retrieval for e-commerce search
abstract
Diversified retrieval is a very important problem on many e-commerce sites, e.g. eBay and Amazon. Using IR approaches without optimizing for diversity results in a clutter of redundant items that belong to the same products. Most existing product taxonomies are often too noisy, with overlapping structures and non-uniform granularity, to be used directly in diversified retrieval. To address this problem, we propose a Latent Dirichlet Allocation (LDA) based diversified retrieval approach that selects diverse items based on the hidden user intents. Our approach first discovers the hidden user intents of a query using the LDA model, and then ranks the user intents by making trade-offs between their relevance and information novelty. Finally, it chooses the most representative item for each user intent to display. To evaluate the diversity in the search results on e-commerce sites, we propose a new metric, average satisfaction, measuring user satisfaction with the search results. Through our empirical study on eBay, we show that the LDA model discovers meaningful user intents and the LDA-based approach provides significantly higher user satisfaction than the eBay production ranker and three other diversified retrieval approaches.
Sunil Mohan, Duangmanee Putthividhya, Weng-Keen Wong
WSDM2
1989 Automatic Construction of a Hierarchical Generate-and-Test Algorithm
Sunil Mohan, Chris Tong
ML1