Xiao Hu
Research Subjects
Xiao Hu has a total of 16 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
4 shared publications - Zhi Zheng
State Key Laboratory of Cognitive Intelligence, University of Science and Technology of China, Hefei, Anhui, China
3 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
2 shared publications - Shanshan Gao
Boss Zhipin, Beijing, China
2 shared publications - Yuan Cheng
Career Science Lab, BOSS Zhipin, Beijing, China
2 shared publications - Chen Zhu
University of Science & Technology of China
1 shared publication
Latest Publications
- 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.
- Open Access
- 10 July 2024
- Published by Association for Computing Machinery (ACM)
- p. 543-552
MIRROR: A Multi-View Reciprocal Recommender System for Online Recruitment
Reciprocal Recommender Systems (RRSs) which aim to satisfy the preferences of both service providers and seekers simultaneously has attracted significant research interest in recent years. Existing studies on RRSs mainly focus on modeling the bilateral interactions between the users on both sides to capture the user preferences. However, due to the presence of exposure bias, modeling user preferences solely based on bilateral interactions often lacks precision. Additionally, in RRSs, users may exhibit varying preferences when acting in different roles, and how to effectively model users from multiple perspectives remains a substantial problem. To solve the above challenges, in this paper, we propose a novel MultI-view Reciprocal Recommender system for Online Recruitment (MIRROR). Specifically, we first propose to model the users from three different views, respectively search, active, and passive views, and we further design several Transformer-based sequential models to capture the user representation corresponding to each view. Then, we propose to divide the bilateral matching process into three stages, respectively apply, reply, and match, and a multi-stage output layer is designed based on the above multi-view modeling results. To train our MIRROR model, we first design a multi-task learning loss based on the multi-stage output results. Moreover, to bridge the semantic gap between search queries and user behaviors, we additionally design a supplementary task for next-query prediction. Finally, we conduct both offline experiments on five real-world datasets and online A/B tests, and the experiment results clearly validate the effectiveness of our MIRROR model compared with several state-of-the-art baseline methods.
- 10 July 2024
- Published by Association for Computing Machinery (ACM)
- p. 543-552
Open AccessMIRROR: A Multi-View Reciprocal Recommender System for Online Recruitment
Reciprocal Recommender Systems (RRSs) which aim to satisfy the preferences of both service providers and seekers simultaneously has attracted significant research interest in recent years. Existing studies on RRSs mainly focus on modeling the bilateral interactions between the users on both sides to capture the user preferences. However, due to the presence of exposure bias, modeling user preferences solely based on bilateral interactions often lacks precision. Additionally, in RRSs, users may exhibit varying preferences when acting in different roles, and how to effectively model users from multiple perspectives remains a substantial problem. To solve the above challenges, in this paper, we propose a novel MultI-view Reciprocal Recommender system for Online Recruitment (MIRROR). Specifically, we first propose to model the users from three different views, respectively search, active, and passive views, and we further design several Transformer-based sequential models to capture the user representation corresponding to each view. Then, we propose to divide the bilateral matching process into three stages, respectively apply, reply, and match, and a multi-stage output layer is designed based on the above multi-view modeling results. To train our MIRROR model, we first design a multi-task learning loss based on the multi-stage output results. Moreover, to bridge the semantic gap between search queries and user behaviors, we additionally design a supplementary task for next-query prediction. Finally, we conduct both offline experiments on five real-world datasets and online A/B tests, and the experiment results clearly validate the effectiveness of our MIRROR model compared with several state-of-the-art baseline methods.
- 7 May 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 36 (11) , 5681-5694
Bilateral Multi-Behavior Modeling for Reciprocal Recommendation in Online Recruitment
Recent years have witnessed the rapid development of online recruitment platforms, which provide a convenient way for matching job seekers and recruiters. Indeed, this is a reciprocal recommendation problem which needs to consider the preferences of both job seekers and recruiters simultaneously. Existing studies mainly focus on building recommendation models based on text matching or collaborative filtering methods. However, we propose that these methods are limited and insufficient, since the abundant multi-typed bilateral behaviors among users have been largely ignored. Therefore, in this paper, we propose a novel BilAteral Multi-BehaviOr mOdeling (BAMBOO) method for reciprocal recommendation in online recruitment, which can model the multi-typed interactions from expectation perspective and competitiveness perspective . Specifically, for the expectation perspective, we propose to format the historical behaviors of different users as bilateral multi-behavior sequences, and we utilize a transformer-based model to learn the representations of what the users want to obtain. For the competitiveness perspective, we propose to construct a bilateral interaction heterogeneous graph to describe the entire recruitment market, and further utilize a heterogeneous graph transformer-based model to learn the representations of what the users can obtain. Moreover, we utilize contrastive learning methods to enhance these two modules. Furthermore, we propose to decompose the matching probability into the product of two parts, and we train our model based on a multi-task learning strategy. We conduct both offline experiments on real-world datasets and online A/B test, and the experiment results validate the effectiveness of our BAMBOO model compared with several state-of-the-art baseline methods.
- 7 May 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 36 (11) , 5681-5694
Bilateral Multi-Behavior Modeling for Reciprocal Recommendation in Online Recruitment
Recent years have witnessed the rapid development of online recruitment platforms, which provide a convenient way for matching job seekers and recruiters. Indeed, this is a reciprocal recommendation problem which needs to consider the preferences of both job seekers and recruiters simultaneously. Existing studies mainly focus on building recommendation models based on text matching or collaborative filtering methods. However, we propose that these methods are limited and insufficient, since the abundant multi-typed bilateral behaviors among users have been largely ignored. Therefore, in this paper, we propose a novel BilAteral Multi-BehaviOr mOdeling (BAMBOO) method for reciprocal recommendation in online recruitment, which can model the multi-typed interactions from expectation perspective and competitiveness perspective . Specifically, for the expectation perspective, we propose to format the historical behaviors of different users as bilateral multi-behavior sequences, and we utilize a transformer-based model to learn the representations of what the users want to obtain. For the competitiveness perspective, we propose to construct a bilateral interaction heterogeneous graph to describe the entire recruitment market, and further utilize a heterogeneous graph transformer-based model to learn the representations of what the users can obtain. Moreover, we utilize contrastive learning methods to enhance these two modules. Furthermore, we propose to decompose the matching probability into the product of two parts, and we train our model based on a multi-task learning strategy. We conduct both offline experiments on real-world datasets and online A/B test, and the experiment results validate the effectiveness of our BAMBOO model compared with several state-of-the-art baseline methods.
- Open Access
- 4 August 2023
- Published by Association for Computing Machinery (ACM)
- p. 4146-4155
BOSS: A Bilateral Occupational-Suitability-Aware Recommender System for Online Recruitment
- 4 August 2023
- Published by Association for Computing Machinery (ACM)
- p. 4146-4155
Open AccessBOSS: A Bilateral Occupational-Suitability-Aware Recommender System for Online Recruitment
- 1 April 2023
- Published by Wiley in SID Symposium Digest of Technical Papers
- Vol. 54 (S1) , 375-378
50.6: Establishing of the Device‐independent Mura Simulation and Quantitative Evaluation Dataset
There is a need to establish a novel dataset for the development of better Mura quantitative evaluation method. Our proposed Mura simulation and quantitative evaluation (MSQE) dataset consists of Mura simulation images and the corresponding quantitative evaluation values. For the Mura simulation images, the images are described in CIE 1931 XYZ space instead of traditional RGB space to achieve device‐independent on any display panels. For the quantitative evaluation values, the unique subjective quantitative evaluation value for each simulation image is obtained by subjective experiments conducted by different researchers, different observers, and on different panels, so that the uncertainty can be minimized by statistical analysis. The number of samples are growing with more simulation images and corresponding evaluation values being added into the dataset, so that more actual Mura patterns can be included into the dataset. Our proposed MSQE dataset makes it easier to improve the performance of Mura quantitative evaluation.
- 1 April 2023
- Published by Wiley in SID Symposium Digest of Technical Papers
- Vol. 54 (S1) , 375-378
50.6: Establishing of the Device‐independent Mura Simulation and Quantitative Evaluation Dataset
There is a need to establish a novel dataset for the development of better Mura quantitative evaluation method. Our proposed Mura simulation and quantitative evaluation (MSQE) dataset consists of Mura simulation images and the corresponding quantitative evaluation values. For the Mura simulation images, the images are described in CIE 1931 XYZ space instead of traditional RGB space to achieve device‐independent on any display panels. For the quantitative evaluation values, the unique subjective quantitative evaluation value for each simulation image is obtained by subjective experiments conducted by different researchers, different observers, and on different panels, so that the uncertainty can be minimized by statistical analysis. The number of samples are growing with more simulation images and corresponding evaluation values being added into the dataset, so that more actual Mura patterns can be included into the dataset. Our proposed MSQE dataset makes it easier to improve the performance of Mura quantitative evaluation.