Qiang Chen

Qiang Chen

Auto-generated profile, based on publicly available information

Qiang Chen

Tencent WeChat, Guangzhou, China

Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
26 May 2026 in Machine Intelligence Research
Verified
Journal Article
Closed access
YFYue Feng
Yue Feng
ZYZiyi Yan
Ziyi Yan
YJYizhen Jia
Yizhen Jia
ECEthan Q. Chen
Ethan Q. Chen
JQJie Qin
Jie Qin

10 July 2024
Verified
Conference Paper
Open access
SGShiping Ge
Shiping Ge
QCQiang Chen
Qiang Chen
ZJZhiwei Jiang
Zhiwei Jiang
YYYafeng Yin
Yafeng Yin
ZCZiyao Chen
Ziyao Chen
QGQing Gu
Qing Gu
Short video collection is an easy way for users to consume coherent content on various online short video platforms, such as TikTok, YouTube, Douyin, and WeChat Channel. These collections cover a wide range of content, including online courses, TV series, movies, and cartoons. However, short video creators occasionally publish videos in a disorganized manner due to various reasons, such as revisions, secondary creations, deletions, and reissues, which often result in a poor browsing experience for users. Therefore, accurately reordering videos within a collection based on their content coherence is a vital task that can enhance user experience and presents an intriguing research problem in the field of video narrative reasoning. In this work, we curate a dedicated multimodal dataset for this Short Video Ordering (SVO) task and present the performance of some benchmark methods on the dataset. In addition, we further propose an advanced SVO framework with the aid of position decoding and successor prediction. The proposed framework combines both pairwise and listwise ordering paradigms, which can get rid of the issues from both quadratic growth and cascading conflict in the pairwise paradigm, and improve the performance of existing listwise methods. Extensive experiments demonstrate that our method achieves the best performance on our open SVO dataset, and each component of the framework contributes to the final performance. Both the SVO dataset and code will be released at https://github.com/ShipingGe/SVO.

16 April 2026 in ACM Transactions on Information Systems
Verified
Journal Article
Open access
ZLZihao Li
Zihao Li
QCQiang Chen
Qiang Chen
LZLixin Zou
Lixin Zou
ASAixin Sun
Aixin Sun
CLChenliang Li
Chenliang Li
Existing recommendation methods struggle to model users’ multifaceted preferences due to the diversity and volatility of user behavior, as well as the inherent uncertainty and ambiguity of item themes in practical scenarios. Multi-interest recommendation addresses this challenge by explicitly extracting multiple interest representations from users’ historical interactions, enabling fine-grained preference modeling and more accurate recommendations. It has attracted considerable attention in recommendation research. However, current recommendation surveys have either delved into specific recommendation tasks and downstream applications or focused on approaches that model users and items as single representations with cutting-edge techniques, overlooking users’ diverse preferences and the multifaceted aspects of items. In this work, we systematically review the progress, solutions, challenges, and future directions of multi-interest recommendation by answering the following three questions: (1) Why is multi-interest modeling significantly important for recommendation? (2) What aspects are focused on by multi-interest modeling in recommendation? and (3) How can multi-interest modeling be applied, along with the technical details of the representative modules? We hope that this survey establishes a fundamental framework and delivers a preliminary overview for researchers interested in this field and committed to further exploration. The implementation of multi-interest recommendation summarized in this survey is maintained at https://github.com/WHUIR/Multi-Interest-Recommendation-A-Survey .