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

Gaurav Pandey 0003

dblp:23/3937-3 · DBLP profile ↗
← Back
7ranked-venue papers
5as first author
1since 2021 · last 2022
0000-0003-4450-1766ORCID · verified

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

Artificial intelligence and machine learning · 4 · 3 first-author · 1 since 2021Databases, data management, data science and information retrieval · 4 · 3 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
1 paper
Information retrieval · 100%

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

TopicWeightPapersLastEvidence papers
Information retrieval › ranking
learning to rank
0.312017
CitySearcher: A City Search Engine For Interests · SIGIR 2017
Information retrieval
ranking
0.312017
CitySearcher: A City Search Engine For Interests · SIGIR 2017
Information retrieval › web search
vertical search
0.312017
CitySearcher: A City Search Engine For Interests · SIGIR 2017
Information retrieval › search engines
semantic search
0.112017
CitySearcher: A City Search Engine For Interests · SIGIR 2017

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

word2vec · 0.3learning to rank · 0.3clustering · 0.3
YearPublicationVenuePosition
2022 Diversity in news recommendations using contextual bandits
Alexander Semenov, Maciej Rysz, Gaurav Pandey 0003, Guanglin Xu
Expert Syst. Appl.3
2019 Vectors of Pairwise Item Preferences
Gaurav Pandey 0003, Shuaiqiang Wang, Zhaochun Ren, Yi Chang 0001
ECIR (1)1
2019 Identifying Images with Ladders Using Deep CNN Transfer Learning
Gaurav Pandey 0003, Arvind Baranwal, Alexander Semenov
KES-IDT (1)1
2018 Recommending Serendipitous Items using Transfer Learning
abstract
Most recommender algorithms are designed to suggest relevant items, but suggesting these items does not always result in user satisfaction. Therefore, the efforts in recommender systems recently shifted towards serendipity, but generating serendipitous recommendations is difficult due to the lack of training data. To the best of our knowledge, there are many large datasets containing relevance scores (relevance oriented) and only one publicly available dataset containing a relatively small number of serendipity scores (serendipity oriented). This limits the learning capabilities of serendipity oriented algorithms. Therefore, in the absence of any known deep learning algorithms for recommending serendipitous items and the lack of large serendipity oriented datasets, we introduce SerRec our novel transfer learning method to recommend serendipitous items. SerRec uses transfer learning to firstly train a deep neural network for relevance scores using a large dataset and then tunes it for serendipity scores using a smaller dataset. Our method shows benefits of transfer learning for recommending serendipitous items as well as performance gains over the state-of-the-art serendipity oriented algorithms
Gaurav Pandey 0003, Denis Kotkov, Alexander Semenov
CIKM1
2018 Listwise Recommendation Approach with Non-negative Matrix Factorization
Gaurav Pandey 0003, Shuaiqiang Wang
KES-IDT1
2018 Linear feature extraction for ranking
Gaurav Pandey 0003, Zhaochun Ren, Shuaiqiang Wang, Jari Veijalainen, Maarten de Rijke
Inf. Retr. J.1
2017 CitySearcher: A City Search Engine For Interests
abstract
We introduce CitySearcher, a vertical search engine that searches for cities when queried for an interest. Generally in search engines, utilization of semantics between words is favorable for performance improvement. Even though ambiguous query words have multiple semantic meanings, search engines can return diversified results to satisfy different users' information needs. But for CitySearcher, mismatched semantic relationships can lead to extremely unsatisfactory results. For example, the city Sale would incorrectly rank high for the interest shopping because of semantic interpretations of the words. Thus in our system, the main challenge is to eliminate the mismatched semantic relationships resulting from the side effect of the semantic models. In the previous case, we aim to ignore the semantics of a city's name which is not indicative of the city's characteristics. In CitySearcher, we use word2vec, a very popular word embedding technique to estimate the semantics of the words and create the initial ranks of the cities. To reduce the effect of the mismatched semantic relationships, we generate a set of features for learning based on a novel clustering-based method. With the generated features, we then utilize learning to rank algorithms to rerank the cities for return. We use the English version of Wikivoyage dataset for evaluation of our system, where we sample a very small dataset for training. Experimental results demonstrate the performance gain of our system over various standard retrieval techniques.
Mohamed Abdel Maksoud, Gaurav Pandey 0003, Shuaiqiang Wang
SIGIR2