Wei Pang 0001

dblp:21/2823-1 · DBLP profile ↗
← Back
14ranked-venue papers in the field
0as first author
6since 2021 · last 2026
0000-0002-1761-6659ORCID · conflict

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

Data Mining & Knowledge Discovery · 8Knowledge Engineering, Semantic Web & Information Systems · 4Information Retrieval & Web Search · 1Big Data, Cloud & Distributed Data Systems · 1
YearPublicationVenuePosition
2026 XR: Cross-Modal Agents for Composed Image Retrieval
abstract
Retrieval is being redefined by agentic AI, demanding multimodal reasoning beyond conventional similarity-based paradigms. Composed Image Retrieval (CIR) exemplifies this shift as each query combines a reference image with textual modifications, requiring compositional understanding across modalities. While embedding-based CIR methods have achieved progress, they remain narrow in perspective, capturing limited cross-modal cues and lacking semantic reasoning. To address these limitations, we introduce XR, a training-free multi-agent framework that reframes retrieval as a progressively coordinated reasoning process. It orchestrates three specialized types of agents: imagination agents synthesize target representations through cross-modal generation, similarity agents perform coarse filtering via hybrid matching, and question agents verify factual consistency through targeted reasoning for fine filtering. Through progressive multi-agent coordination, XR iteratively refines retrieval to meet both semantic and visual query constraints, achieving up to a 38% gain over strong training-free and training-based baselines on FashionIQ, CIRR, and CIRCO, while ablations show each agent is essential. Code is available: https://01yzzyu.github.io/xr.github.io/.
Zhongyu Yang, Wei Pang 0001, Yingfang Yuan
WWW2
2025 IO-K-Means: Iterative Optimization for Centroids in K-Means
Shuntai Zhang, Tao Zhang 0015, Yishu Zhao, Wei Pang 0001, Yizhang Wang
ADMA (4)6
2025 An Efficient Diffusion-based Non-Autoregressive Solver for Traveling Salesman Problem
abstract
Recent advances in neural models have shown considerable promise in solving Traveling Salesman Problems (TSPs) without relying on much hand-crafted engineering. However, while non-autoregressive (NAR) approaches benefit from faster inference through parallelism, they typically deliver solutions of inferior quality compared to autoregressive ones. To enhance the solution quality while maintaining fast inference, we propose DEITSP, a diffusion model with efficient iterations tailored for TSP that operates in a NAR manner. Firstly, we introduce a one-step diffusion model that integrates the controlled discrete noise addition process with self-consistency enhancement, enabling optimal solution prediction through simultaneous denoising of multiple solutions. Secondly, we design a dual-modality graph transformer to bolster the extraction and fusion of features from node and edge modalities, while further accelerating the inference with fewer layers. Thirdly, we develop an efficient iterative strategy that alternates between adding and removing noise to improve exploration compared to previous diffusion methods. Additionally, we devise a scheduling framework to progressively refine the solution space by adjusting noise levels, facilitating a smooth search for optimal solutions. Extensive experiments on real-world and large-scale TSP instances demonstrate that DEITSP performs favorably against existing neural approaches in terms of solution quality, inference latency, and generalization ability.
Mingzhao Wang, You Zhou 0008, Zhiguang Cao, Yubin Xiao, Xuan Wu 0004, Wei Pang 0001, Yuan Jiang 0007, Hui Yang 0015, Peng Zhao 0018, Yuanshu Li
KDD (1)6
2023 U-DARTS: Uniform-space differentiable architecture search
Lan Huang 0002, Wencong Wang, Wei Pang 0001, Kangping Wang
Inf. Sci.5
2022 Restorable-inpainting: A novel deep learning approach for shoeprint restoration
Yan Wang 0028, Di Wang 0004, Wei Pang 0001, Kangping Wang, Daixi Li, You Zhou 0008, Dong Xu 0002
Inf. Sci.4
2022 Multiscale increment entropy: An approach for quantifying the physiological complexity of biomedical time series
Xiaofeng Liu 0006, Wei Pang 0001, Aimin Jiang
Inf. Sci.3
2020 A Multi-Modal Deep Learning Approach to the Early Prediction of Mild Cognitive Impairment Conversion to Alzheimer's Disease
abstract
Mild cognitive impairment (MCI) has been described as the intermediary stage before Alzheimer's Disease - many people however remain stable or even demonstrate improvement in cognition. Early detection of progressive MCI (pMCI) therefore can be utilised in identifying at-risk individuals and directing additional medical treatment in order to revert conversion to AD as well as provide psychosocial support for the person and their family. This paper presents a novel solution in the early detection of pMCI people and classification of AD risk within MCI people. We proposed a model, MudNet, to utilise deep learning in the simultaneous prediction of progressive/stable MCI classes and time-to-AD conversion where high-risk pMCI people see conversion to AD within 24 months and low-risk people greater than 24 months. MudNet is trained and validated using baseline clinical and volumetric MRI data (n = 559 scans) from participants of the Alzheimer's Disease Neuroimaging Initiative (ADNI). The model utilises T1-weighted structural MRIs alongside clinical data which also contains neuropsychological (RAVLT, ADAS-11, ADAS-13, ADASQ4, MMSE) tests as inputs. The averaged results of our model indicate a binary accuracy of 69.8% for conversion predictions and a categorical accuracy of 66.9% for risk classifications.
Sijan S. Rana, Xinhui Ma, Wei Pang 0001, Emma Wolverson
BDCAT3
2018 ε-Distance Weighted Support Vector Regression
Ge Ou, Yan Wang 0028, Lan Huang 0002, Wei Pang 0001, George Macleod Coghill
PAKDD (1)4
2017 A Novel Diversity Measure for Understanding Movie Ranks in Movie Collaboration Networks
Manqing Ma, Wei Pang 0001, Lan Huang 0002, Zhe Wang 0007
PAKDD (1)2
2016 Partitioning Clustering Based on Support Vector Ranking
Qing Peng, Yan Wang 0028, Ge Ou, Yuan Tian 0016, Lan Huang 0002, Wei Pang 0001
ADMA6
2016 PUEPro: A Computational Pipeline for Prediction of Urine Excretory Proteins
Yan Wang 0028, Wei Du 0002, Yanchun Liang 0001, Xin Chen 0113, Chi Zhang 0021, Wei Pang 0001, Ying Xu 0001
ADMA6
2015 Automatically Predicting Quiz Difficulty Level Using Similarity Measures
abstract
In this paper, we present a semi-automatic system (Sherlock) for quiz generation using Linked Data and textual descriptions of RDF resources. Sherlock is distinguished from existing quiz generation systems in its ability to control the difficulty level of the generated quizzes. We cast the problem of perceiving the level of knowledge difficulty as a similarity measure problem and propose a novel hybrid semantic similarity measure using linked data. Extensive experiments show that the proposed similarity measure outperforms four strong baselines in both the pilot evaluation using a synthetic gold standard as well as with human evaluation, giving more than 47% gain in clustering accuracy over the baselines.
Chenghua Lin 0002, Wei Pang 0001, Edward Apeh
K-CAP3
2014 Hete-CF: Social-Based Collaborative Filtering Recommendation Using Heterogeneous Relations
abstract
In this paper, we investigate the social-based recommendation algorithms on heterogeneous social networks and proposed Hete-CF, a social collaborative filtering algorithm using heterogeneous relations. Distinct from the exiting methods, Hete-CF can effectively utilise multiple types of relations in a heterogeneous social network. More importantly, Hete-CF is a general approach and can be used in arbitrary social networks, including event based social networks, location based social networks, and any other types of heterogeneous information networks associated with social information. The experimental results on a real-world dataset DBLP (a typical heterogeneous information network)demonstrate the effectiveness of our algorithm.
Wei Pang 0001, Zhe Wang 0007, Chenghua Lin 0002
ICDM2
2014 Semi-supervised Clustering on Heterogeneous Information Networks
Wei Pang 0001, Zhe Wang 0007
PAKDD (2)2