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

Pramodh Karanth Prabhakar

dblp:345/1803 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2023
0009-0001-3881-788XORCID · reported

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

Databases, data management, data science and information retrieval · 1 · 1 since 2021

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
1 paper
Information retrieval · 100%

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

TopicWeightPapersLastEvidence papers
Information retrieval › retrieval models › neural retrieval
embedding-based retrieval
0.712023
Integrity and Junkiness Failure Handling for Embedding-based Retrieval: A Case Study in Social Network Search · SIGIR 2023
Information retrieval › evaluation
search result quality
0.712023
Integrity and Junkiness Failure Handling for Embedding-based Retrieval: A Case Study in Social Network Search · SIGIR 2023

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

user cohort treatment · 0.7indexing treatment · 0.7
YearPublicationVenuePosition
2023 Integrity and Junkiness Failure Handling for Embedding-based Retrieval: A Case Study in Social Network Search
abstract
Embedding based retrieval has seen its usage in a variety of search applications like e-commerce, social networking search etc. While the approach has demonstrated its efficacy in tasks like semantic matching and contextual search, it is plagued by the problem of uncontrollable relevance. In this paper, we conduct an analysis of embedding-based retrieval launched in early 2021 on our social network search engine, and define two main categories of failures introduced by it, integrity and junkiness. The former refers to issues such as hate speech and offensive content that can severely harm user experience, while the latter includes irrelevant results like fuzzy text matching or language mismatches. Efficient methods during model inference are further proposed to resolve the issue, including indexing treatments and targeted user cohort treatments, etc. Though being simple, we show the methods have good offline NDCG and online A/B tests metrics gain in practice. We analyze the reasons for the improvements, pointing out that our methods are only preliminary attempts to this important but challenging problem. We put forward potential future directions to explore.
Yunxi Guo, Chiyao Shen, Guangdeng Liao, Hao Fu 0003, Pramodh Karanth Prabhakar
SIGIR7