Chen Zhu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Chen Zhu has a total of 61 co-authors. Here are the top co-authors by number of shared publications:
- Hengshu Zhu
Computer Network Information Center, Chinese Academy of Sciences, Beijing, China and University of Chinese Academy of Sciences, Beijing, China
10 shared publications - Enhong Chen
University of Science and Technology of China
9 shared publications - Tong Xu
University of Science and Technology of China, Hefei, China
8 shared publications - Hui Xiong
The Hong Kong University of Science and Technology (Guangzhou), Guangzhou, China and The Hong Kong University of Science and Technology, Hong Kong SAR, China
5 shared publications - Chuan Qin
Computer Network Information Center, Chinese Academy of Sciences, Beijing, China and University of Chinese Academy of Sciences, Beijing, China
4 shared publications Hengshu Zhu
Talent Intelligence Center, Baidu, Inc., China
3 shared publications
Latest Publications
- Open Access
- 3 August 2025
- Published by Association for Computing Machinery (ACM)
- p. 814-825
Swarm Intelligence in Geo-Localization: A Multi-Agent Large Vision-Language Model Collaborative Framework
- 3 August 2025
- Published by Association for Computing Machinery (ACM)
- p. 814-825
Open AccessSwarm Intelligence in Geo-Localization: A Multi-Agent Large Vision-Language Model Collaborative Framework
- Open Access
- 20 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 1373-1384
From Missteps to Mastery: Enhancing Low-Resource Dense Retrieval through Adaptive Query Generation
- 20 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 1373-1384
Open AccessFrom Missteps to Mastery: Enhancing Low-Resource Dense Retrieval through Adaptive Query Generation
- Open Access
- 1 January 2025
- Published by HICSS Conference Office
Does More Informative Job Title Lead to More Successful Hirings? A Randomized Field Experiment on an Online Labor Market Platform
Online labor market platforms have rapidly developed over the past few years. The job title, as a crucial piece of observable information, research about its impact on job-related behaviors is lack. In this study, we selected one of the largest blue-collar online labor market platforms in China, constructing a large-scale field experiment on job titles with different degrees of information disclosure depth and breadth generated by the proposed model based on Large language model (LLM), involving more than 50,000 job listings and more than 800,000 users in the platform, to investigate whether the information disclosed in the job title affects the likelihood of the job being viewed and successfully matched. Findings claim the compared with the central route (processing depth information), peripheral route information processing (processing breadth information) is the dominant method on online labor market platforms. Additionally, sufficient processing of breadth information significantly impacts subsequent behaviors.
- 1 January 2025
- Published by HICSS Conference Office
Open AccessDoes More Informative Job Title Lead to More Successful Hirings? A Randomized Field Experiment on an Online Labor Market Platform
Online labor market platforms have rapidly developed over the past few years. The job title, as a crucial piece of observable information, research about its impact on job-related behaviors is lack. In this study, we selected one of the largest blue-collar online labor market platforms in China, constructing a large-scale field experiment on job titles with different degrees of information disclosure depth and breadth generated by the proposed model based on Large language model (LLM), involving more than 50,000 job listings and more than 800,000 users in the platform, to investigate whether the information disclosed in the job title affects the likelihood of the job being viewed and successfully matched. Findings claim the compared with the central route (processing depth information), peripheral route information processing (processing breadth information) is the dominant method on online labor market platforms. Additionally, sufficient processing of breadth information significantly impacts subsequent behaviors.
- 28 August 2024
- Published by Springer Nature
- p. 280-294
Bridging the Information Gap Between Domain-Specific Model and General LLM for Personalized Recommendation
- 28 August 2024
- Published by Springer Nature
- p. 280-294
Bridging the Information Gap Between Domain-Specific Model and General LLM for Personalized Recommendation
- Open Access
- 24 August 2024
- Published by Association for Computing Machinery (ACM)
- p. 1004-1015
Adapting Job Recommendations to User Preference Drift with Behavioral-Semantic Fusion Learning
Job recommender systems are crucial for aligning job opportunities with job-seekers in online job-seeking. However, users tend to adjust their job preferences to secure employment opportunities continually, which limits the performance of job recommendations. The inherent frequency of preference drift poses a challenge to promptly and precisely capture user preferences. To address this issue, we propose a novel session-based framework, BISTRO, to timely model user preference through fusion learning of semantic and behavioral information. Specifically, BISTRO is composed of three stages: 1) coarse-grained semantic clustering, 2) fine-grained job preference extraction, and 3) personalized top-k job recommendation. Initially, BISTRO segments the user interaction sequence into sessions and leverages session-based semantic clustering to achieve broad identification of person-job matching. Subsequently, we design a hypergraph wavelet learning method to capture the nuanced job preference drift. To mitigate the effect of noise in interactions caused by frequent preference drift, we innovatively propose an adaptive wavelet filtering technique to remove noisy interaction. Finally, a recurrent neural network is utilized to analyze session-based interaction for inferring personalized preferences. Extensive experiments on three real-world offline recruitment datasets demonstrate the significant performances of our framework. Significantly, BISTRO also excels in online experiments, affirming its effectiveness in live recruitment settings. This dual success underscores the robustness and adaptability of BISTRO. The source code is available at https://github.com/Applied-Machine-Learning-Lab/BISTRO.
- 24 August 2024
- Published by Association for Computing Machinery (ACM)
- p. 1004-1015
Open AccessAdapting Job Recommendations to User Preference Drift with Behavioral-Semantic Fusion Learning
Job recommender systems are crucial for aligning job opportunities with job-seekers in online job-seeking. However, users tend to adjust their job preferences to secure employment opportunities continually, which limits the performance of job recommendations. The inherent frequency of preference drift poses a challenge to promptly and precisely capture user preferences. To address this issue, we propose a novel session-based framework, BISTRO, to timely model user preference through fusion learning of semantic and behavioral information. Specifically, BISTRO is composed of three stages: 1) coarse-grained semantic clustering, 2) fine-grained job preference extraction, and 3) personalized top-k job recommendation. Initially, BISTRO segments the user interaction sequence into sessions and leverages session-based semantic clustering to achieve broad identification of person-job matching. Subsequently, we design a hypergraph wavelet learning method to capture the nuanced job preference drift. To mitigate the effect of noise in interactions caused by frequent preference drift, we innovatively propose an adaptive wavelet filtering technique to remove noisy interaction. Finally, a recurrent neural network is utilized to analyze session-based interaction for inferring personalized preferences. Extensive experiments on three real-world offline recruitment datasets demonstrate the significant performances of our framework. Significantly, BISTRO also excels in online experiments, affirming its effectiveness in live recruitment settings. This dual success underscores the robustness and adaptability of BISTRO. The source code is available at https://github.com/Applied-Machine-Learning-Lab/BISTRO.
- Top Cited Papers
- 22 August 2024
- Published by Springer Nature in World Wide Web
- Vol. 27 (5) , 1-31
A survey on large language models for recommendation
- 22 August 2024
- Published by Springer Nature in World Wide Web
- Vol. 27 (5) , 1-31
Top Cited PapersA survey on large language models for recommendation
- Open Access
- 12 June 2024
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Multimedia Computing, Communications, and Applications
- Vol. 20 (8) , 1-21
InteractNet: Social Interaction Recognition for Semantic-rich Videos
The overwhelming surge of online video platforms has raised an urgent need for social interaction recognition techniques. Compared with simple short-term actions, long-term social interactions in semantic-rich videos could reflect more complicated semantics such as character relationships or emotions, which will better support various downstream applications, e.g., story summarization and fine-grained clip retrieval. However, considering the longer duration of social interactions with severe mutual overlap, involving multiple characters, dynamic scenes, and multi-modal cues, among other factors, traditional solutions for short-term action recognition may probably fail in this task. To address these challenges, in this article, we propose a hierarchical graph-based system, named InteractNet, to recognize social interactions in a multi-modal perspective. Specifically, our approach first generates a semantic graph for each sampled frame with integrating multi-modal cues and then learns the node representations as short-term interaction patterns via an adapted GCN module. Along this line, global interaction representations are accumulated through a sub-clip identification module, effectively filtering out irrelevant information and resolving temporal overlaps between interactions. In the end, the association among simultaneous interactions will be captured and modelled by constructing a global-level character-pair graph to predict the final social interactions. Comprehensive experiments on publicly available datasets demonstrate the effectiveness of our approach compared with state-of-the-art baseline methods.
- 12 June 2024
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Multimedia Computing, Communications, and Applications
- Vol. 20 (8) , 1-21
Open AccessInteractNet: Social Interaction Recognition for Semantic-rich Videos
The overwhelming surge of online video platforms has raised an urgent need for social interaction recognition techniques. Compared with simple short-term actions, long-term social interactions in semantic-rich videos could reflect more complicated semantics such as character relationships or emotions, which will better support various downstream applications, e.g., story summarization and fine-grained clip retrieval. However, considering the longer duration of social interactions with severe mutual overlap, involving multiple characters, dynamic scenes, and multi-modal cues, among other factors, traditional solutions for short-term action recognition may probably fail in this task. To address these challenges, in this article, we propose a hierarchical graph-based system, named InteractNet, to recognize social interactions in a multi-modal perspective. Specifically, our approach first generates a semantic graph for each sampled frame with integrating multi-modal cues and then learns the node representations as short-term interaction patterns via an adapted GCN module. Along this line, global interaction representations are accumulated through a sub-clip identification module, effectively filtering out irrelevant information and resolving temporal overlaps between interactions. In the end, the association among simultaneous interactions will be captured and modelled by constructing a global-level character-pair graph to predict the final social interactions. Comprehensive experiments on publicly available datasets demonstrate the effectiveness of our approach compared with state-of-the-art baseline methods.
- 30 November 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems for Video Technology
- Vol. 34 (6) , 5160-5175
When I Fall in Love: Capturing Video-Oriented Social Relationship Evolution via Attentive GNN
With the booming of streaming media platforms, viewers now get used to watching dramas and movies via online platforms with more intelligent services. Usually, character relationships may dynamically evolve with stories promoting in long videos. Therefore, automatic tools to capture the social relation evolution among characters are urgently required to enrich the viewing experience. However, most existing works mainly focus on shorter isolated video clips. Considering the development of the plot, they may fail to effectively summarize relationships as holistic semantic representations for the whole video. To deal with these challenges, in this paper, we propose a novel Dynamic-Evolutionary Graph Attention Network (DE-GAT) framework to generate the evolving social relation graph among characters and capture the characters’ relation evolutionary trajectory throughout the entire video. DE-GAT first integrates the multimodal cues, including visual and textual information in each video clip via the graph attention network (GAT). Expanding the temporal receptive field from clip-level to scenario-level, the most relevant factors of the evolution of social relationships can be explored. Eventually, all the scenario-level social graphs are merged to obtain the evolving global social graph for the entire movie. Extensive evaluations on the real-world MovieGraphs dataset have validated the positive impact of temporal receptive field expansion and multimodal cues on capturing evolving social relations.
- 30 November 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems for Video Technology
- Vol. 34 (6) , 5160-5175
When I Fall in Love: Capturing Video-Oriented Social Relationship Evolution via Attentive GNN
With the booming of streaming media platforms, viewers now get used to watching dramas and movies via online platforms with more intelligent services. Usually, character relationships may dynamically evolve with stories promoting in long videos. Therefore, automatic tools to capture the social relation evolution among characters are urgently required to enrich the viewing experience. However, most existing works mainly focus on shorter isolated video clips. Considering the development of the plot, they may fail to effectively summarize relationships as holistic semantic representations for the whole video. To deal with these challenges, in this paper, we propose a novel Dynamic-Evolutionary Graph Attention Network (DE-GAT) framework to generate the evolving social relation graph among characters and capture the characters’ relation evolutionary trajectory throughout the entire video. DE-GAT first integrates the multimodal cues, including visual and textual information in each video clip via the graph attention network (GAT). Expanding the temporal receptive field from clip-level to scenario-level, the most relevant factors of the evolution of social relationships can be explored. Eventually, all the scenario-level social graphs are merged to obtain the evolving global social graph for the entire movie. Extensive evaluations on the real-world MovieGraphs dataset have validated the positive impact of temporal receptive field expansion and multimodal cues on capturing evolving social relations.
- Open Access
Bridging the Information Gap Between Domain-Specific Model and General LLM for Personalized Recommendation
Generative large language models(LLMs) are proficient in solving general problems but often struggle to handle domain-specific tasks. This is because most of domain-specific tasks, such as personalized recommendation, rely on task-related information for optimal performance. Current methods attempt to supplement task-related information to LLMs by designing appropriate prompts or employing supervised fine-tuning techniques. Nevertheless, these methods encounter the certain issue that information such as community behavior pattern in RS domain is challenging to express in natural language, which limits the capability of LLMs to surpass state-of-the-art domain-specific models. On the other hand, domain-specific models for personalized recommendation which mainly rely on user interactions are susceptible to data sparsity due to their limited common knowledge capabilities. To address these issues, we proposes a method to bridge the information gap between the domain-specific models and the general large language models. Specifically, we propose an information sharing module which serves as an information storage mechanism and also acts as a bridge for collaborative training between the LLMs and domain-specific models. By doing so, we can improve the performance of LLM-based recommendation with the help of user behavior pattern information mined by domain-specific models. On the other hand, the recommendation performance of domain-specific models can also be improved with the help of common knowledge learned by LLMs. Experimental results on three real-world datasets have demonstrated the effectiveness of the proposed method.
Open AccessBridging the Information Gap Between Domain-Specific Model and General LLM for Personalized Recommendation
Generative large language models(LLMs) are proficient in solving general problems but often struggle to handle domain-specific tasks. This is because most of domain-specific tasks, such as personalized recommendation, rely on task-related information for optimal performance. Current methods attempt to supplement task-related information to LLMs by designing appropriate prompts or employing supervised fine-tuning techniques. Nevertheless, these methods encounter the certain issue that information such as community behavior pattern in RS domain is challenging to express in natural language, which limits the capability of LLMs to surpass state-of-the-art domain-specific models. On the other hand, domain-specific models for personalized recommendation which mainly rely on user interactions are susceptible to data sparsity due to their limited common knowledge capabilities. To address these issues, we proposes a method to bridge the information gap between the domain-specific models and the general large language models. Specifically, we propose an information sharing module which serves as an information storage mechanism and also acts as a bridge for collaborative training between the LLMs and domain-specific models. By doing so, we can improve the performance of LLM-based recommendation with the help of user behavior pattern information mined by domain-specific models. On the other hand, the recommendation performance of domain-specific models can also be improved with the help of common knowledge learned by LLMs. Experimental results on three real-world datasets have demonstrated the effectiveness of the proposed method.
- Open Access
- 7 November 2023
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Information Systems
- Vol. 42 (2) , 1-32
SetRank: A Setwise Bayesian Approach for Collaborative Ranking in Recommender System
The recent development of recommender systems has a focus on collaborative ranking, which provides users with a sorted list rather than rating prediction. The sorted item lists can more directly reflect the preferences for users and usually perform better than rating prediction in practice. While considerable efforts have been made in this direction, the well-known pairwise and listwise approaches have still been limited by various challenges. Specifically, for the pairwise approaches, the assumption of independent pairwise preference is not always held in practice. Also, the listwise approaches cannot efficiently accommodate “ties” and unobserved data due to the precondition of the entire list permutation. To this end, in this article, we propose a novel setwise Bayesian approach for collaborative ranking, namely, SetRank, to inherently accommodate the characteristics of user feedback in recommender systems. SetRank aims to maximize the posterior probability of novel setwise preference structures and three implementations for SetRank are presented. We also theoretically prove that the bound of excess risk in SetRank can be proportional to \(\sqrt {M/N}\) , where M and N are the numbers of items and users, respectively. Finally, extensive experiments on four real-world datasets clearly validate the superiority of SetRank compared with various state-of-the-art baselines.- 7 November 2023
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Information Systems
- Vol. 42 (2) , 1-32
Open AccessSetRank: A Setwise Bayesian Approach for Collaborative Ranking in Recommender System
The recent development of recommender systems has a focus on collaborative ranking, which provides users with a sorted list rather than rating prediction. The sorted item lists can more directly reflect the preferences for users and usually perform better than rating prediction in practice. While considerable efforts have been made in this direction, the well-known pairwise and listwise approaches have still been limited by various challenges. Specifically, for the pairwise approaches, the assumption of independent pairwise preference is not always held in practice. Also, the listwise approaches cannot efficiently accommodate “ties” and unobserved data due to the precondition of the entire list permutation. To this end, in this article, we propose a novel setwise Bayesian approach for collaborative ranking, namely, SetRank, to inherently accommodate the characteristics of user feedback in recommender systems. SetRank aims to maximize the posterior probability of novel setwise preference structures and three implementations for SetRank are presented. We also theoretically prove that the bound of excess risk in SetRank can be proportional to \(\sqrt {M/N}\) , where M and N are the numbers of items and users, respectively. Finally, extensive experiments on four real-world datasets clearly validate the superiority of SetRank compared with various state-of-the-art baselines.