Xiang Chen
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Xiang Chen has a total of 120 co-authors. Here are the top co-authors by number of shared publications:
- Chunming Wu
Zhejiang University, Hangzhou, China
35 shared publications - Dong Zhang
Fuzhou University, Fuzhou, Fujian, China
23 shared publications - Xuan Liu
College of Information and Artificial Intelligence (College of Industrial Software), Yangzhou University, Yangzhou, China
22 shared publications - Hongyan Liu
Fuzhou University, Fuzhou, Fujian, China
20 shared publications - Qun Huang
National Key Laboratory for Multimedia Information Processing, School of Computer Science, Peking University, Beijing, China
16 shared publications - Haifeng Zhou
College of Control Science and Engineering, Zhejiang University, Hangzhou, China
13 shared publications
Latest Publications
- Open Access
- 14 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 113-128
Medivh: Harnessing Compatible and Accurate Sketch-based Network Measurement with Sparsity-based Virtualization
- 14 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 113-128
Open AccessMedivh: Harnessing Compatible and Accurate Sketch-based Network Measurement with Sparsity-based Virtualization
- Open Access
- 9 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 11278-11286
SGPDFuse: Semantically-Guided Physics-Disentanglement General Multi-Modal Image Fusion
- 9 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 11278-11286
Open AccessSGPDFuse: Semantically-Guided Physics-Disentanglement General Multi-Modal Image Fusion
- Open Access
- 9 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 747-755
SketchScan: Harnessing Accurate and Low-Cost Multimodal Anomaly Detection in Blockchain Networks
- 9 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 747-755
Open AccessSketchScan: Harnessing Accurate and Low-Cost Multimodal Anomaly Detection in Blockchain Networks
- Open Access
- 11 October 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Information Systems
Distilling Transitional Patterns to Multimodal Large Language Models for Session-based Recommendation
Session-based recommendation (SBR) predicts the next item based on anonymous sessions. Traditional SBR explores user intents based on ID collaborations or auxiliary content. To further alleviate data sparsity and cold-start issues, recent Multimodal SBR (MSBR) methods utilize simplistic pre-trained models for modality learning but have limitations in semantic richness. Considering the semantic reasoning abilities of multimodal Large Language Models (LLMs) and the practical request for high inference efficiency, we focus on the LLM-enhanced MSBR scenario in this paper, which leverages LLM cognition for comprehensive multimodal representation generation, to enhance downstream MSBR. Tackling this problem faces two challenges: i) how to obtain LLM cognition on both inherent multimodal knowledge and transitional patterns, ii) how to align transitional patterns and inherent knowledge into one unified LLM without increasing inference complexity. To this end, we propose a multimodal LLM-enhanced framework TPAD, which extends a teacher-student distillation paradigm to decouple and align transitional patterns for promoting MSBR. TPAD establishes parallel Knowledge-MLLM and Transfer-MLLM, where the former as student model interprets item knowledge-reflected features and the latter as teacher model extracts transition-aware features. Transitional pattern alignment harnessing mutual information estimation unites two MLLMs, distilling transitional patterns into representations. Extensive experiments on real-world datasets demonstrate the effectiveness of TPAD. Implementation codes are available at https://github.com/TiliaceaeSU/TPAD .
- 11 October 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Information Systems
Open AccessDistilling Transitional Patterns to Multimodal Large Language Models for Session-based Recommendation
Session-based recommendation (SBR) predicts the next item based on anonymous sessions. Traditional SBR explores user intents based on ID collaborations or auxiliary content. To further alleviate data sparsity and cold-start issues, recent Multimodal SBR (MSBR) methods utilize simplistic pre-trained models for modality learning but have limitations in semantic richness. Considering the semantic reasoning abilities of multimodal Large Language Models (LLMs) and the practical request for high inference efficiency, we focus on the LLM-enhanced MSBR scenario in this paper, which leverages LLM cognition for comprehensive multimodal representation generation, to enhance downstream MSBR. Tackling this problem faces two challenges: i) how to obtain LLM cognition on both inherent multimodal knowledge and transitional patterns, ii) how to align transitional patterns and inherent knowledge into one unified LLM without increasing inference complexity. To this end, we propose a multimodal LLM-enhanced framework TPAD, which extends a teacher-student distillation paradigm to decouple and align transitional patterns for promoting MSBR. TPAD establishes parallel Knowledge-MLLM and Transfer-MLLM, where the former as student model interprets item knowledge-reflected features and the latter as teacher model extracts transition-aware features. Transitional pattern alignment harnessing mutual information estimation unites two MLLMs, distilling transitional patterns into representations. Extensive experiments on real-world datasets demonstrate the effectiveness of TPAD. Implementation codes are available at https://github.com/TiliaceaeSU/TPAD .
- Open Access
- 8 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 473-483
LF-Filter: Differentiated Processing for Intra-Flow Packet Delay Monitoring in High-Speed Data Streams
- 8 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 473-483
Open AccessLF-Filter: Differentiated Processing for Intra-Flow Packet Delay Monitoring in High-Speed Data Streams
- Open Access
- 8 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 13123-13134
OmniPlan: An Adaptive Framework for Timely and Near-Optimal Network Planning Optimization
\noindent Network planning optimization is a fundamental problem across diverse domains, including transportation systems, communication networks, and power grids. It requires simultaneous optimization of multiple competing objectives under complex constraints. Existing network planning optimization frameworks rely on mixed integer programming (MIP) solvers, heuristics, and deep reinforcement learning (DRL) models to compute planning decisions. However, they lack effective adaptability to diverse and dynamic user intents, thus leading to the trade-off between execution time and optimality. In this paper, we propose OmniPlan, an adaptive framework that achieves both timeliness and near-optimality in network planning optimization. To achieve the adaptability lacking in existing solutions, OmniPlan employs a large language model (LLM)-based interpreter to convert heterogeneous natural-language intents into a unified and quantifiable user-preference vector. Then it employs a mixture-of-experts architecture that integrates MIP solvers, heuristics, and DRL models as specialized experts, where OmniPlan adapts to diverse intents by dynamically selecting timely and near-optimal experts. Finally, it incorporates a DRL-based expert configuration module that fine-tunes optimization objective weights to align planning decisions with user-specific preferences. We evaluate OmniPlan with a representative real-world workload, i.e., distributed machine learning (ML), where we leverage OmniPlan to offload a wide spectrum of ML inference tasks, e.g., decision trees, SVM, naive Bayes, XGBoost, and random forests, onto a network of hardware devices. Our experiments on a real-world testbed indicate that OmniPlan achieves near-optimal and low-execution-time offloading for real-world ML inference tasks, reducing latency by up to 97.8% and network device resource consumption by up to 11.5%.
- 8 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 13123-13134
Open AccessOmniPlan: An Adaptive Framework for Timely and Near-Optimal Network Planning Optimization
\noindent Network planning optimization is a fundamental problem across diverse domains, including transportation systems, communication networks, and power grids. It requires simultaneous optimization of multiple competing objectives under complex constraints. Existing network planning optimization frameworks rely on mixed integer programming (MIP) solvers, heuristics, and deep reinforcement learning (DRL) models to compute planning decisions. However, they lack effective adaptability to diverse and dynamic user intents, thus leading to the trade-off between execution time and optimality. In this paper, we propose OmniPlan, an adaptive framework that achieves both timeliness and near-optimality in network planning optimization. To achieve the adaptability lacking in existing solutions, OmniPlan employs a large language model (LLM)-based interpreter to convert heterogeneous natural-language intents into a unified and quantifiable user-preference vector. Then it employs a mixture-of-experts architecture that integrates MIP solvers, heuristics, and DRL models as specialized experts, where OmniPlan adapts to diverse intents by dynamically selecting timely and near-optimal experts. Finally, it incorporates a DRL-based expert configuration module that fine-tunes optimization objective weights to align planning decisions with user-specific preferences. We evaluate OmniPlan with a representative real-world workload, i.e., distributed machine learning (ML), where we leverage OmniPlan to offload a wide spectrum of ML inference tasks, e.g., decision trees, SVM, naive Bayes, XGBoost, and random forests, onto a network of hardware devices. Our experiments on a real-world testbed indicate that OmniPlan achieves near-optimal and low-execution-time offloading for real-world ML inference tasks, reducing latency by up to 97.8% and network device resource consumption by up to 11.5%.
- Open Access
- 5 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 194-201
Turbolearn: Harnessing Accurate and Line-Rate Deep Learning on Programmable Switches
- 5 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 194-201
Open AccessTurbolearn: Harnessing Accurate and Line-Rate Deep Learning on Programmable Switches
- Open Access
- 5 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 289-290
TurboLearn: Harnessing Accurate and Line-Rate Deep Learning on Programmable Switches
- 5 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 289-290
Open AccessTurboLearn: Harnessing Accurate and Line-Rate Deep Learning on Programmable Switches
- Open Access
- 11 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 122-124
Poster: Countach: Harnessing the Timeliness-Accuracy Tradeoff in Network-Wide Volumetric Attack Detection
- 11 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 122-124
Open AccessPoster: Countach: Harnessing the Timeliness-Accuracy Tradeoff in Network-Wide Volumetric Attack Detection