Langcai Cao
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Langcai Cao has a total of 36 co-authors. Here are the top co-authors by number of shared publications:
- Bilian Chen
Department of Automation, Xiamen University, Xiamen, China
11 shared publications - Yifeng Zeng
Department of Computer and Information Sciences, Northumbria University, Newcastle, U.K.
5 shared publications - Biyang Ma
School of Computer Science, Minnan Normal University, Zhangzhou 363000, China
2 shared publications Huan Liu
2 shared publications- Shenbao Yu
College of Computer and Cyber Security, Fujian Normal University, Fuzhou, China
2 shared publications Bilian Chen
Xiamen University Department of Automation
1 shared publication
Latest Publications
- 9 May 2026
- Published by Elsevier in Neurocomputing
- Vol. 694
Multi-information attention fusion based on deep nonnegative matrix factorization for community detection
- 9 May 2026
- Published by Elsevier in Neurocomputing
- Vol. 694
Multi-information attention fusion based on deep nonnegative matrix factorization for community detection
- 6 May 2026
- Published by Springer Nature in Multimedia Systems
- Vol. 32 (4) , 265
Category-aware privacy preserving semi-decentralized BPR for POI recommendation with user clustering and encryption
- 6 May 2026
- Published by Springer Nature in Multimedia Systems
- Vol. 32 (4) , 265
Category-aware privacy preserving semi-decentralized BPR for POI recommendation with user clustering and encryption
- 3 February 2026
- Published by Springer Nature in Multimedia Systems
- Vol. 32 (2) , 87
An improved setwise collaborative ranking method leveraging neighborhood information
- 3 February 2026
- Published by Springer Nature in Multimedia Systems
- Vol. 32 (2) , 87
An improved setwise collaborative ranking method leveraging neighborhood information
- Open Access
- 24 August 2025
- Published by Wiley
Multiple Contrastive Constraints Based Deep Nonnegative Matrix Factorization For Community Detection
Community detection is a fundamental task in complex network analysis, aiming to identify closely connected subgraphs within the network. Recently, nonnegative matrix factorization (NMF)-based community detection methods have garnered significant attention due to their excellent clustering performance. However, most existing approaches are shallow and fail to fully capture the neighborhood information of nodes, which plays a critical role in node embedding learning. Considering the recent success of graph contrastive learning, its explicit structural constraint characteristics can effectively guide the model to learn embeddings useful for node clustering. To address the problems mentioned above, we propose a deep nonnegative matrix factorization model based on multiple contrastive constraints (CCDNMF). By incorporating the multi-neighborhood sampling method based on multiple constraints contrastive learning, this approach leverages node neighborhood features from different perspectives, capturing a rich set of local data distribution characteristics. This enables the learning of embeddings that preserve both global semantics and hierarchical local similarities, effectively integrating DNMF’s interpretability with the representational strengths of contrastive learning, and enhancing community discovery in complex networks. Extensive experiments are conducted on eleven real-world datasets that demonstrate the effectiveness and rationality of the proposed approach. The experimental results show that CCDNMF is superior to most existing methods.
- 24 August 2025
- Published by Wiley
Open AccessMultiple Contrastive Constraints Based Deep Nonnegative Matrix Factorization For Community Detection
Community detection is a fundamental task in complex network analysis, aiming to identify closely connected subgraphs within the network. Recently, nonnegative matrix factorization (NMF)-based community detection methods have garnered significant attention due to their excellent clustering performance. However, most existing approaches are shallow and fail to fully capture the neighborhood information of nodes, which plays a critical role in node embedding learning. Considering the recent success of graph contrastive learning, its explicit structural constraint characteristics can effectively guide the model to learn embeddings useful for node clustering. To address the problems mentioned above, we propose a deep nonnegative matrix factorization model based on multiple contrastive constraints (CCDNMF). By incorporating the multi-neighborhood sampling method based on multiple constraints contrastive learning, this approach leverages node neighborhood features from different perspectives, capturing a rich set of local data distribution characteristics. This enables the learning of embeddings that preserve both global semantics and hierarchical local similarities, effectively integrating DNMF’s interpretability with the representational strengths of contrastive learning, and enhancing community discovery in complex networks. Extensive experiments are conducted on eleven real-world datasets that demonstrate the effectiveness and rationality of the proposed approach. The experimental results show that CCDNMF is superior to most existing methods.
- 26 July 2025
- Published by Springer Nature in Applied Intelligence
- Vol. 55 (12) , 1-19
Privacy-preserving semi-decentralized matrix factorization for personalized recommendations with grouping and random transmission
- 26 July 2025
- Published by Springer Nature in Applied Intelligence
- Vol. 55 (12) , 1-19
Privacy-preserving semi-decentralized matrix factorization for personalized recommendations with grouping and random transmission
- 15 July 2025
- Published by Elsevier in Expert Systems with Applications
- Vol. 296
Dual-graph denoising and attention network for session-based recommendation
- 15 July 2025
- Published by Elsevier in Expert Systems with Applications
- Vol. 296
Dual-graph denoising and attention network for session-based recommendation
- Open Access
- 28 April 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 13, 75204-75219
Feature Reweighting-Based Factorization Machine for Effective Learning Latent Representation
Factorization machines (FMs) are widely employed as supervised predictors in collaborative recommendation. FMs can efficiently model second-order feature interactions through inner products, which proves beneficial for mitigating the negative effects of data sparsity. However, existing research has largely overlooked the potential correlations and attributes among features in FMs. These inherent relationships between features can enhance our understanding and facilitate the modeling of meaningful feature representations. To address this gap and capture intrinsic correlation information in the data, we propose a novel model named Feature Reweighting-based Factorization Machine (FRFM) in this paper. Specifically, we incorporate similarity into FM and quantify the strength of interactions between features using a similarity calculation method based on mutual information.We then introduce a feature reweighting strategy to effectively learn latent representations, ensuring that similar features exhibit comparable first-order weights and second-order embedding vectors based on their similarity. By assigning different weights to different feature pairs, FRFM adeptly captures the potential correlations and attributes among features within the model. Furthermore, FRFM can be seamlessly integrated into other models to enhance their performance. Extensive experiments conducted on six real-world datasets demonstrate the advantages of our proposed FRFM compared to state-of-the-art methods.
- 28 April 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 13, 75204-75219
Open AccessFeature Reweighting-Based Factorization Machine for Effective Learning Latent Representation
Factorization machines (FMs) are widely employed as supervised predictors in collaborative recommendation. FMs can efficiently model second-order feature interactions through inner products, which proves beneficial for mitigating the negative effects of data sparsity. However, existing research has largely overlooked the potential correlations and attributes among features in FMs. These inherent relationships between features can enhance our understanding and facilitate the modeling of meaningful feature representations. To address this gap and capture intrinsic correlation information in the data, we propose a novel model named Feature Reweighting-based Factorization Machine (FRFM) in this paper. Specifically, we incorporate similarity into FM and quantify the strength of interactions between features using a similarity calculation method based on mutual information.We then introduce a feature reweighting strategy to effectively learn latent representations, ensuring that similar features exhibit comparable first-order weights and second-order embedding vectors based on their similarity. By assigning different weights to different feature pairs, FRFM adeptly captures the potential correlations and attributes among features within the model. Furthermore, FRFM can be seamlessly integrated into other models to enhance their performance. Extensive experiments conducted on six real-world datasets demonstrate the advantages of our proposed FRFM compared to state-of-the-art methods.
- 31 March 2025
- Published by Elsevier in Neurocomputing
- Vol. 637
SMSBPR: A symmetric multi-pairwise preferences and similarity based BPR method for recommendation with implicit feedback
- 31 March 2025
- Published by Elsevier in Neurocomputing
- Vol. 637
SMSBPR: A symmetric multi-pairwise preferences and similarity based BPR method for recommendation with implicit feedback
- Open Access
- 27 June 2024
- Published by MDPI AG in Electronics
- Vol. 13 (13) , 2531
A Data-Driven Pandemic Simulator with Reinforcement Learning
After the coronavirus disease 2019 (COVID-19) outbreak erupted, it swiftly spread globally and triggered a severe public health crisis in 2019. To contain the virus’s spread, several countries implemented various lockdown measures. As the governments faced this unprecedented challenge, understanding the impact of lockdown policies became paramount. The goal of addressing the pandemic crisis is to devise prudent policies that strike a balance between safeguarding lives and maintaining economic stability. Traditional mathematical and statistical models for studying virus transmission only offer macro-level predictions of epidemic development and often overlook individual variations’ impact, therefore failing to reflect the role of government decisions. To address this challenge, we propose an integrated framework that combines agent-based modeling (ABM) and deep Q-network (DQN) techniques. This framework enables a more comprehensive analysis and optimization of epidemic control strategies while considering real human behavior. We construct a pandemic simulator based on the ABM method, accurately simulating agents’ daily activities, interactions, and the dynamic spread of the virus. Additionally, we employ a data-driven approach and adjust the model through real statistical data to enhance its effectiveness. Subsequently, we integrated ABM into a decision-making framework using reinforcement learning techniques to explore the most effective strategies. In experiments, we validated the model’s effectiveness by simulating virus transmission across different countries globally. In this model, we obtained decision outcomes when governments focused on various factors. Our research findings indicate that our model serves as a valuable tool for decision-makers, enabling them to formulate prudent and rational policies.
- 27 June 2024
- Published by MDPI AG in Electronics
- Vol. 13 (13) , 2531
Open AccessA Data-Driven Pandemic Simulator with Reinforcement Learning
After the coronavirus disease 2019 (COVID-19) outbreak erupted, it swiftly spread globally and triggered a severe public health crisis in 2019. To contain the virus’s spread, several countries implemented various lockdown measures. As the governments faced this unprecedented challenge, understanding the impact of lockdown policies became paramount. The goal of addressing the pandemic crisis is to devise prudent policies that strike a balance between safeguarding lives and maintaining economic stability. Traditional mathematical and statistical models for studying virus transmission only offer macro-level predictions of epidemic development and often overlook individual variations’ impact, therefore failing to reflect the role of government decisions. To address this challenge, we propose an integrated framework that combines agent-based modeling (ABM) and deep Q-network (DQN) techniques. This framework enables a more comprehensive analysis and optimization of epidemic control strategies while considering real human behavior. We construct a pandemic simulator based on the ABM method, accurately simulating agents’ daily activities, interactions, and the dynamic spread of the virus. Additionally, we employ a data-driven approach and adjust the model through real statistical data to enhance its effectiveness. Subsequently, we integrated ABM into a decision-making framework using reinforcement learning techniques to explore the most effective strategies. In experiments, we validated the model’s effectiveness by simulating virus transmission across different countries globally. In this model, we obtained decision outcomes when governments focused on various factors. Our research findings indicate that our model serves as a valuable tool for decision-makers, enabling them to formulate prudent and rational policies.
- 27 May 2024
- Published by Springer Nature in Multimedia Systems
- Vol. 30 (3) , 1-17
Improving collaborative filtering with SNE–GCN: a second-order neighbor enhanced graph convolutional network
- 27 May 2024
- Published by Springer Nature in Multimedia Systems
- Vol. 30 (3) , 1-17
Improving collaborative filtering with SNE–GCN: a second-order neighbor enhanced graph convolutional network