Chenxing Wang 0001

dblp:144/6318-1 · DBLP profile ↗
← Back
8ranked-venue papers in the field
1as first author
8since 2021 · last 2026
0000-0003-4096-7972ORCID · verified

Domains — venue-derived; a paper can count in several

Information Retrieval & Web Search · 5 (1 first)Database Systems & Data Management · 1Knowledge Engineering, Semantic Web & Information Systems · 1Other / Interdisciplinary · 1
YearPublicationVenuePosition
2026 When & How to Write for Personalized Demand-aware Query Rewriting in Video Search
abstract
In video search systems, user historical behaviors provide rich context for identifying search intent and resolving ambiguity. However, traditional methods utilizing implicit history features often suffer from signal dilution and delayed feedback. To address these challenges, we propose WeWrite, a novel Personalized Demand-aware Query Rewriting framework. Specifically, WeWrite tackles three key challenges: (1) When to Write: An automated posterior-based mining strategy extracts high-quality samples from user logs, identifying scenarios where personalization is strictly necessary; (2) How to Write: A hybrid training paradigm combines Supervised Fine-Tuning (SFT) with Group Relative Policy Optimization (GRPO) to align the LLM's output style with the retrieval system; (3) Deployment: A parallel "Fake Recall" architecture ensures low latency. Online A/B testing on a large-scale video platform demonstrates that WeWrite improves the Click-Through Video Volume (VV$>$10s) by 1.07% and reduces the Query Reformulation Rate by 2.97%.
Cheng Cheng 0011, Chenxing Wang 0001, Aolin Li, Haijun Wu, Huiyun Hu, Juyuan Wang, Dongliang Liao
SIGIR2
2026 WeSEAL: Well-calibrated Search for Eliminating Attention-sink Leakage
Juyuan Wang, Chenxing Wang 0001, Aolin Li, Huiyun Hu, Yuchen Fang 0001, Haijun Wu, Jin Xu 0014, Dongliang Liao
SIGIR2
2026 Bridging Explicit and Implicit Intent: Unified Interest Generative Method for Joint Search-Recommendation Modeling
abstract
Search and Recommendation (S&R) are core information access channels on modern multi-scenario platforms. Existing joint S&R models face two critical challenges: (1) cross-scenario interest inconsistency, failing to unify explicit search intent (queries) and implicit recommendation intent (behavioral interactions) into coherent user interest representations; (2) severe S&R trade-off, where enhancing one task degrades the other due to static knowledge sharing and unbalanced feature utilization. To address these issues, we propose MinSAR, a novel framework focusing on cross-S&R user interest consistency. It integrates two key innovations: a Unified Interest Generation (UIG) module using Vector Quantized-Variational Autoencoder (VQ-VAE) to fuse long-term user preferences (via a user-specific memory network) and dynamic short-term contextual behaviors, generating compact cross-scenario latent representations that bridge explicit and implicit intents. Additionally, an Interest-Guided Attention Expert Network replaces static multi-task gating with intent-aware weight allocation. Guided by UIG's unified interest, it dynamically balances cross-S&R shared knowledge and task-specific expertise (semantic matching for search, collaborative filtering for recommendation), mitigating inter-task conflicts. Extensive experiments on two real-world datasets (KuaiSAR and Amazon Kindle Store) against 13 baselines show MinSAR outperforms state-of-the-art joint S&R models. Further analysis confirms its ability to eliminate the S&R performance trade-off.
Dongliang Liao, Chenxing Wang 0001, Yawen Zeng
WWW2
2024 Towards Effective Fusion and Forecasting of Multimodal Spatio-temporal Data for Smart Mobility
abstract
With the rapid development of location based services, multimodal spatio-temporal (ST) data including trajectories, transportation modes, traffic flow and social check-ins are being collected for deep learning based methods. These deep learning based methods learn ST correlations to support the downstream tasks in the fields such as smart mobility, smart city and other intelligent transportation systems. Despite their effectiveness, ST data fusion and forecasting methods face practical challenges in real-world scenarios. First, forecasting performance for ST data-insufficient area is inferior, making it necessary to transfer meta knowledge from heterogeneous area to enhance the sparse representations. Second, it is nontrivial to accurately forecast in multi-transportation-mode scenarios due to the fine-grained ST features of similar transportation modes, making it necessary to distinguish and measure the ST correlations to alleviate the influence caused by entangled ST features. At last, partial data modalities (e.g., transportation mode) are lost due to privacy or technical issues in certain scenarios, making it necessary to effectively fuse the multimodal sparse ST features and enrich the ST representations. To tackle these challenges, our research work aim to develop effective fusion and forecasting methods for multimodal ST data in smart mobility scenario. In this paper, we will introduce our recent works that investigates the challenges in terms of various real-world applications and establish the open challenges in this field for future work.
Chenxing Wang 0001
CIKM1
2023 When Spatio-Temporal Meet Wavelets: Disentangled Traffic Forecasting via Efficient Spectral Graph Attention Networks
abstract
Traffic forecasting is crucial for public safety and resource optimization, yet is very challenging due to the temporal changes and the dynamic spatial correlations of the traffic data. To capture these intricate dependencies, spatio-temporal networks, such as recurrent neural networks with graph convolution networks, graph convolution networks with temporal convolution networks, and temporal attention networks with full graph attention networks, are applied. However, previous spatio-temporal networks are based on end-to-end training and thus fail to handle the distribution shift in the non-stationary traffic time series. On the other hand, the efficient and effective algorithm for modeling spatial correlations is still lacking in prior networks.In this paper, rather than proposing yet another end-to-end model, we aim to provide a novel disentangle-fusion framework STWave to mitigate the distribution shift issue. The framework first decouples the complex traffic data into stable trends and fluctuating events, followed by a dual-channel spatio-temporal network to model trends and events, respectively. Finally, reasonable future traffic can be predicted through the fusion of trends and events. Besides, we incorporate a novel query sampling strategy and graph wavelet-based graph positional encoding into the full graph attention network to efficiently and effectively model dynamic spatial correlations. Extensive experiments on six traffic datasets show the superiority of our approach, i.e., the higher forecasting accuracy with lower computational cost.
Yuchen Fang 0001, Yanjun Qin, Haiyong Luo, Fang Zhao 0003, Bingbing Xu 0001, Liang Zeng 0002, Chenxing Wang 0001
ICDE7
2023 Spatio-temporal hierarchical MLP network for traffic forecasting
Yanjun Qin, Haiyong Luo, Fang Zhao 0003, Yuchen Fang 0001, Xiaoming Tao 0001, Chenxing Wang 0001
Inf. Sci.6
2022 Next Point-of-Interest Recommendation with Auto-Correlation Enhanced Multi-Modal Transformer Network
abstract
Next Point-of-Interest (POI) recommendation is a pivotal issue for researchers in the field of location-based social networks. While many recent efforts show the effectiveness of recurrent neural network-based next POI recommendation algorithms, several important challenges have not been well addressed yet: (i) The majority of previous models only consider the dependence of consecutive visits, while ignoring the intricate dependencies of POIs in traces; (ii) The nature of hierarchical and the matching of sub-sequence in POI sequences are hardly model in prior methods; (iii) Most of the existing solutions neglect the interactions between two modals of POI and the density category. To tackle the above challenges, we propose an auto-correlation enhanced multi-modal Transformer network (AutoMTN) for the next POI recommendation. Particularly, AutoMTN uses the Transformer network to explicitly exploits connections of all the POIs along the trace. Besides, to discover the dependencies at the sub-sequence level and attend to cross-modal interactions between POI and category sequences, we replace self-attention in Transformer with the auto-correlation mechanism and design a multi-modal network. Experiments results on two real-world datasets demonstrate the ascendancy of AutoMTN contra state-of-the-art methods in the next POI recommendation.
Yanjun Qin, Yuchen Fang 0001, Haiyong Luo, Fang Zhao 0003, Chenxing Wang 0001
SIGIR5
2022 Memory attention enhanced graph convolution long short-term memory network for traffic forecasting
abstract
In recent years, traffic forecasting has gradually attracted attention in data mining because of the increasing availability of large-scale traffic data. However, it faces substantial challenges of complex temporal-spatial correlations in traffic. Recent studies mainly focus on modeling the local spatial correlations by utilizing graph neural networks and neglect the influence of long-distance spatial correlations. Besides, most existing works utilize recurrent neural networks-based encoder–decoder architecture to forecast multistep traffic volume and suffer from accumulative errors in recurrent neural networks. To deal with these issues, we propose the memory attention (MA) enhanced graph convolution long short-term memory network (MAEGCLSTM), a novel deep learning model for traffic forecasting. Specifically, MAEGCLSTM combines the MA and the vanilla graph convolution long short-term memory to capture global and local spatio-temporal dependencies, respectively. Then MAEGCLSTM utilizes a simplified GCLSTM to effectively fuse the global and local information. Moreover, we integrate the MAEGCLSTM into an encoder–decoder architecture to forecast multistep traffic volume. Besides MAEGCLSTM, we add the convolution neural network and encoder–decoder attention into the decoder to ease accumulative errors caused by iterative prediction and gain whole historical information from the encoder. Experiments on four real-world traffic data sets show that our model significantly outperforms by up to 6.07 % $6.07 \% $ improvement in L 1 $L1$ measure over 14 baselines.
Yanjun Qin, Fang Zhao 0003, Yuchen Fang 0001, Haiyong Luo, Chenxing Wang 0001
Int. J. Intell. Syst.5