Wenpeng Lu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Wenpeng Lu has a total of 223 co-authors. Here are the top co-authors by number of shared publications:
- Shoujin Wang
University of Technology Sydney, Sydney, Australia
18 shared publications - Xueping Peng
Australian Artificial Intelligence Institute, University of Technology Sydney, Sydney, NSW, Australia
13 shared publications - Weiyu Zhang
Key Laboratory of Computing Power Network and Information Security, Ministry of Education, Shandong Computer Science Center (National Supercomputer Center in Jinan), Qilu University of Technology (Shandong Academy of Sciences), Jinan, China
11 shared publications - Chaoqun Zheng
Key Laboratory of Computing Power Network and Information Security, Ministry of Education, Shandong Computer Science Center (National Supercomputer Center in Jinan), Qilu University of Technology (Shandong Academy of Sciences), Jinan, China
7 shared publications - Jiasheng Si
Key Laboratory of Computing Power Network and Information Security, Ministry of Education, Shandong Computer Science Center (National Supercomputer Center in Jinan), Qilu University of Technology (Shandong Academy of Sciences), Jinan, Shandong, China and Shandong Provincial Key Laboratory of Computing Power Internet and Service Computing, Shandong Fundamental Research Center for Computer Science, Jinan, China
5 shared publications - Liang Hu
Department of Computer Science and Technology, Tongji University, China
5 shared publications
Latest Publications
- Open Access
- 24 October 2026
- Published by Springer Nature in BMC Medical Imaging
Quantified enhancement volume based on MRI as a prognostic biomarker for early recurrence in hepatocellular carcinoma
- 24 October 2026
- Published by Springer Nature in BMC Medical Imaging
Open AccessQuantified enhancement volume based on MRI as a prognostic biomarker for early recurrence in hepatocellular carcinoma
- Open Access
- 19 October 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Multimedia Computing, Communications, and Applications
SSMH: Semantic Self-refinement Multi-modal Hashing for Multi-modal Retrieval
Multi-modal hashing converts high-dimensional features into compact binary codes while preserving semantic similarity, thereby achieving high performance with lower storage and computational costs. However, existing methods generally overly depend on discrete supervisory information, ignoring the ambiguity of labels and intra-class diversity. To address these challenges, we propose a novel S emantic S elf-refinement M ulti-modal H ashing (SSMH), which adaptively learns stable semantic representations through a unified end-to-end semantic learning. First, we dynamically integrate inter- and intra- modal correlations to achieve semantically consistent multi-modal integrated representation. Then, we generate prototype-guided binary codes to explicitly align multi-modal representations with label semantics, thereby strengthening supervision and mitigating the effect of ambiguous labels. Extensive experiments show SSMH outperforms state-of-the-art methods in multi-modal retrieval. The source code can be found at https://github.com/vindahi/SSMH.
- 19 October 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Multimedia Computing, Communications, and Applications
Open AccessSSMH: Semantic Self-refinement Multi-modal Hashing for Multi-modal Retrieval
Multi-modal hashing converts high-dimensional features into compact binary codes while preserving semantic similarity, thereby achieving high performance with lower storage and computational costs. However, existing methods generally overly depend on discrete supervisory information, ignoring the ambiguity of labels and intra-class diversity. To address these challenges, we propose a novel S emantic S elf-refinement M ulti-modal H ashing (SSMH), which adaptively learns stable semantic representations through a unified end-to-end semantic learning. First, we dynamically integrate inter- and intra- modal correlations to achieve semantically consistent multi-modal integrated representation. Then, we generate prototype-guided binary codes to explicitly align multi-modal representations with label semantics, thereby strengthening supervision and mitigating the effect of ambiguous labels. Extensive experiments show SSMH outperforms state-of-the-art methods in multi-modal retrieval. The source code can be found at https://github.com/vindahi/SSMH.
- Open Access
- 6 October 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Knowledge Discovery From Data
Eval4DiRec: A Unified and Systematic Evaluation Framework for Diffusion-based Recommender Systems
Leveraging the strong generative capabilities and stable training dynamics of diffusion models, diffusion-based recommender systems (RSs) have recently emerged as a novel recommendation paradigm, attracting increasing attention from both academia and industry. However, despite the rapid growth of diffusion-based RSs, a critical issue has emerged: the lack of a unified and systematic quantitative evaluation benchmark, which often results in irreproducible experimental results and unfair comparisons across studies due to inconsistent data processing, training configurations, inference procedures, and evaluation protocols. To address this challenge, we propose Eval4DiRec, the first unified and open-source evaluation framework specifically designed for diffusion-based RSs. Eval4DiRec supports 14 representative diffusion-based RS models across five different recommendation scenarios, providing consistent and reproducible experimental settings to systematically assess their performance. Built upon this framework, we conduct extensive empirical studies to benchmark these models under unified protocols. The results highlight the strong potential of diffusion models for recommendation while also revealing key factors and practical challenges that substantially affect their performance, thereby establishing a solid foundation to facilitate fair evaluation and guide future research in this promising field. Our code and data are available at: https://github.com/wangcong2001/Eval4DiRec.
- 6 October 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Knowledge Discovery From Data
Open AccessEval4DiRec: A Unified and Systematic Evaluation Framework for Diffusion-based Recommender Systems
Leveraging the strong generative capabilities and stable training dynamics of diffusion models, diffusion-based recommender systems (RSs) have recently emerged as a novel recommendation paradigm, attracting increasing attention from both academia and industry. However, despite the rapid growth of diffusion-based RSs, a critical issue has emerged: the lack of a unified and systematic quantitative evaluation benchmark, which often results in irreproducible experimental results and unfair comparisons across studies due to inconsistent data processing, training configurations, inference procedures, and evaluation protocols. To address this challenge, we propose Eval4DiRec, the first unified and open-source evaluation framework specifically designed for diffusion-based RSs. Eval4DiRec supports 14 representative diffusion-based RS models across five different recommendation scenarios, providing consistent and reproducible experimental settings to systematically assess their performance. Built upon this framework, we conduct extensive empirical studies to benchmark these models under unified protocols. The results highlight the strong potential of diffusion models for recommendation while also revealing key factors and practical challenges that substantially affect their performance, thereby establishing a solid foundation to facilitate fair evaluation and guide future research in this promising field. Our code and data are available at: https://github.com/wangcong2001/Eval4DiRec.
- Open Access
- 4 October 2026
- Published by Association for Computing Machinery (ACM)
- p. 525-535
Distilling the Noise: Value-Aware Contrastive Hypergraph Learning for Robust Multimodal Rumor Detection
- 4 October 2026
- Published by Association for Computing Machinery (ACM)
- p. 525-535
Open AccessDistilling the Noise: Value-Aware Contrastive Hypergraph Learning for Robust Multimodal Rumor Detection
- Open Access
- 17 September 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Information Systems
Disease Spectrum-aware and Time-evolving Dependency Learning for Medication Recommendation
Medication recommendation is a core component of clinical decision support, aiming to tailor effective drug combinations for patients based on longitudinal Electronic Health Records (EHRs). Despite the success of deep learning in this domain, existing methods typically suffer from two fundamental limitations: (1) they treat diagnosis codes as orthogonal labels, thereby fragmenting shared pharmacological treatment patterns among related diagnoses within latent therapeutic disease spectra, and (2) they infer disease evolution solely based on a coarse-grained holistic hidden state, thereby obscuring the fine-grained temporal dependencies across visit sequences. To address these gaps, we propose SpecTD-MR, a novel medication recommendation framework for Disease Spectrum-aware and Time-evolving Dependency Learning. Specifically, we design a Disease Spectrum-aware Hypergraph Learning module that constructs a hypergraph initialized with multi-source clinical knowledge. By employing task-guided clustering with contrastive alignment, this module unifies disparate diagnoses into cohesive, spectrum-aware representations. Furthermore, we introduce a Time-evolving Dependency Modeling module that explicitly quantifies the dependency strength of current diseases on historical contexts. By incorporating a Mixture-of-Experts (MoE) mechanism, this module synergizes disease spectrum with time-evolving dependency to adaptively regulate patient health state transitions. Extensive experiments on real-world datasets demonstrate that SpecTD-MR surpasses state-of-the-art baselines in accuracy, while providing visualizable structural associations to support insights into dynamic disease evolution. 1
- 17 September 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Information Systems
Open AccessDisease Spectrum-aware and Time-evolving Dependency Learning for Medication Recommendation
Medication recommendation is a core component of clinical decision support, aiming to tailor effective drug combinations for patients based on longitudinal Electronic Health Records (EHRs). Despite the success of deep learning in this domain, existing methods typically suffer from two fundamental limitations: (1) they treat diagnosis codes as orthogonal labels, thereby fragmenting shared pharmacological treatment patterns among related diagnoses within latent therapeutic disease spectra, and (2) they infer disease evolution solely based on a coarse-grained holistic hidden state, thereby obscuring the fine-grained temporal dependencies across visit sequences. To address these gaps, we propose SpecTD-MR, a novel medication recommendation framework for Disease Spectrum-aware and Time-evolving Dependency Learning. Specifically, we design a Disease Spectrum-aware Hypergraph Learning module that constructs a hypergraph initialized with multi-source clinical knowledge. By employing task-guided clustering with contrastive alignment, this module unifies disparate diagnoses into cohesive, spectrum-aware representations. Furthermore, we introduce a Time-evolving Dependency Modeling module that explicitly quantifies the dependency strength of current diseases on historical contexts. By incorporating a Mixture-of-Experts (MoE) mechanism, this module synergizes disease spectrum with time-evolving dependency to adaptively regulate patient health state transitions. Extensive experiments on real-world datasets demonstrate that SpecTD-MR surpasses state-of-the-art baselines in accuracy, while providing visualizable structural associations to support insights into dynamic disease evolution. 1
- 4 September 2026
- Published by Elsevier in Expert Systems with Applications
- Vol. 333
WindowKV: Task-adaptive group-wise KV cache window selection for efficient LLM inference
- 4 September 2026
- Published by Elsevier in Expert Systems with Applications
- Vol. 333
WindowKV: Task-adaptive group-wise KV cache window selection for efficient LLM inference
- Open Access
- 19 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1834-1845
RES-MR: Risk-Aware Reasoning for Explainable and Safe Medication Recommendation
Medication recommendations seek to deliver personalized drug combinations based on patients' clinical information, where ensuring transparent decision-making and personalized safety are of paramount importance. However, existing approaches predominantly operate as ''black boxes'', offering limited interpretability and hindering clinician trust. Furthermore, they typically rely on fixed, patient-agnostic safety constraints, neglecting the heterogeneity of risk tolerance across individuals, which poses significant risks to vulnerable populations. To address these gaps, we propose RES-MR, a novel Risk-aware Reasoning framework for Explainable and Safe Medication Recommendation using LLMs. RES-MR follows a two-stage training paradigm: (1) an explainable clinical reasoning distillation stage to elicit diagnostic capabilities by fine-tuning on synthesized reasoning trajectories, grounded in patient-specific knowledge from graph retrieval; and (2) a risk-aware policy optimization stage to dynamically balance therapeutic efficacy with personalized safety. This stage employs disentangled drug factors to construct patient-specific reference prototypes that capture desired therapeutic drug features and risk features to avoid. These prototypes enable risk boundary calibration and guide the model toward safe recommendations via reward shaping and clipping. Extensive experiments on benchmark datasets demonstrate that RES-MR significantly outperforms state-of-the-art baselines in terms of accuracy, safety, and explainability. Our code and data are available at: https://github.com/wangcong2001/RES-MR.
- 19 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1834-1845
Open AccessRES-MR: Risk-Aware Reasoning for Explainable and Safe Medication Recommendation
Medication recommendations seek to deliver personalized drug combinations based on patients' clinical information, where ensuring transparent decision-making and personalized safety are of paramount importance. However, existing approaches predominantly operate as ''black boxes'', offering limited interpretability and hindering clinician trust. Furthermore, they typically rely on fixed, patient-agnostic safety constraints, neglecting the heterogeneity of risk tolerance across individuals, which poses significant risks to vulnerable populations. To address these gaps, we propose RES-MR, a novel Risk-aware Reasoning framework for Explainable and Safe Medication Recommendation using LLMs. RES-MR follows a two-stage training paradigm: (1) an explainable clinical reasoning distillation stage to elicit diagnostic capabilities by fine-tuning on synthesized reasoning trajectories, grounded in patient-specific knowledge from graph retrieval; and (2) a risk-aware policy optimization stage to dynamically balance therapeutic efficacy with personalized safety. This stage employs disentangled drug factors to construct patient-specific reference prototypes that capture desired therapeutic drug features and risk features to avoid. These prototypes enable risk boundary calibration and guide the model toward safe recommendations via reward shaping and clipping. Extensive experiments on benchmark datasets demonstrate that RES-MR significantly outperforms state-of-the-art baselines in terms of accuracy, safety, and explainability. Our code and data are available at: https://github.com/wangcong2001/RES-MR.
- Open Access
- 19 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 568-578
Depression Detection from Social Media: A Mutual Guidance Multi-modal Network with Complementary Graph Learning
- 19 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 568-578
Open AccessDepression Detection from Social Media: A Mutual Guidance Multi-modal Network with Complementary Graph Learning
- 29 April 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Audio, Speech and Language Processing
- Vol. 34, 2539-2551
Enhancing Multimodal Reasoning via Visual Semantic Summarization
Recent advances in multimodal large models (MLMs) have enabled promising progress in multimodal reasoning. However, due to multimodal misalignment and language-dominant representations, MLMs often compress or lose fine-grained visual semantics. As a result, they struggle to (1) reliably perceive task-relevant visual details and (2) effectively leverage parametric knowledge conditioned on visual evidence. These limitations ultimately lead to unreliable reasoning outcomes. To address these limitations, we introduce a simple yet effective framework built upon visual semantic summarization. Our framework iteratively optimizes two complementary stages: one for generating high-quality visual semantic summaries containing reasoning-critical visual semantics, and another for strengthening the MLM's ability to utilize such summaries during multimodal inference. Acting as compact visual auxiliaries, the summaries guide attention toward fine-grained clues and facilitate knowledge retrieval from internal parameters. Extensive experiments on six multimodal reasoning benchmarks spanning three tasks (VQA, MABSA, and HMD) show that our framework consistently outperforms existing MLMs-based methods.
- 29 April 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Audio, Speech and Language Processing
- Vol. 34, 2539-2551
Enhancing Multimodal Reasoning via Visual Semantic Summarization
Recent advances in multimodal large models (MLMs) have enabled promising progress in multimodal reasoning. However, due to multimodal misalignment and language-dominant representations, MLMs often compress or lose fine-grained visual semantics. As a result, they struggle to (1) reliably perceive task-relevant visual details and (2) effectively leverage parametric knowledge conditioned on visual evidence. These limitations ultimately lead to unreliable reasoning outcomes. To address these limitations, we introduce a simple yet effective framework built upon visual semantic summarization. Our framework iteratively optimizes two complementary stages: one for generating high-quality visual semantic summaries containing reasoning-critical visual semantics, and another for strengthening the MLM's ability to utilize such summaries during multimodal inference. Acting as compact visual auxiliaries, the summaries guide attention toward fine-grained clues and facilitate knowledge retrieval from internal parameters. Extensive experiments on six multimodal reasoning benchmarks spanning three tasks (VQA, MABSA, and HMD) show that our framework consistently outperforms existing MLMs-based methods.