Qingxin Meng

Qingxin Meng

Auto-generated profile, based on publicly available information

Qingxin Meng

Department of Entrepreneurship, Marketing and Management Systems, University of Nottingham Ningbo China

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

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

Representative Publications

View All Publications
16 February 2023 in IEEE Transactions on Intelligent Transportation Systems
Verified
Journal Article
Closed access
MLMingzhe Liu
Mingzhe Liu
TZTongyu Zhu
Tongyu Zhu
JYJunchen Ye
Junchen Ye
QMQingxin Meng
Qingxin Meng
LSLeilei Sun
Leilei Sun
BDBowen Du
Bowen Du
Forecasting traffic flow is an important task in urban areas, and a large number of methods have been proposed for traffic flow prediction. However, most of the existing methods follow a general technical route to aggregate historical information spatially and temporally. In this paper, we propose a different approach for traffic flow prediction. Our major motivation is to more effectively incorporate various intrinsic patterns in real-world traffic flows, such as fixed spatial distributions, topological correlations, and temporal periodicity. Along this line, we propose a novel autoencoder-based traffic flow prediction method, named Spatio-Temporal AutoEncoder (ST-AE). The core of our method is an autoencoder specially designed to learn the intrinsic patterns from traffic flow data, and encode the current traffic flow information into a low-dimensional representation. The prediction is made by simply projecting the current hidden states to the future hidden states, and then reconstructing the future traffic flows with the trained autoencoder. We have conducted extensive experiments on four real-world data sets. Our method outperforms existing methods in several settings, particularly for long-term traffic flow prediction.

1 September 2022 in INFORMS Journal on Computing
Verified
Journal Article
Closed access
QMQingxin Meng
Qingxin Meng
Keli XiaoKeli Xiao
Keli Xiao
DSDazhong Shen
Dazhong Shen
HZHengshu Zhu
Hengshu Zhu
HXHui Xiong
Hui Xiong
As a key decision-making process in compensation and benefits (C&B) in human resource management, job salary benchmarking (JSB) plays an indispensable role in attracting, motivating, and retaining talent. Whereas the existing research mainly focuses on revealing the essential impacts of personal and organizational characteristics and economic factors on labor costs (e.g., C&B), few studies target optimizing JSB from a practical, data-driven perspective. Traditional approaches suffer from issues that result from using small and sparse data as well as from the limitations of linear statistical models in practice. Furthermore, there are also important technical issues that need to be addressed in the small number of machine learning–based JSB approaches, such as “cold start” issues when considering a brand-new type of company or job or model interpretability issues. To this end, we propose to address the JSB problem with data-driven techniques from a fine-grained perspective by modeling large-scale, real-world online recruitment data. Specifically, we develop a nonparametric Dirichlet process–based latent factor model (NDP-JSB) to jointly model the latent representations of both company and job position and then apply the model to predict salaries based on company and position information. Our model strengthens the usage of data-driven approaches in JSB optimization by addressing the aforementioned issues in existing models. For evaluation, extensive experiments are conducted on two large-scale, real-world data sets. Our results validate the effectiveness of the NDP-JSB and demonstrate its strength in providing interpretable salary benchmarking to benefit complex decision-making processes in talent management.Summary of Contribution: This paper bridges the cutting-edge machine learning techniques to their implementation in a practical operation research problem in human resources. We focus on optimizing the salary-matching work to help the companies to seek reasonable salaries for their positions by proposing a data-driven approach to capture hidden patterns from user and company profiles. The contributions of this work reside in both operation research and computing. We (1) formulate the JSB optimization problem and (2) solve it by developing a data-driven method along with an effective algorithm optimization. Moreover, the proposed methodology has strengths in addressing the issues of data sparseness and result interpretability.

24 January 2026 in ACM Transactions on Management Information Systems
Verified
Journal Article
Open access
SCShuting Cui
Shuting Cui
YSYing Sun
Ying Sun
YZYuting Zhang
Yuting Zhang
QMQingxin Meng
Qingxin Meng
HZHengshu Zhu
Hengshu Zhu
Job mobility prediction is an emerging field with significant benefits for organizations and individuals, including enhanced job recommendations and career planning. Existing approaches leveraging textual information primarily rely on traditional neural network embedding methods, which are limited in capturing relationships between job-related entities at the semantic level. While Large Language Models (LLMs) offer greater potential by utilizing extensive background knowledge to better understand latent patterns in career trajectories, pure LLMs often struggle with hallucination issues due to insufficient domain-specific knowledge. To bridge this gap, we propose a knowledge graph-enhanced LLM framework, S mart C areer P redictor ( SCP ). Our approach introduces three key innovations: (1) a job-related sub-knowledge graph retrieval mechanism to retain the most relevant job transition patterns, addressing the hallucination problem by providing enriched background knowledge; (2) an entropy-based retrieval score to alleviate graph imbalance issues by ensuring a more equitable representation of career entities; and (3) a multi-modal adapter to effectively integrate textual and graph-based information, enabling more accurate and context-aware job mobility predictions. Experimental results on two real-world career datasets show that our model significantly outperforms state-of-the-art baselines in next career hop prediction. The code for this paper is available at https://github.com/cuishuting/SCP .