VLDB 2026 Research / reviewers in the wild / expert
Ke Wang 0038
dblp:181/2613-38
· DBLP profile ↗
9ranked-venue papers in the field
4as first author
9since 2021 · last 2025
0000-0002-8088-607XORCID · conflict
Domains — venue-derived; a paper can count in several
Information Retrieval & Web Search · 5 (2 first)Database Systems & Data Management · 2 (1 first)Data Mining & Knowledge Discovery · 2 (1 first)
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Enhancing Cross-Domain Recommendation with Plug-In Contrastive Representations from Large Language ModelsabstractCross-Domain Recommendation (CDR) leverages auxiliary information from extra domains to enhance performance by learning domain-invariant and domain-specific representations. However, existing methods primarily rely on ID information of users and items, resulting in the entanglement of these two representations and hindering effective knowledge transfer. Therefore, we present a novel plug-in contrastive learning for CDR (PicCDR), which utilizes textual semantics to disentangle and enhance domain-invariant and domain-specific representations via LLMs. First, PicCDR introduces the CoT prompting to generate and encode content-independent domain-invariant and domain-specific texts. Next, a contrastive domain-disentangled augmentation strategy is used to align domain-invariant and domain-specific representations in the semantic space with those of ID space via MI estimation. To further enhance representations, we present contrastive MI lower-bound and upper-bound approximations to optimize MI maximization and minimization terms. We also provide theoretical proof to reveal the superiority of our contrastive strategy. Lastly, we encapsulate PicCDR into a plug-and-play framework. This allows PicCDR to be plugged into any existing CDR model. Extensive experiments show the efficiency, robustness, and generalization of PicCDR. Ke Wang 0038 |
SIGIR | 1 |
| 2024 | Contrastive Self-supervised Learning in Recommender Systems: A SurveyabstractDeep learning-based recommender systems have achieved remarkable success in recent years. However, these methods usually heavily rely on labeled data (i.e., user-item interactions), suffering from problems such as data sparsity and cold-start. Self-supervised learning, an emerging paradigm that extracts information from unlabeled data, provides insights into addressing these problems. Specifically, contrastive self-supervised learning, due to its flexibility and promising performance, has attracted considerable interest and recently become a dominant branch in self-supervised learning-based recommendation methods. In this survey, we provide an up-to-date and comprehensive review of current contrastive self-supervised learning-based recommendation methods. Firstly, we propose a unified framework for these methods. We then introduce a taxonomy based on the key components of the framework, including view generation strategy, contrastive task, and contrastive objective. For each component, we provide detailed descriptions and discussions to guide the choice of the appropriate method. Finally, we outline open issues and promising directions for future research. Mengyuan Jing, Yanmin Zhu 0006, Tianzi Zang, Ke Wang 0038 |
ACM Trans. Inf. Syst. | 4 |
| 2024 | Multi-aspect Graph Contrastive Learning for Review-enhanced RecommendationabstractReview-based recommender systems explore semantic aspects of users’ preferences by incorporating user-generated reviews into rating-based models. Recent works have demonstrated the potential of review information to improve the recommendation capacity. However, most existing studies rely on optimizing review-based representation learning part, thus failing to explicitly capture the fine-grained semantic aspects, and also ignoring the intrinsic correlation between ratings and reviews. To address these problems, we propose a multi-aspect graph contrastive learning framework, named MAGCL, with three distinctive designs: (i) a multi-aspect representation learning module, which projects semantic relations to different subspaces by decoupling review information, and then obtains high-order decoupled representations in each aspect via graph encoder. (ii) the contrastive learning module performs graph contrastive learning to capture the correlation between rating and review patterns, which utilize unlabeled data to generate self-supervised signals and, in turn, relieve the data sparsity problem of supervision signals. (iii) the multi-task learning module conducts joint training to learn high-order structure-aware yet self-discriminative node representations by combining recommendation task and self-supervised task, which helps alleviate the over-smoothing problem. Extensive experiments are conducted on four real-world review datasets and the results show the superiority of the proposed framework MAGCL compared with several state of the arts. We also provide further analysis on multi-aspect representations and graph contrastive learning to verify the advantage of proposed framework. Ke Wang 0038, Yanmin Zhu 0006, Tianzi Zang, Chunyang Wang 0001, Peibo Ma |
ACM Trans. Inf. Syst. | 1 |
| 2024 | Contrastive Multi-view Interest Learning for Cross-domain Sequential RecommendationabstractCross-domain recommendation (CDR), which leverages information collected from other domains, has been empirically demonstrated to effectively alleviate data sparsity and cold-start problems encountered in traditional recommendation systems. However, current CDR methods, including those considering time information, do not jointly model the general and current interests within and across domains, which is pivotal for accurately predicting users’ future interactions. In this article, we propose a Contrastive learning-enhanced Multi-View interest learning model (CMVCDR) for cross-domain sequential recommendation. Specifically, we design a static view and a sequential view to model uses’ general interests and current interests, respectively. We divide a user’s general interest representation into a domain-invariant part and a domain-specific part. A cross-domain contrastive learning objective is introduced to impose constraints for optimizing these representations. In the sequential view, we first devise an attention mechanism guided by users’ domain-invariant interest representations to distill cross-domain knowledge pertaining to domain-invariant factors while reducing noise from irrelevant factors. We further design a domain-specific interest-guided temporal information aggregation mechanism to generate users’ current interest representations. Extensive experiments demonstrate the effectiveness of our proposed model compared with state-of-the-art methods. Tianzi Zang, Yanmin Zhu 0006, Chunyang Wang 0001, Ke Wang 0038, Jiadi Yu |
ACM Trans. Inf. Syst. | 5 |
| 2023 | Disentangled Contrastive Learning for Cross-Domain Recommendation
Tianzi Zang, Yanmin Zhu 0006, Chunyang Wang 0001, Ke Wang 0038, Jiadi Yu |
DASFAA (2) | 5 |
| 2023 | A Preference Learning Decoupling Framework for User Cold-Start RecommendationabstractThe issue of user cold-start poses a long-standing challenge to recommendation systems, due to the scarce interactions of new users. Recently, meta-learning based studies treat each cold-start user as a user-specific few-shot task and then derive meta-knowledge about fast model adaptation across training users. However, existing solutions mostly do not clearly distinguish the concept of new users and the concept of novel preferences, leading to over-reliance on meta-learning based adaptability to novel patterns. In addition, we also argue that the existing meta-training task construction inherently suffers from the memorization overfitting issue, which inevitably hinders meta-generalization to new users. In response to the aforementioned issues, we propose a preference learning decoupling framework, which is enhanced with meta-augmentation (PDMA), for user cold-start recommendation. To rescue the meta-learning from unnecessary adaptation to common patterns, our framework decouples preference learning for a cold-start user into two complementary aspects: common preference transfer, and novel preference adaptation. To handle the memorization overfitting issue, we further propose to augment meta-training users by injecting attribute-based noises, to achieve mutually-exclusive tasks. Extensive experiments on benchmark datasets demonstrate that our framework achieves superior performance improvements against state-of-the-art methods. We also show that our proposed framework is effective in alleviating memorization overfitting. Chunyang Wang 0001, Yanmin Zhu 0006, Aixin Sun, Zhaobo Wang, Ke Wang 0038 |
SIGIR | 5 |
| 2023 | Learning Aspect-Aware High-Order Representations from Ratings and Reviews for RecommendationabstractTextual reviews contain rich semantic information that is useful for making better recommendation, as such semantic information may indicate more fine-grained preferences of users. Recent efforts make considerable improvement on recommendation by integrating textual reviews in rating-based recommendations. However, there still exist major challenges on integrating textual reviews for recommendation. On the one hand, most existing works focus on learning a single representation from reviews but ignoring complex relations between users (or items) and reviews, which may fail to capture user preferences and item attributes together. On the other hand, these works independently learn latent representations from ratings and reviews while omitting correlations between rating-based features and review-based features, which may harm recommendation performance. In this article, we capture the aspect-aware relations by constructing heterogeneous graphs from reviews. Furthermore, we propose a new recommendation model, namely AHOR, to jointly distill rating-based features and review-based features, which are derived from ratings and reviews, respectively. To explore the multi-hop connectivity information between users, items, and aspects, a novel graph neural network is introduced to learn aspect-aware high-order representations. Experiments based on public datasets show that our approach outperforms state-of-the-art methods. We also provide detailed analysis on the high-order signals and the aspect importance to show the interpretability of our proposed model. Ke Wang 0038, Yanmin Zhu 0006, Haobing Liu 0001, Tianzi Zang, Chunyang Wang 0001 |
ACM Trans. Knowl. Discov. Data | 1 |
| 2023 | Multifaceted Relation-aware Meta-learning with Dual Customization for User Cold-start RecommendationabstractUser cold-start scenarios pose great challenges to recommendation systems in accurately capturing user preferences with sparse interaction records. Besides incorporating auxiliary information to enrich user/item representations, recent studies under the schema of meta-learning focus on quickly adapting personalized recommendation models based on cold-start users’ scarce interactions. The majority of meta-learning based recommendation methods follow a bi-level optimization paradigm and learn globally shared initialization across all cold-start recommendation tasks. In addition, to further facilitate the ability of fast adaptation, existing methods have made efforts to tailor task-specific prior knowledge by identifying the individual characteristics of each task. However, we argue that multi-view commonalities between existing users and cold-start users are also essential for precisely distinguishing new tasks, but not comprehensively modeled in previous studies. In this article, we propose a multifaceted relation-aware meta-learning approach namely MeCM for user cold-start recommendation, which enhances task-adaptive initialization customization by extracting multiple views of task relevance. We design a dual customization framework consisting of two successive phases including cluster-level customization and task-level customization. Specifically, MeCM first extracts multifaceted semantic relations between tasks and refines task commonalities into task clusters maintained with memory networks (MNs). Globally learned fast weights corresponding to task clusters are queried to perform cluster-level customization. Then task-level customization is triggered based on contextual information of the target task via interaction-wise encoding. Extensive experiments on real-world datasets demonstrate the superior performance of our model over state-of-the-art meta-learning-based recommendation methods. Chunyang Wang 0001, Yanmin Zhu 0006, Haobing Liu 0001, Tianzi Zang, Ke Wang 0038, Jiadi Yu |
ACM Trans. Knowl. Discov. Data | 5 |
| 2022 | Inter- and Intra-Domain Relation-Aware Heterogeneous Graph Convolutional Networks for Cross-Domain Recommendation
Ke Wang 0038, Yanmin Zhu 0006, Haobing Liu 0001, Tianzi Zang, Chunyang Wang 0001 |
DASFAA (2) | 1 |