Mingyang Zhou
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Mingyang Zhou has a total of 85 co-authors. Here are the top co-authors by number of shared publications:
- Hao Liao
Shenzhen University
22 shared publications - Rui Mao
Shenzhen University
10 shared publications Hao Liao
8 shared publications- Kezhong Lu
Shenzhen University
5 shared publications - Alexandre Vidmer
Shenzhen University Shenzhen China
3 shared publications - Gang Liu
Shenzhen University, Shenzhen, Guangdong, China
3 shared publications
Latest Publications
- Open Access
- 6 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 3043-3053
PACIFIER: Pacing Opinion Depolarization via a Unified Graph Learning Framework
- 6 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 3043-3053
Open AccessPACIFIER: Pacing Opinion Depolarization via a Unified Graph Learning Framework
- Open Access
- 8 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 3527-3537
Optimal Metric-Aware Class Rebalancing in Federated Learning
Class imbalance is a significant challenge in many practical classification tasks, particularly in federated learning (FL), where both global data imbalance and local data heterogeneity across clients worsen the problem. Addressing the class imbalance problem effectively while adhering to privacy constraints remains a formidable challenge. A common solution is to rebalance (or reweight) the samples of different classes; however, the rebalancing ratio largely depends on empirical results. In this study, we propose an analytical class rebalancing method to compute the optimal rebalancing ratios for imbalanced datasets. We first theoretically derive the relationship between evaluation metrics--such as macro-precision, macro-recall, and macro-F1--and the rebalancing ratio. Based on these findings, we devise an efficient algorithm to determine the optimal rebalancing ratio that maximizes the corresponding metrics. Our method is parameter-free and doesn't increase the complexity of existing neural models. We demonstrate that our method achieves the optimum ratio for maximizing the concerned metrics while maintaining low computational complexity, scaling linearly with both the number of clients and samples. Experimental results on different datasets validate the effectiveness of our algorithms. To the best of our knowledge, we are the first to provide an analytical and parameter-free solution to the problem.
- 8 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 3527-3537
Open AccessOptimal Metric-Aware Class Rebalancing in Federated Learning
Class imbalance is a significant challenge in many practical classification tasks, particularly in federated learning (FL), where both global data imbalance and local data heterogeneity across clients worsen the problem. Addressing the class imbalance problem effectively while adhering to privacy constraints remains a formidable challenge. A common solution is to rebalance (or reweight) the samples of different classes; however, the rebalancing ratio largely depends on empirical results. In this study, we propose an analytical class rebalancing method to compute the optimal rebalancing ratios for imbalanced datasets. We first theoretically derive the relationship between evaluation metrics--such as macro-precision, macro-recall, and macro-F1--and the rebalancing ratio. Based on these findings, we devise an efficient algorithm to determine the optimal rebalancing ratio that maximizes the corresponding metrics. Our method is parameter-free and doesn't increase the complexity of existing neural models. We demonstrate that our method achieves the optimum ratio for maximizing the concerned metrics while maintaining low computational complexity, scaling linearly with both the number of clients and samples. Experimental results on different datasets validate the effectiveness of our algorithms. To the best of our knowledge, we are the first to provide an analytical and parameter-free solution to the problem.
- Open Access
- 8 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 1439-1450
Embedding-Space Orthogonal Decomposition for Robust Social Recommendation
- 8 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 1439-1450
Open AccessEmbedding-Space Orthogonal Decomposition for Robust Social Recommendation
- 26 February 2026
- Published by Elsevier in Physica A: Statistical Mechanics and its Applications
- Vol. 688
Removing noisy links benefits link prediction in complex network
- 26 February 2026
- Published by Elsevier in Physica A: Statistical Mechanics and its Applications
- Vol. 688
Removing noisy links benefits link prediction in complex network
- 21 February 2026
- Published by Elsevier in Journal of Network and Computer Applications
- Vol. 249
Accelerating the consensus speed of complex networked system via reweighting the edges
- 21 February 2026
- Published by Elsevier in Journal of Network and Computer Applications
- Vol. 249
Accelerating the consensus speed of complex networked system via reweighting the edges
- 17 February 2026
- Published by Elsevier in Pattern Recognition
- Vol. 177
Rebalancing classes in binary classification with Bayes classifiers
- 17 February 2026
- Published by Elsevier in Pattern Recognition
- Vol. 177
Rebalancing classes in binary classification with Bayes classifiers
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Social Systems
- Vol. 13 (4) , 1-10
Exploiting Temporal Decay and Dual Network for Influence Maximization
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Social Systems
- Vol. 13 (4) , 1-10
Exploiting Temporal Decay and Dual Network for Influence Maximization
- Open Access
- 1 September 2025
- Published by International Joint Conferences on Artificial Intelligence
- Vol. 3, 2323-2331
Denoising Diffusion Models are Good General Gaze Feature Learners
Since the collection of labeled gaze data is laborious and time-consuming, methods which can learn generalizable features by leveraging large-scale available unlabeled data are desirable. In recent years, we have witnessed the tremendous capabilities of diffusion models in generating images as well as their potential in feature representation learning. In this paper, we investigate whether they can acquire discriminative representations for gaze estimation via generative pre-training. To achieve this goal, we propose a self-supervised learning framework with diffusion models for gaze estimation, called GazeDiff. Specifically, we utilize a conditional diffusion model to generate target image with gaze direction specified by the reference image as the pre-training task. To facilitate the diffusion model to learn gaze related features as condition, we propose a disentangling feature learning strategy, which first learns appearance feature, head pose feature, and eye direction feature respectively, and then combines them as the conditional features. Extensive experiments demonstrate denoising diffusion models are also good general gaze feature learners.
- 1 September 2025
- Published by International Joint Conferences on Artificial Intelligence
- Vol. 3, 2323-2331
Open AccessDenoising Diffusion Models are Good General Gaze Feature Learners
Since the collection of labeled gaze data is laborious and time-consuming, methods which can learn generalizable features by leveraging large-scale available unlabeled data are desirable. In recent years, we have witnessed the tremendous capabilities of diffusion models in generating images as well as their potential in feature representation learning. In this paper, we investigate whether they can acquire discriminative representations for gaze estimation via generative pre-training. To achieve this goal, we propose a self-supervised learning framework with diffusion models for gaze estimation, called GazeDiff. Specifically, we utilize a conditional diffusion model to generate target image with gaze direction specified by the reference image as the pre-training task. To facilitate the diffusion model to learn gaze related features as condition, we propose a disentangling feature learning strategy, which first learns appearance feature, head pose feature, and eye direction feature respectively, and then combines them as the conditional features. Extensive experiments demonstrate denoising diffusion models are also good general gaze feature learners.
- Open Access
- 22 April 2025
- Published by Association for Computing Machinery (ACM)
- p. 2530-2539
Highly-efficient Minimization of Network Connectivity in Large-scale Graphs
- 22 April 2025
- Published by Association for Computing Machinery (ACM)
- p. 2530-2539
Open AccessHighly-efficient Minimization of Network Connectivity in Large-scale Graphs
- 1 April 2025
- Published by IOP Publishing in Europhysics Letters
- Vol. 150 (1) , 11001
Dissemination intelligence information on social media
Social media platforms, as complex socio-technical ecosystems, have reshaped the way individuals access, share, and interpret information. The interplay of diverse users, rapid content flow, and intricate network structures exemplifies the complexity science domain, where dynamic interactions give rise to emergent patterns of influence and opinion formation. In this perspective, we review three key areas of intelligent information dissemination on social media: 1) rumor and fake news detection, 2) competitive dissemination, and 3) the identification of influential nodes. We highlight recent advancements that leverage complexity-aware models, graph-based algorithms, and deep learning techniques to manage content credibility and guide the spread of verified information. Finally, we propose future research directions that bridge theory and practice, ultimately contributing to a more informed, reliable, and adaptive digital information ecosystem.
- 1 April 2025
- Published by IOP Publishing in Europhysics Letters
- Vol. 150 (1) , 11001
Dissemination intelligence information on social media
Social media platforms, as complex socio-technical ecosystems, have reshaped the way individuals access, share, and interpret information. The interplay of diverse users, rapid content flow, and intricate network structures exemplifies the complexity science domain, where dynamic interactions give rise to emergent patterns of influence and opinion formation. In this perspective, we review three key areas of intelligent information dissemination on social media: 1) rumor and fake news detection, 2) competitive dissemination, and 3) the identification of influential nodes. We highlight recent advancements that leverage complexity-aware models, graph-based algorithms, and deep learning techniques to manage content credibility and guide the spread of verified information. Finally, we propose future research directions that bridge theory and practice, ultimately contributing to a more informed, reliable, and adaptive digital information ecosystem.