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

Wen Shi 0005

dblp:02/3628-5 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2026
0009-0007-2633-8818ORCID · verified

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

Databases, data management, data science and information retrieval · 2 · 2 since 2021Artificial intelligence and machine learning · 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
Recommender systems · 100%

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

TopicWeightPapersLastEvidence papers
Recommender systems
generative recommendation
1.012026
M²GR: Generative User Interest Modeling via Multi-Granularity Multi-Objective CoT for Industrial Recommendation · SIGIR 2026
Recommender systems
user interest modeling
1.012026
M²GR: Generative User Interest Modeling via Multi-Granularity Multi-Objective CoT for Industrial Recommendation · SIGIR 2026

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

multi-granularity modeling · 1.0chain-of-thought · 1.0
YearPublicationVenuePosition
2026 M²GR: Generative User Interest Modeling via Multi-Granularity Multi-Objective CoT for Industrial Recommendation
abstract
User interest modeling plays a vital role in industrial recommendation systems (RSs). Existing generative recommendation (GR) methods rely on single-step direct inference, which falls short of deeply modeling complex and dynamically evolving user interest. Recent chain-of-thought (CoT)-based GR methods attempt to address this, but either suffer from information loss during semantic space transformation in explicit reasoning or yield uncontrollable, homogeneous reasoning chains in implicit reasoning.
Jingwen Shi, Wen Shi 0005, Zhen Chen 0021, Dongyue Wang, Xiwei Zhao, Sulong Xu
SIGIR3
2023 Satisfaction-Aware User Interest Network for Click-Through Rate Prediction
abstract
Click-Through Rate (CTR) prediction plays a pivotal role in numerous industrial applications, including online advertising and recommender systems. Existing approaches primarily focus on modeling the correlation between user interests and candidate items. However, we argue that personalized user preferences for candidate items depend not only on correlation but also on the satisfaction of associated interests. To address this limitation, we propose SUIN, a novel CTR model that integrates satisfaction factors into user interest modeling for enhanced click-through rate prediction. Specifically, we employ a user interest satisfaction-aware network to capture the degree of satisfaction for each interest, thereby enabling adaptation of the user's personalized preference based on satisfaction levels. Additionally, we leverage the exposure-unclicked signal (recommended to the user but not clicked) as supervision during training, facilitating the interest satisfaction module to better model the satisfaction degree of user interests. Besides, this module serves as a foundational building block suitable for integration into mainstream sequential-based CTR models. Extensive experiments conducted on two real-world datasets demonstrate the superiority of our proposed model, outperforming state-of-the-art methods across various evaluation metrics. Furthermore, an online A/B test deployed on large-scale recommender systems shows significant improvements achieved by our model in diverse evaluation metrics.
Mao Pan, Wen Shi 0005, Dongyue Wang, Zhuoye Ding, Xiwei Zhao, Sulong Xu
CIKM2