Demo Data from VLDB 2026 / reviewers in the wild / expert
Yu Zhang 0203
dblp:50/671-203
· DBLP profile ↗
5ranked-venue papers
1as first author
5since 2021 · last 2025
0000-0003-0940-5138ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 4 · 1 first-author · 4 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 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 |
Machine learning and data management · 33% Data mining · 33% Information retrieval · 33% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning and data management
matrix completion |
0.9 | 1 | 2025 | Multi-Label Ranking Loss Minimization for Matrix Completion · AAAI 2025 |
Data mining › predictive modeling › classification
multi-label classification |
0.9 | 1 | 2025 | Multi-Label Ranking Loss Minimization for Matrix Completion · AAAI 2025 |
Information retrieval › ranking › learning to rank
ranking loss |
0.9 | 1 | 2025 | Multi-Label Ranking Loss Minimization for Matrix Completion · AAAI 2025 |
Methods — techniques the papers use, named apart from their topics
pairwise ranking · 0.9matrix completion · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Multi-Label Ranking Loss Minimization for Matrix CompletionabstractThe common matrix completion methods minimize the rank of the matrix to be completed in addition to the Hamming loss between the incomplete and completed matrices. The rank of matrix measures the linear relation among the vectors of matrix, which may introduce ambiguity for data recovery. To cope with this issue, we extend multi-label ranking loss into matrix completion, and employ multi-label ranking loss minimization (MLRM) in this paper to exploit the relative correlation among matrix vectors. In MLRM, the original incomplete matrix is converted into a pairwise ranking matrix, and the approximation on this newly generated matrix can be viewed as a surrogate of multi-label ranking loss to replace the Hamming loss pattern in the existing methods. Extensive experiments demonstrate that MLRM outperforms the state-of-the-art matrix completion methods in varies of applications, including movie recommendation, drug-target interaction prediction and multi-label learning. Jiaxuan Li 0001, Xiaoyan Zhu 0003, Hongrui Wang 0004, Yu Zhang 0203, Xin Lai 0003, Jiayin Wang 0002 |
AAAI | 4 |
| 2025 | Learning multi-behavior user intent for session-based recommendation
Yu Zhang 0203, Xiaoyan Zhu 0003, Guopeng He, Jiaxuan Li 0001, Jiayin Wang 0002 |
Expert Syst. Appl. | 1 |
| 2024 | TCSR: Self-attention with time and category for session-based recommendationabstractAbstract Session‐based recommendation that uses sequence of items clicked by anonymous users to make recommendations has drawn the attention of many researchers, and a lot of approaches have been proposed. However, there are still problems that have not been well addressed: (1) Time information is either ignored or exploited with a fixed time span and granularity, which fails to understand the personalized interest transfer pattern of users with different clicking speeds; (2) Category information is either omitted or considered independent of the items, which defies the fact that the relationships between categories and items are helpful for the recommendation. To solve these problems, we propose a new session‐based recommendation method, TCSR (self‐attention with time and category for session‐based recommendation). TCSR uses a non‐linear normalized time embedding to perceive user interest transfer patterns on variable granularity and employs a heterogeneous SAN to make full use of both items and categories. Moreover, a cross‐recommendation unit is adapted to adjust recommendations on the item and category sides. Extensive experiments on four real datasets show that TCSR significantly outperforms state‐of‐the‐art approaches. Xiaoyan Zhu 0003, Yu Zhang 0203, Jiaxuan Li 0001, Jiayin Wang 0002, Xin Lai 0003 |
Comput. Intell. | 2 |
| 2024 | Stacked co-training for semi-supervised multi-label learning
Jiaxuan Li 0001, Xiaoyan Zhu 0003, Hongrui Wang 0004, Yu Zhang 0203, Jiayin Wang 0002 |
Inf. Sci. | 4 |
| 2024 | Graph-enhanced and collaborative attention networks for session-based recommendation
Xiaoyan Zhu 0003, Yu Zhang 0203, Jiayin Wang 0002, Guangtao Wang |
Knowl. Based Syst. | 2 |