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

Abhijit Bhole

dblp:17/1985 · DBLP profile ↗
← Back
6ranked-venue papers
1as first author
0since 2021 · last 2015
—ORCID · none

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

Databases, data management, data science and information retrieval · 4Artificial intelligence and machine learning · 2 · 1 first-authorGraphics, 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
2 papers
Information retrieval · 100%
Artificial intelligence
1 paper
Representation and self-supervised learning · 100%

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

TopicWeightPapersLastEvidence papers
Information retrieval › document retrieval › domain-specific retrieval
email search
0.212015
On Correcting Misspelled Queries in Email Search · AAAI 2015
Information retrieval
query processing
0.212015
On Correcting Misspelled Queries in Email Search · AAAI 2015
Information retrieval › query processing
query spelling correction
0.212015
On Correcting Misspelled Queries in Email Search · AAAI 2015
Machine learning › Representation and self-supervised learning › word representation › word embedding
bilingual word embedding
0.112011
Improving Bilingual Projections via Sparse Covariance Matrices · EMNLP 2011
Information retrieval › relevance feedback
pseudo-relevance feedback
0.112010
Investigating the suboptimality and instability of pseudo-relevance feedback · SIGIR 2010
Information retrieval › query reformulation
query expansion
0.112010
Investigating the suboptimality and instability of pseudo-relevance feedback · SIGIR 2010
Information retrieval › query formulation
term selection
0.112010
Investigating the suboptimality and instability of pseudo-relevance feedback · SIGIR 2010
Information retrieval
personalized search
0.112015
On Correcting Misspelled Queries in Email Search · AAAI 2015
Information retrieval
evaluation
0.012010
Investigating the suboptimality and instability of pseudo-relevance feedback · SIGIR 2010
Information retrieval › evaluation
retrieval effectiveness
0.012010
Investigating the suboptimality and instability of pseudo-relevance feedback · SIGIR 2010

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

machine learning · 0.2sparse covariance matrix estimation · 0.1oracle term selection · 0.1
YearPublicationVenuePosition
2015 On Correcting Misspelled Queries in Email Search
abstract
We consider the problem of providing spelling corrections for misspelled queries in Email Search using user’s own mail data. A popular strategy for general query spelling correction is to generate corrections from query logs. However, this strategy is not effective in Email Search for two reasons: 1) query log of any sin- gle user is typically not rich enough to provide potential corrections for a new query 2) corrections generated us- ing query logs of other users are not particularly useful since the mail data as well as search intent are highly specific to the user. We address the challenge of design- ing an effective spelling correction algorithm for Email Search in the absence of query logs. We propose SpEQ, a Machine Learning based approach that generates cor- rections for misspelled queries directly from the user’s own mail data.
Abhijit Bhole, Raghavendra Udupa
AAAI1
2011 Improving Bilingual Projections via Sparse Covariance Matrices
Jagadeesh Jagarlamudi, Raghavendra Udupa, Hal Daumé III, Abhijit Bhole
EMNLP4
2010 On Improving Pseudo-Relevance Feedback Using Pseudo-Irrelevant Documents
Karthik Raman 0001, Raghavendra Udupa, Pushpak Bhattacharyya, Abhijit Bhole
ECIR4
2010 Investigating the suboptimality and instability of pseudo-relevance feedback
abstract
Although Pseudo-Relevance Feedback (PRF) techniques improve average retrieval performance at the price of high variance, not much is known about their optimality and the reasons for their instability. In this work, we study more than 800 topics from several test collections including the TREC Robust Track and show that PRF techniques are highly suboptimal, i.e. they do not make the fullest utilization of pseudo-relevant documents and under-perform. A careful selection of expansion terms from the pseudo-relevant document with the help of an oracle can actually improve retrieval performance dramatically (by > 60%). Further, we show that instability in PRF techniques is mainly due to wrong selection of expansion terms from the pseudo-relevant documents. Our findings emphasize the need to revisit the problem of term selection to make a break through in PRF.
Raghavendra Udupa, Abhijit Bhole
SIGIR2
2009 "They Are Out There, If You Know Where to Look": Mining Transliterations of OOV Query Terms for Cross-Language Information Retrieval
Raghavendra Udupa, K. Saravanan 0001, Anton Bakalov, Abhijit Bhole
ECIR4
2009 Demo: HistoryViz - Visualizing Events and Relations Extracted from Wikipedia
Ruben Sipos, Abhijit Bhole, Blaz Fortuna, Marko Grobelnik, Dunja Mladenic
ESWC2