VLDB 2026 Research / reviewers in the wild / expert
Kaize Shi
dblp:233/6951
· DBLP profile ↗
12ranked-venue papers in the field
1as first author
12since 2021 · last 2026
0000-0003-3561-3627ORCID · verified
Domains — venue-derived; a paper can count in several
Information Retrieval & Web Search · 7 (1 first)Database Systems & Data Management · 3Data Mining & Knowledge Discovery · 2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Chunk-Wise Quantization for Graph Collaborative FilteringabstractEnergy efficiency has become a critical requirement, driving recommendation systems for resource-constrained environments such as edge devices. Model quantization offers an effective way to build low-bitwidth models while preserving accuracy. However, user–item interaction graphs contain numerous nodes and complex topological structures, leading nodes to exhibit unique similarities and differences. Existing quantization methods uniformly process parameters in high-dimensional DNN layers (e.g., linear, convolutional, or attention layers), while inadequately capturing such similarities among node embeddings. This paper proposes GraphQ, a chunk-wise quantization framework for graph collaborative filtering that supports both the training and post-training phases in a unified perspective. Our core idea is to adaptively partition node embeddings into multiple chunks based on the distribution of embedding values, and then apply chunk-wise quantization. Specifically, for quantization-aware training (QAT), we introduce learnable low-precision quantization factors that partition node embeddings into multiple chunks and are dynamically updated following message passing. For post-training quantization (PTQ), we first cluster nodes and then partition their dimensions into chunks for weight clipping. Extensive experiments on four real-world datasets show that GraphQ outperforms state-of-the-art QAT methods by an average of 27.49% in Recall@10 under the 256-dimensional embedding and 2-bit settings, and surpasses PTQ methods by 78.64% on average under 4-bit settings. Kaixi Hu, Peipei Wang 0001, Kaize Shi, Jingling Yuan, Yu Yang 0012, Guandong Xu, Lin Li 0001 |
SIGIR | 3 |
| 2026 | Belief-Driven Multi-Agent Collaboration via Approximate Perfect Bayesian Equilibrium for Social Simulation
Weiwei Fang, Lin Li 0001, Kaize Shi, Yu Yang 0012, Jianwei Zhang 0002 |
WWW | 3 |
| 2026 | Hyena Operator for Fast Sequential RecommendationabstractSequential recommendation models, particularly those based on attention, achieve strong accuracy but incur quadratic complexity, making long user histories prohibitively expensive. Sub-quadratic operators such as Hyena provide efficient alternatives in language modeling, but their potential in recommendation remains underexplored. We argue that Hyena faces challenges in recommendation due to limited representation capacity on sparse, long user sequences. To address these challenges, we propose HyenaRec, a novel sequential recommender that integrates polynomial-based kernel parameterization with gated convolutions. Specifically, we design convolutional kernels using Legendre orthogonal polynomials, which provides a smooth and compact basis for modeling long-term temporal dependencies. A complementary gating mechanism captures fine-grained short-term behavioral bursts, yielding a hybrid architecture that balances global temporal evolution with localized user interests under sparse feedback. This construction enhances expressiveness while scaling linearly with sequence length. Extensive experiments on multiple real-world datasets demonstrate that HyenaRec consistently outperforms Attention-, Recurrent-, and other baselines in ranking accuracy. Moreover, it trains significantly faster (up to 6× speedup), with particularly pronounced advantages on long-sequence scenarios where efficiency is maintained without sacrificing accuracy. These results highlight polynomial-based kernel parameterization as a principled and scalable alternative to attention for sequential recommendation. Lin Li 0001, Kaixi Hu, Kaize Shi, Jingling Yuan |
WWW | 5 |
| 2026 | Concept Relationship Embedding-Based Interactive Web Application for Explainable Medical DiagnosisabstractDeep learning has made remarkable progress in medical image analysis, yet its black-box nature still limits interpretability and clinician trust. Concept-based modeling offers a promising direction for explainable AI by integrating human-understandable concepts. However, existing approaches typically rely on global concept annotations and infer diagnosis based solely on the presence or absence of individual concepts. This oversimplified paradigm ignores the rich relationships among concepts and their causal influence on disease outcomes. To overcome these limitations, we propose the Concept Relationship Embedding Model (CREM) for interpretable medical diagnosis. CREM mirrors coarse-to-fine clinical reasoning by first extracting fine-grained subregional concepts, then explicitly encoding their relationships as a concept interaction graph, and finally performing causal inference between concepts and diagnoses to enable reliable and transparent diagnostic predictions. We evaluate CREM on four public medical imaging benchmarks, where it achieves state-of-the-art performance on both concept recognition and disease classification tasks, while exhibiting improved robustness, label efficiency, and interpretability. Furthermore, we deploy CREM as an interactive web-based demo that allows clinicians to visualize concept activations, trace diagnostic reasoning paths, and iteratively refine concept cues, facilitating effective human-in-the-loop decision-making. Lei Zhao 0013, Xingguo Lv, Qika Lin, Kaize Shi, Xiaoming Qi, Bin Pu, Kenli Li 0001 |
WWW | 4 |
| 2025 | Expert-Guided Toxicity Filtration for Debiased Generation
Xueyao Sun, Kaize Shi, Guandong Xu, Qing Li 0001 |
PAKDD (4) | 2 |
| 2025 | Educating Language Models as Promoters: Multi-Aspect Instruction Alignment With Self-AugmentationabstractE-commerce content generation necessitates creating engaging and customer-centric material to endorse products and enhance user satisfaction. Existing methods depend on task-specific feature design, which requires a fine-tailored model for each task with complex data collection and pre-processing, and their generation capabilities are limited. Meanwhile, large language models have demonstrated their capabilities in diverse natural language processing tasks, solving multiple tasks in a unified process. To address the concerns in e-commerce content generation, we leverage the impressive generation performance of large language models and propose a framework to educate them as proficient promoters in various e-commerce-related tasks. Our framework involves two modules:self-educatingproliferates task instructions and data by instructing the unaligned model, andmulti-aspect instruction alignmenteducates the language model by embedding all e-commerce tasks in a unified framework. The proposed model, Promoter, can perform a batch of prediction and generation tasks, working as a smart and creative promoter that only requires a quick view of the customer profile. Extensive experiments from automatic and human perspectives indicate that Promoter achieves state-of-the-art performances in various generation tasks, bringing the productivity of large language models to e-commerce in an integrated pipeline. Xueyao Sun, Kaize Shi, Dingxian Wang, Guandong Xu, Qing Li 0001 |
IEEE Trans. Knowl. Data Eng. | 2 |
| 2024 | Recommending Learning Objects through Attentive Heterogeneous Graph Convolution and Operation- Aware Neural Network (Extended Abstract)abstractCurrently, the increasing information overload on Massive Open Online Courses(MOOCs) inhibits the appropriate choice of learning objects by learners, leading to low efficiency and high dropout rates. However, in MOOC platforms, recommendation network structures that can selectively extract implicit features such as heterogeneous learning preference and knowledge organization of learning objects are still not comprehensively studied. To this end, we propose a learning object recommendation model namely ACGCN based on heterogeneous learning behavior and knowledge graph. By introducing an attention mechanism, information is amplified when updating the representation of the heterogeneous graph, which eliminates the impact of noise and improves the robustness of ACGCN. Experimental results using a real-world dataset revealed that our proposed model has the best performance compared to those of several existing baselines. Yifan Zhu 0001, Qika Lin, Hao Lu 0002, Kaize Shi, Donglei Liu, James Chambua, Shanshan Wan, Zhendong Niu |
ICDE | 4 |
| 2024 | Homogeneous-listing-augmented Self-supervised Multimodal Product Title RefinementabstractProduct titles on e-commerce marketplaces often suffer from verbosity and inaccuracy, hindering effective communication of essential product details to customers. Refining titles to be more concise and informative is crucial for better user experience and product promotion. Recent solutions to product title refinement follow the standard text extractive and generative methods. Some also leverage multimodal information, e.g. using product images to supplement original titles with visual knowledge. However, these generative methods often produce additional terms not endorsed by sellers. Thus, it remains challenging to incorporate visual information missing from original titles into refined titles without excessively introducing novel terms. Additionally, most existing methods require human-labeled datasets, which are laborious to construct. In response to the two challenges, we present a self-supervised multimodal framework (HLATR) for title refinement that comprises two key modules: (1) a perturbated sample generator that constructs training data by systematically mining homogeneous listing information and (2) a title refinement network that effectively harnesses visual information to refine the original titles. To explicitly balance the extraction from original titles and the generation of supplementary novel terms, we adapt the copy mechanism that is guided by a focused refinement loss. Extensive experiments demonstrate that our proposed framework consistently outperforms others in generating refined titles that contain essential multimodal semantics with minimal deviation from the original ones. Jiaqi Deng 0001, Kaize Shi, Huan Huo, Dingxian Wang, Guandong Xu |
SIGIR | 2 |
| 2024 | Deep Coupling Network for Multivariate Time Series ForecastingabstractMultivariate time series (MTS) forecasting is crucial in many real-world applications. To achieve accurate MTS forecasting, it is essential to simultaneously consider both intra- and inter-series relationships among time series data. However, previous work has typically modeled intra- and inter-series relationships separately and has disregarded multi-order interactions present within and between time series data, which can seriously degrade forecasting accuracy. In this article, we reexamine intra- and inter-series relationships from the perspective of mutual information and accordingly construct a comprehensive relationship learning mechanism tailored to simultaneously capture the intricate multi-order intra- and inter-series couplings. Based on the mechanism, we propose a novel deep coupling network for MTS forecasting, named DeepCN, which consists of a coupling mechanism dedicated to explicitly exploring the multi-order intra- and inter-series relationships among time series data concurrently, a coupled variable representation module aimed at encoding diverse variable patterns, and an inference module facilitating predictions through one forward step. Extensive experiments conducted on seven real-world datasets demonstrate that our proposed DeepCN achieves superior performance compared with the state-of-the-art baselines. Kun Yi 0001, Qi Zhang 0020, Kaize Shi, Liang Hu 0004, Ning An 0001, Zhendong Niu |
ACM Trans. Inf. Syst. | 4 |
| 2023 | MTSTI: A Multi-task Learning Framework for Spatiotemporal Imputation
Yakun Chen, Kaize Shi, Xianzhi Wang 0001, Guandong Xu |
ADMA (5) | 2 |
| 2023 | Recommending Learning Objects Through Attentive Heterogeneous Graph Convolution and Operation-Aware Neural NetworkabstractMassive Open Online Courses (MOOCs) have received unprecedented attention, in which learners can obtain a large number of learning objects anytime and anywhere. However, the increasing information overload on MOOCs inhibits the appropriate choice of learning objects by learners, leading to a low efficiency and high dropout rates in the learning process of this human-computer interaction scenario. E-learning recommendation systems have been studied to present learning objects directly to learners, thereby relieving such problem. However, in MOOC platforms, recommendation network structures which can selectively extract implicit feature such as heterogeneous learning preference and knowledge organization of learning objects are still not comprehensively studied. To this end, we propose a learning object recommendation model based on heterogeneous learning behavior and knowledge graph. To generate a unified representation of each entity and relation, we first propose an Attentive Composition based Graph Convolutional Network (ACGCN). By introducing an attention mechanism, information is amplified when updating the representation of the heterogeneous graph, which eliminates the impact of noise and improves the robustness of the model. Then, a Dense Feature based Operation-Aware Network (DFOAN) is utilized to capture implicit and complex learners’ interactive behaviors, and to further provide a recommendation. Experimental results using two real-world datasets revealed that our proposed model has the best precision, recall, F1, and accuracy scores compared to those of several existing models. Yifan Zhu 0001, Qika Lin, Hao Lu 0002, Kaize Shi, Donglei Liu, James Chambua, Shanshan Wan, Zhendong Niu |
IEEE Trans. Knowl. Data Eng. | 4 |
| 2021 | EKGTF: A knowledge-enhanced model for optimizing social network-based meteorological briefings
Kaize Shi, Hao Lu 0002, Yifan Zhu 0001, Zhendong Niu |
Inf. Process. Manag. | 1 |