VLDB 2026 Research / reviewers in the wild / expert
Yujie Chen 0001
dblp:74/3270-1
· DBLP profile ↗
1ranked-venue papers
1as first author
1since 2021 · last 2023
0000-0002-0482-2496ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 1 · 1 first-author · 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 |
Recommender systems · 75% Information retrieval · 25% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Recommender systems
collaborative filtering |
0.7 | 1 | 2023 | Using Entropy for Group Sampling in Pairwise Ranking from implicit feedback · SIGIR 2023 |
Recommender systems › collaborative filtering
implicit feedback |
0.7 | 1 | 2023 | Using Entropy for Group Sampling in Pairwise Ranking from implicit feedback · SIGIR 2023 |
Recommender systems › personalized ranking
pairwise ranking |
0.7 | 1 | 2023 | Using Entropy for Group Sampling in Pairwise Ranking from implicit feedback · SIGIR 2023 |
Information retrieval
similarity measure |
0.7 | 1 | 2023 | Using Entropy for Group Sampling in Pairwise Ranking from implicit feedback · SIGIR 2023 |
Methods — techniques the papers use, named apart from their topics
entropy-weighted similarity · 0.7bayesian personalized ranking · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | Using Entropy for Group Sampling in Pairwise Ranking from implicit feedbackabstractIn recent years, pairwise methods, such as Bayesian Personalized Ranking (BPR), have gained significant attention in the field of collaborative filtering for recommendation systems. Group BPR is an extension of BPR that incorporates user groups to relax the strict assumption of independence between two users. However, the reliability of its user groups may be compromised as they only focus on a few behavioral similarities. To address this problem, this paper proposes a new entropy-weighted similarity measure for implicit feedback to quantify the relation between two users and sample like-minded user groups. We first introduce the group preference into several pairwise ranking algorithms and then utilize the entropy-weighted similarity to sample groups to further improve these algorithms. Unlike other approaches that rely solely on common item ratings, our method incorporates global information into the similarity measure, resulting in a more reliable approach to group sampling. We conducted experiments on two real-world datasets and evaluated our method using different metrics. The results show that our method can construct better user groups from sparse data and produce more accurate recommendations. Our approach can be applied to a wide range of recommendation systems, and this can significantly improve the performance of pairwise ranking algorithms, making it an effective tool for pairwise ranking. Yujie Chen 0001, Runlong Yu, Qi Liu 0003, Enhong Chen, Zhenya Huang |
SIGIR | 1 |