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

Zhe Li 0013

dblp:11/751-13 · also Roger Zhe Li · DBLP profile ↗
← Back
4ranked-venue papers
3as first author
2since 2021 · last 2021
0000-0002-8288-9952ORCID · verified

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

Databases, data management, data science and information retrieval · 3 · 3 first-author · 2 since 2021Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021Software engineering, systems software and programming languages · 1

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
Recommender systems · 57% Information retrieval · 43%
Artificial intelligence
1 paper
Trustworthy machine learning · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Trustworthy machine learning
fairness
0.512021
Leave No User Behind: Towards Improving the Utility of Recommender Systems for Non-mainstream Users · WSDM 2021
Machine learning › Trustworthy machine learning › fairness › ranking fairness
recommendation fairness
0.512021
Leave No User Behind: Towards Improving the Utility of Recommender Systems for Non-mainstream Users · WSDM 2021
Recommender systems
collaborative filtering
0.512021
Leave No User Behind: Towards Improving the Utility of Recommender Systems for Non-mainstream Users · WSDM 2021
Information retrieval › ranking
learning to rank
0.512021
New Insights into Metric Optimization for Ranking-based Recommendation · SIGIR 2021
Recommender systems
loss function design
0.512021
New Insights into Metric Optimization for Ranking-based Recommendation · SIGIR 2021
Information retrieval › ranking › learning to rank
metric optimization
0.512021
New Insights into Metric Optimization for Ranking-based Recommendation · SIGIR 2021
Recommender systems
ranking-based recommendation
0.512021
New Insights into Metric Optimization for Ranking-based Recommendation · SIGIR 2021

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

convolutional neural network · 1.0autoencoder · 1.0adversarial learning · 1.0
YearPublicationVenuePosition
2021 New Insights into Metric Optimization for Ranking-based Recommendation
abstract
Direct optimization of IR metrics has often been adopted as an approach to devise and develop ranking-based recommender systems. Most methods following this approach (e.g. TFMAP, CLiMF, Top-N-Rank) aim at optimizing the same metric being used for evaluation, under the assumption that this will lead to the best performance. A number of studies of this practice bring this assumption, however, into question. In this paper, we dig deeper into this issue in order to learn more about the effects of the choice of the metric to optimize on the performance of a ranking-based recommender system. We present an extensive experimental study conducted on different datasets in both pairwise and listwise learning-to-rank (LTR) scenarios, to compare the relative merit of four popular IR metrics, namely RR, AP, nDCG and RBP, when used for optimization and assessment of recommender systems in various combinations. For the first three, we follow the practice of loss function formulation available in literature. For the fourth one, we propose novel loss functions inspired by RBP for both the pairwise and listwise scenario. Our results confirm that the best performance is indeed not necessarily achieved when optimizing the same metric being used for evaluation. In fact, we find that RBP-inspired losses perform at least as well as other metrics in a consistent way, and offer clear benefits in several cases. Interesting to see is that RBP-inspired losses, while improving the recommendation performance for all uses, may lead to an individual performance gain that is correlated with the activity level of a user in interacting with items. The more active the users, the more they benefit. Overall, our results challenge the assumption behind the current research practice of optimizing and evaluating the same metric, and point to RBP-based optimization instead as a promising alternative when learning to rank in the recommendation context.
Zhe Li 0013, Julián Urbano, Alan Hanjalic
SIGIR1
2021 Leave No User Behind: Towards Improving the Utility of Recommender Systems for Non-mainstream Users
abstract
In a collaborative-filtering recommendation scenario, biases in the data will likely propagate in the learned recommendations. In this paper we focus on the so-called mainstream bias: the tendency of a recommender system to provide better recommendations to users who have a mainstream taste, as opposed to non-mainstream users. We propose NAECF, a conceptually simple but effective idea to address this bias. The idea consists of adding an autoencoder (AE) layer when learning user and item representations with text-based Convolutional Neural Networks. The AEs, one for the users and one for the items, serve as adversaries to the process of minimizing the rating prediction error when learning how to recommend. They enforce that the specific unique properties of all users and items are sufficiently well incorporated and preserved in the learned representations. These representations, extracted as the bottlenecks of the corresponding AEs, are expected to be less biased towards mainstream users, and to provide more balanced recommendation utility across all users. Our experimental results confirm these expectations, significantly improving the recommendations for non-mainstream users while maintaining the recommendation quality for mainstream users. Our results emphasize the importance of deploying extensive content-based features, such as online reviews, in order to better represent users and items to maximize the de-biasing effect.
Zhe Li 0013, Julián Urbano, Alan Hanjalic
WSDM1
2018 Towards the next generation of multi-criteria recommender systems
abstract
This paper presents the motivation, concepts, ideas and research questions underlying a PhD research project in the domain of recommender systems, and more specifically on multi-criteria recommendation. While we build on the existing work in this direction, we aim at introducing recommendation frameworks that do not only optimize for different criteria simultaneously, but also exploit their interrelations. For this aim, we will address three multi-criteria recommendation challenges, namely multi-modal user and item modeling, package recommendation, and user-centric recommendation. For realizing these frameworks, and in particular, for learning interactions and interrelations in the criteria space, we will rely on the state-of-the-art deep learning systems, and in particular the Generative Adversarial Networks (GANs). In addition, a novel evaluation strategy for multi-criteria recommendation targeting the maximization of the user's satisfaction will also be devised.
Zhe Li 0013
RecSys1
2017 Adaptive Ensemble Undersampling-Boost: A novel learning framework for imbalanced data
Wei Lu 0026, Zhe Li 0013, Jinghui Chu
J. Syst. Softw.2