Weiming Liu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Weiming Liu has a total of 112 co-authors. Here are the top co-authors by number of shared publications:
- Chaochao Chen
Zhejiang University
25 shared publications - Xiaolin Zheng
Zhejiang University
20 shared publications - Fan Wang
Zhejiang University, Hangzhou, China
13 shared publications - Lianyong Qi
China University of Petroleum (East China), Qingdao, China
11 shared publications - Yanchao Tan
College of Computer and Data Science, Fuzhou University, Fuzhou, China
11 shared publications - Jiajie Su
Zhejiang University
10 shared publications
Latest Publications
- 1 December 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 38  (12) , 8181-8196
FedMMSR: Federated Multi-Modal Recommendation With Structural Guidance and Robust Integration
- 1 December 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 38  (12) , 8181-8196
FedMMSR: Federated Multi-Modal Recommendation With Structural Guidance and Robust Integration
- 1 December 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 38  (12) , 8576-8590
Wasserstein Barycentric Flow for Cross Embedding Transformation on Recommendation
- 1 December 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 38  (12) , 8576-8590
Wasserstein Barycentric Flow for Cross Embedding Transformation on Recommendation
- Open Access
- 19 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1198-1208
Fourier Kolmogorov-Arnold Network and Hypergraph Enhanced Contrastive Learning for Recommendation
- 19 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1198-1208
Open AccessFourier Kolmogorov-Arnold Network and Hypergraph Enhanced Contrastive Learning for Recommendation
- 20 May 2026
- Published by Elsevier in Neural Networks
- Vol. 203, 109144
Pareto-optimal estimation and policy learning for balancing short-term and long-term outcomes
- 20 May 2026
- Published by Elsevier in Neural Networks
- Vol. 203, 109144
Pareto-optimal estimation and policy learning for balancing short-term and long-term outcomes
- Open Access
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 6218-6229
Joint Similar User Exploration and Informative Behavior Guidance for Multi-Modal New Item Recommendation
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 6218-6229
Open AccessJoint Similar User Exploration and Informative Behavior Guidance for Multi-Modal New Item Recommendation
- 3 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 38  (1) , 138-151
Cluster-Enhanced Dual Discrete Collaborative Filtering for Efficient Recommendation
Hash-based collaborative filtering (Hash-CF) approaches recently employ efficient Hamming distance of learned binary representations to accelerate recommendations. Benefiting from its probabilistic nature, Variational Autoencoder (VAE) enables robust Hash-CF with stronger generalization ability. However, VAE-based Hash-CF still faces two challenging problems: 1) Traditional VAE urges the latent variables of different users (or items) to fit a unified and monotonous prior distribution, and lacks considerations for distinctive characteristics of users (or items). The obtained representations of users and items with slight individual differentiation may further weaken the performance of Hash-CF for subsequent personalized recommendations. 2) Hash-CF under the VAE framework requires discrete optimization on latent Bernoulli distributions, which are discrete and NP-hard to optimize. In this paper, we propose a Dual Discrete Collaborative Filtering (DDCF) approach, including a cluster-enhanced representation generation module and a CNF-enabled discrete optimization module. The former module mainly develops cluster-aware latent space to generate discriminative representations for users or items with significantly different characteristics. The latter module employs Continuous Normalizing Flow (CNF) to achieve discrete optimization on latent Bernoulli distributions steadily and effectively. Extensive experiments conducted on multiple real-world datasets demonstrate the superiority of our DDCF compared with the state-of-art methods in terms of effectiveness and efficiency.
- 3 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 38  (1) , 138-151
Cluster-Enhanced Dual Discrete Collaborative Filtering for Efficient Recommendation
Hash-based collaborative filtering (Hash-CF) approaches recently employ efficient Hamming distance of learned binary representations to accelerate recommendations. Benefiting from its probabilistic nature, Variational Autoencoder (VAE) enables robust Hash-CF with stronger generalization ability. However, VAE-based Hash-CF still faces two challenging problems: 1) Traditional VAE urges the latent variables of different users (or items) to fit a unified and monotonous prior distribution, and lacks considerations for distinctive characteristics of users (or items). The obtained representations of users and items with slight individual differentiation may further weaken the performance of Hash-CF for subsequent personalized recommendations. 2) Hash-CF under the VAE framework requires discrete optimization on latent Bernoulli distributions, which are discrete and NP-hard to optimize. In this paper, we propose a Dual Discrete Collaborative Filtering (DDCF) approach, including a cluster-enhanced representation generation module and a CNF-enabled discrete optimization module. The former module mainly develops cluster-aware latent space to generate discriminative representations for users or items with significantly different characteristics. The latter module employs Continuous Normalizing Flow (CNF) to achieve discrete optimization on latent Bernoulli distributions steadily and effectively. Extensive experiments conducted on multiple real-world datasets demonstrate the superiority of our DDCF compared with the state-of-art methods in terms of effectiveness and efficiency.
- 1 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Services Computing
- Vol. 18  (6) , 3595-3608
Contrastive Hypergraph Flows With Multifaceted Gates for Cross-Domain Sequential Recommendation
- 1 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Services Computing
- Vol. 18  (6) , 3595-3608
Contrastive Hypergraph Flows With Multifaceted Gates for Cross-Domain Sequential Recommendation
- Open Access
- 27 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 6203-6212
Boosting Guided Diffusion with Large Language Models for Multimodal Sequential Recommendation
- 27 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 6203-6212
Open AccessBoosting Guided Diffusion with Large Language Models for Multimodal Sequential Recommendation
- Open Access
- 27 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 2556-2565
Joint Test-time Adaptation with Refined Pseudo-labels and Latent Score Matching
- 27 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 2556-2565
Open AccessJoint Test-time Adaptation with Refined Pseudo-labels and Latent Score Matching