Wei Wang 0375

dblp:35/7092-375 · DBLP profile ↗
← Back
5ranked-venue papers
3as first author
4since 2021 · last 2026
0000-0002-7080-3381ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 3 · 2 first-author · 3 since 2021Artificial intelligence and machine learning · 2 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
2 papers
Recommender systems · 100%
Network and information security
1 paper
Privacy and data protection · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Recommender systems
sequential recommendation
1.722025
Privacy-Preserving Sequential Recommendation with Collaborative Confusion · ACM Trans. Inf. Syst. 2025
Triplet Contrastive Learning with Learnable Sequence Augmentation for Sequential Recommendation · SIGIR 2025
Recommender systems › sequential recommendation
cross-platform recommendation
0.912025
Triplet Contrastive Learning with Learnable Sequence Augmentation for Sequential Recommendation · SIGIR 2025
Privacy and data protection › anonymization
data obfuscation
0.912025
Privacy-Preserving Sequential Recommendation with Collaborative Confusion · ACM Trans. Inf. Syst. 2025

Methods — techniques the papers use, named apart from their topics

sequence modification · 1.7copy mechanism · 1.7triplet contrastive learning · 0.9data augmentation · 0.9
YearPublicationVenuePosition
2026 MCCL: Entailment tree generation via multi-fact contrastive selection and consistent LLM-based inference
Siwen Zhao, Wei Wang 0375, Yunnuo Xu
Inf. Sci.2
2025 Triplet Contrastive Learning with Learnable Sequence Augmentation for Sequential Recommendation
abstract
The quality of augmented data directly affects the performance of contrastive learning. Low-quality augmentation offers limited benefits for model optimization. Existing contrastive learning-based sequential recommendation works primarily utilize heuristic data augmentation methods, which often exhibit excessive randomness and struggle to generate positive samples that align with users' true intentions.
Wei Wang 0375, Yujie Lin 0001, Moyan Zhang, Jianli Zhao 0002, Xianye Ben, Pengjie Ren
SIGIR1
2025 Privacy-Preserving Sequential Recommendation with Collaborative Confusion
abstract
Sequential recommendation has attracted a lot of attention from both academia and industry, however the privacy risks associated with gathering and transferring users’ personal interaction data are often underestimated or ignored. Existing privacy-preserving studies are mainly applied to traditional collaborative filtering or matrix factorization rather than sequential recommendation. Moreover, these studies are mostly based on differential privacy or federated learning, which often lead to significant performance degradation, or have high requirements for communication. In this work, we address privacy-preserving from a different perspective. Unlike existing research, we capture collaborative signals of neighbor interaction sequences and directly inject indistinguishable items into the target sequence before the recommendation process begins, thereby increasing the perplexity of the target sequence. Even if the target interaction sequence is obtained by attackers, it is difficult to discern which ones are the actual user interaction records. To achieve this goal, we introduce a novel sequential recommender system called CoLlaborative-cOnfusion seqUential recommenDer (CLOUD) , which incorporates a collaborative confusion mechanism to modify the raw interaction sequences before conducting recommendation. Specifically, CLOUD first calculates the similarity between the target interaction sequence and other neighbor sequences to find similar sequences. Then, CLOUD considers the shared representation of the target sequence and similar sequences to determine the operation to be performed: keep, delete, or insert. A copy mechanism is designed to make items from similar sequences have a higher probability to be inserted into the target sequence. Finally, the modified sequence is used to train the recommender and predict the next item. We conduct extensive experiments on three benchmark datasets. The experimental results show that CLOUD achieves a maximum modification rate of 66.57% on interaction sequences and obtains over 99% recommendation accuracy compared to the state-of-the-art sequential recommendation methods. This proves that CLOUD can effectively protect user privacy at minimal recommendation performance cost, which provides a new solution for privacy-preserving for sequential recommendation. Our implementation is available at https://github.com/weiwang0927/CLOUD .
Wei Wang 0375, Yujie Lin 0001, Pengjie Ren, Zhumin Chen, Tsunenori Mine, Jianli Zhao 0002, Qiang Zhao 0011, Moyan Zhang, Xianye Ben
ACM Trans. Inf. Syst.1
2023 Tensor Ring decomposition for context-aware recommendation
Wei Wang 0375, Siwen Zhao, Jianli Zhao 0002
Expert Syst. Appl.1
2020 TrustTF: A tensor factorization model using user trust and implicit feedback for context-aware recommender systems
Jianli Zhao 0002, Wei Wang 0375, Zipei Zhang, Qiuxia Sun, Huan Huo, Lijun Qu, Shidong Zheng
Knowl. Based Syst.2