EDBT 2026 Demo / reviewers in the wild / expert
Chunjing Gan
dblp:245/3654
· DBLP profile ↗
7ranked-venue papers
4as first author
4since 2021 · last 2025
0009-0006-7926-6320ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 4 · 3 first-author · 4 since 2021Artificial intelligence and machine learning · 3 · 1 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2Systems, architecture and hardware · 1 · 1 first-author
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Effectively PAIRing LLMs with Online Marketing via Progressive Prompting AugmentationabstractIn this paper, we seek to carefully prompt a Large Language Model (LLM) with domain-level knowledge as a better marketing-oriented knowledge miner for marketing-oriented knowledge graph construction, which is non-trivial, suffering from several inevitable issues in real-world marketing scenarios, i.e., uncontrollable relation generation of LLMs, insufficient prompting ability of a single prompt, unaffordable deployment cost of LLMs. To this end, we propose PAIR, a novel Progressive prompting Augmented mIning fRamework for harvesting marketing-oriented knowledge graph with LLMs. In particular, we reduce the pure relation generation to an LLM-based adaptive relation filtering process through knowledge-empowered prompting technique. Next, we steer LLMs for entity expansion with progressive prompting augmentation, followed by a reliable aggregation with comprehensive consideration of both self-consistency and semantic relatedness. In terms of online serving, we specialize in a small and white-box PAIR (i.e., LightPAIR), which is fine-tuned with a high-quality corpus provided by a strong teacher-LLM. Extensive experiments and practical applications in audience targeting verify the effectiveness of the proposed (Light)PAIR. Chunjing Gan, Dan Yang 0004, Binbin Hu, Zhiqiang Zhang 0012, Jinjie Gu, Jun Zhou 0011 |
ICDE | 1 |
| 2024 | ReLand: Integrating Large Language Models' Insights into Industrial Recommenders via a Controllable Reasoning PoolabstractRecently, Large Language Models (LLMs) have shown significant potential in addressing the isolation issues faced by recommender systems. However, despite performance comparable to traditional recommenders, the current methods are cost-prohibitive for industrial applications. Consequently, existing LLM-based methods still need to catch up regarding effectiveness and efficiency. To tackle the above challenges, we present an LLM-enhanced recommendation framework named ReLand, which leverages Retrieval to effortlessly integrate Large language models’ insights into industrial recommenders. Specifically, ReLand employs LLMs to perform generative recommendations on sampled users (a.k.a., seed users), thereby constructing an LLM Reasoning Pool. Subsequently, we leverage retrieval to attach reliable recommendation rationales for the entire user base, ultimately effectively improving recommendation performance. Extensive offline and online experiments validate the effectiveness of ReLand. Since January 2024, ReLand has been deployed in the recommender system of Alipay, achieving statistically significant improvements of 3.19% in CTR and 1.08% in CVR. Changxin Tian, Binbin Hu, Chunjing Gan, Zhiqiang Zhang 0012, Jun Zhou 0011, Jiawei Chen 0007 |
RecSys | 3 |
| 2024 | PEACE: Prototype lEarning Augmented transferable framework for Cross-domain rEcommendationabstractTo help merchants/customers to provide/access a variety of services through miniapps, online service platforms have occupied a critical position in the effective content delivery, in which how to recommend items in the new domain launched by the service provider for customers has become more urgent. However, the non-negligible gap between the source and diversified target domains poses a considerable challenge to cross-domain recommendation systems, which often leads to performance bottlenecks in industrial settings. While entity graphs have the potential to serve as a bridge between domains, rudimentary utilization still fail to distill useful knowledge and even induce the negative transfer issue. To this end, we propose PEACE, a Prototype lEarning Augmented transferable framework for Cross-domain rEcommendation. For domain gap bridging, PEACE is built upon a multi-interest and entity-oriented pre-training architecture which could not only benefit the learning of generalized knowledge in a multi-granularity manner, but also help leverage more structural information in the entity graph. Then, we bring the prototype learning into the pre-training over source domains, so that representations of users and items are greatly improved by the contrastive prototype learning module and the prototype enhanced attention mechanism for adaptive knowledge utilization. To ease the pressure of online serving, PEACE is deployed in a lightweight manner, and significant performance improvements are observed in both online and offline environments. Chunjing Gan, Binbin Hu, Zhiqiang Zhang 0012, Jun Zhou 0011, Leon Wenliang Zhong |
WSDM | 1 |
| 2023 | Which Matters Most in Making Fund Investment Decisions? A Multi-granularity Graph Disentangled Learning FrameworkabstractIn this paper, we highlight that both conformity and risk preference matter in making fund investment decisions beyond personal interest and seek to jointly characterize these aspects in a disentangled manner. Consequently, we develop a novel Multi-granularity Graph Disentangled Learning framework named MGDL to effectively perform intelligent matching of fund investment products. Benefiting from the well-established fund graph and the attention module, multi-granularity user representations are derived from historical behaviors to separately express personal interest, conformity and risk preference in a fine-grained way. To attain stronger disentangled representations with specific semantics, MGDL explicitly involve two self-supervised signals, ie fund type based contrasts and fund popularity. Extensive experiments in offline and online environments verify the effectiveness of MGDL. Chunjing Gan, Binbin Hu, Yingru Lin, Leon Wenliang Zhong, Zhiqiang Zhang 0012, Jun Zhou 0011, Chuan Shi 0001 |
SIGIR | 1 |
| 2020 | A Novel Model for Imbalanced Data ClassificationabstractRecently, imbalanced data classification has received much attention due to its wide applications. In the literature, existing researches have attempted to improve the classification performance by considering various factors such as the imbalanced distribution, cost-sensitive learning, data space improvement, and ensemble learning. Nevertheless, most of the existing methods focus on only part of these main aspects/factors. In this work, we propose a novel imbalanced data classification model that considers all these main aspects. To evaluate the performance of our proposed model, we have conducted experiments based on 14 public datasets. The results show that our model outperforms the state-of-the-art methods in terms of recall, G-mean, F-measure and AUC. Jian Yin 0001, Chunjing Gan, Kaiqi Zhao 0001, Xuan Lin, Zhe Quan, Zhi-Jie Wang 0009 |
AAAI | 2 |
| 2019 | An Improved Hierarchical Datastructure for Nearest Neighbor Search
Mengdie Nie, Zhi-Jie Wang 0009, Chunjing Gan, Zhe Quan, Bin Yao 0002, Jian Yin 0001 |
AAAI | 3 |
| 2019 | A Solution for High Availability Memory Access
Chunjing Gan, Bin Wang 0015, Zhi-Jie Wang 0009, Huazhong Liu, Dingyu Yang, Jian Yin 0001, Shiyou Qian, Song Guo 0001 |
ICA3PP (1) | 1 |