Demo Data from VLDB 2026 / reviewers in the wild / expert
Rahul Bhagat
dblp:77/1410
· DBLP profile ↗
10ranked-venue papers
6as first author
1since 2021 · last 2023
—ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 9 · 6 first-author · 1 since 2021Databases, data management, data science and information retrieval · 4 · 2 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 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
3 papers |
Information retrieval · 68% Recommender systems · 32% | |
| Artificial intelligence
3 papers |
Information extraction and text analysis · 47% Knowledge representation and reasoning · 26% Speech recognition and synthesis · 26% |
Topics — the 8 heaviest of 12, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Information retrieval
e-commerce search |
0.7 | 1 | 2023 | Beyond Hard Negatives in Product Search: Semantic Matching Using One-Class Classification (SMOCC) · WSDM 2023 |
Information retrieval
semantic matching |
0.7 | 1 | 2023 | Beyond Hard Negatives in Product Search: Semantic Matching Using One-Class Classification (SMOCC) · WSDM 2023 |
Recommender systems
e-commerce recommendation |
0.3 | 1 | 2018 | Buy It Again: Modeling Repeat Purchase Recommendations · KDD 2018 |
Natural language and speech › Information extraction and text analysis
paraphrase extraction |
0.1 | 1 | 2008 | Large Scale Acquisition of Paraphrases for Learning Surface Patterns · ACL 2008 |
Natural language and speech › Speech recognition and synthesis › pronunciation modeling
grapheme-to-phoneme conversion |
0.1 | 1 | 2007 | Phonetic Models for Generating Spelling Variants · IJCAI 2007 |
Information retrieval › document retrieval › domain-specific retrieval
email search |
0.0 | 1 | 2003 | eArchivarius: accessing collections of electronic mail · SIGIR 2003 |
Information retrieval › search interfaces
search result visualization |
0.0 | 1 | 2003 | eArchivarius: accessing collections of electronic mail · SIGIR 2003 |
Natural language and speech › Information extraction and text analysis
text normalization |
0.0 | 1 | 2007 | Phonetic Models for Generating Spelling Variants · IJCAI 2007 |
Methods — techniques the papers use, named apart from their topics
one-class classification · 0.7hard negative mining · 0.7contrastive learning · 0.7collaborative filtering · 0.3distributional similarity · 0.1unsupervised learning · 0.1phonetic modeling · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | Beyond Hard Negatives in Product Search: Semantic Matching Using One-Class Classification (SMOCC)abstractSemantic matching is an important component of a product search pipeline. Its goal is to capture the semantic intent of the search query as opposed to the syntactic matching performed by a lexical matching system. A semantic matching model captures relationships like synonyms, and also captures common behavioral patterns to retrieve relevant results by generalizing from purchase data. They however suffer from lack of availability of informative negative examples for model training. Various methods have been proposed in the past to address this issue based upon hard-negative mining and contrastive learning. Arindam Bhattacharya, Ankit Gandhi, Vijay Huddar, Ankith M. S, Aayush Moroney, Atul Saroop, Rahul Bhagat |
WSDM | 7 |
| 2018 | Buy It Again: Modeling Repeat Purchase RecommendationsabstractRepeat purchasing, i.e., a customer purchasing the same product multiple times, is a common phenomenon in retail. As more customers start purchasing consumable products (e.g., toothpastes, diapers, etc.) online, this phenomenon has also become prevalent in e-commerce. However, in January 2014, when we looked at popular e-commerce websites, we did not find any customer-facing features that recommended products to customers from their purchase history to promote repeat purchasing. Also, we found limited research about repeat purchase recommendations and none that deals with the large scale purchase data that e-commerce websites collect. In this paper, we present the approach we developed for modeling repeat purchase recommendations. This work has demonstrated over 7% increase in the product click through rate on the personalized recommendations page of the Amazon.com website and has resulted in the launch of several customer-facing features on the Amazon.com website, the Amazon mobile app, and other Amazon websites. Rahul Bhagat, Srevatsan Muralidharan, Alex Lobzhanidze, Shankar Vishwanath |
KDD | 1 |
| 2013 | What Is a Paraphrase?abstractParaphrases are sentences or phrases that convey the same meaning using different wording. Although the logical definition of paraphrases requires strict semantic equivalence, linguistics accepts a broader, approximate, equivalence—thereby allowing far more examples of “quasi-paraphrase.” But approximate equivalence is hard to define. Thus, the phenomenon of paraphrases, as understood in linguistics, is difficult to characterize. In this article, we list a set of 25 operations that generate quasi-paraphrases. We then empirically validate the scope and accuracy of this list by manually analyzing random samples of two publicly available paraphrase corpora. We provide the distribution of naturally occurring quasi-paraphrases in English text. Rahul Bhagat, Eduard H. Hovy |
Comput. Linguistics | 1 |
| 2009 | Acquiring paraphrases from text corporaabstractParaphrases are textual expressions that convey the same meaning using different surface forms. Capturing the variability of language, they play an important role in many natural language applications includ ing question answering, machine translation, and multi-document summarization. In linguistics, paraphrases are characterized by approximate conceptual equivalence. Since no automated semantic interpretation systems available today can identify conceptual equivalence, paraphrases are difficult to acquire without human effort. In this paper, we present a method for automatically acquiring paraphrases using a monolingual corpus. We learn paraphrases at both the surface and lexico-syntactic levels and build two paraphrase resources each containing about 2 million phrases. We evaluate these paraphrases extrinsically by using them to learn patterns for Information Extraction (IE). We show that the lexico-syntactic paraphrases performs better than the surface-level paraphrases for IE. We further show that the patterns learned using the lexico-syntactic paraphrases attain comparable performance to the traditional IE approach of learning patterns from domain-specific corpora. Rahul Bhagat, Eduard H. Hovy, Siddharth Patwardhan |
K-CAP | 1 |
| 2008 | Large Scale Acquisition of Paraphrases for Learning Surface Patterns
Rahul Bhagat, Deepak Ravichandran |
ACL | 1 |
| 2008 | Weakly-Supervised Acquisition of Labeled Class Instances using Graph Random Walks
Partha P. Talukdar, Joseph Reisinger, Marius Pasca, Deepak Ravichandran, Rahul Bhagat, Fernando Pereira 0003 |
EMNLP | 5 |
| 2007 | LEDIR: An Unsupervised Algorithm for Learning Directionality of Inference Rules
Rahul Bhagat, Patrick Pantel, Eduard H. Hovy |
EMNLP-CoNLL | 1 |
| 2007 | Phonetic Models for Generating Spelling Variants
Rahul Bhagat, Eduard H. Hovy |
IJCAI | 1 |
| 2007 | ISP: Learning Inferential Selectional Preferences
Patrick Pantel, Rahul Bhagat, Bonaventura Coppola, Timothy Chklovski, Eduard H. Hovy |
HLT-NAACL | 2 |
| 2003 | eArchivarius: accessing collections of electronic mailabstractWe present eArchivarius an interactive system for accessing collections of electronic mail. The system combines search, clustering visualization, and time-based visualization of email messages and people who send or received the messages. Anton Leuski, Douglas W. Oard, Rahul Bhagat |
SIGIR | 3 |