Jingjing Xue
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
Jingjing Xue has a total of 19 co-authors. Here are the top co-authors by number of shared publications:
- Ruizhang Huang
Text Computing & Cognitive Intelligence Engineering Research Center of National Education Ministry, College of Computer Science and Technology, Guizhou University, Guiyang, China
4 shared publications - Ruina Bai
Guizhou Univ, Coll Comp Sci & Technol, Text Comp & Cognit Intelligence Engn Res Ctr, State Key Lab Publ Big Data,Natl Educ Minist, Guiyang, Guizhou, Peoples R China
3 shared publications - Yongbin Qin
Text Computing & Cognitive Intelligence Engineering Research Center of National Education Ministry, College of Computer Science and Technology, Guizhou University, Guiyang, China
3 shared publications Chuan Lin
2 shared publicationsRuina Bai
2 shared publicationsYanping Chen
2 shared publications
Latest Publications
- 14 August 2026
- Published by Elsevier in Knowledge-Based Systems
- Vol. 351
Semi-supervised multi-level contrastive learning for deep clustering
- 14 August 2026
- Published by Elsevier in Knowledge-Based Systems
- Vol. 351
Semi-supervised multi-level contrastive learning for deep clustering
- 10 February 2026
- Published by Elsevier in Pattern Recognition
- Vol. 177
Synergistic representation learning via dual sample interactions for multi-view clustering
- 10 February 2026
- Published by Elsevier in Pattern Recognition
- Vol. 177
Synergistic representation learning via dual sample interactions for multi-view clustering
- 3 February 2026
- Published by Elsevier in Information Processing & Management
- Vol. 63 (5)
DUIC: User-descriptive intention guided clustering for personalized and understandable document partitions
- 3 February 2026
- Published by Elsevier in Information Processing & Management
- Vol. 63 (5)
DUIC: User-descriptive intention guided clustering for personalized and understandable document partitions
- 3 December 2025
- Published by Elsevier in Information Fusion
- Vol. 129
Partitioning by preference: Discovering personalized document clusters via user-descriptive clustering intentions
- 3 December 2025
- Published by Elsevier in Information Fusion
- Vol. 129
Partitioning by preference: Discovering personalized document clusters via user-descriptive clustering intentions
- 12 September 2024
- Published by Springer Nature in Applied Intelligence
- Vol. 54 (23) , 12315-12331
Adaptive structural enhanced representation learning for deep document clustering
- 12 September 2024
- Published by Springer Nature in Applied Intelligence
- Vol. 54 (23) , 12315-12331
Adaptive structural enhanced representation learning for deep document clustering
- Open Access
- 15 September 2023
- Published by Hill Publishing Group Inc. in Journal of Humanities, Arts and Social Science
- Vol. 7 (8) , 1614-1619
Research on Supply Chain Finance Operation Model—Fresh Products as an Example
- 15 September 2023
- Published by Hill Publishing Group Inc. in Journal of Humanities, Arts and Social Science
- Vol. 7 (8) , 1614-1619
Open AccessResearch on Supply Chain Finance Operation Model—Fresh Products as an Example
- Open Access
FedBIAD: Communication-Efficient and Accuracy-Guaranteed Federated Learning with Bayesian Inference-Based Adaptive Dropout
Federated Learning (FL) emerges as a distributed machine learning paradigm without end-user data transmission, effectively avoiding privacy leakage. Participating devices in FL are usually bandwidth-constrained, and the uplink is much slower than the downlink in wireless networks, which causes a severe uplink communication bottleneck. A prominent direction to alleviate this problem is federated dropout, which drops fractional weights of local models. However, existing federated dropout studies focus on random or ordered dropout and lack theoretical support, resulting in unguaranteed performance. In this paper, we propose Federated learning with Bayesian Inference-based Adaptive Dropout (FedBIAD), which regards weight rows of local models as probability distributions and adaptively drops partial weight rows based on importance indicators correlated with the trend of local training loss. By applying FedBIAD, each client adaptively selects a high-quality dropping pattern with accurate approximations and only transmits parameters of non-dropped weight rows to mitigate uplink costs while improving accuracy. Theoretical analysis demonstrates that the convergence rate of the average generalization error of FedBIAD is minimax optimal up to a squared logarithmic factor. Extensive experiments on image classification and next-word prediction show that compared with status quo approaches, FedBIAD provides 2x uplink reduction with an accuracy increase of up to 2.41% even on non-Independent and Identically Distributed (non-IID) data, which brings up to 72% decrease in training time.
Open AccessFedBIAD: Communication-Efficient and Accuracy-Guaranteed Federated Learning with Bayesian Inference-Based Adaptive Dropout
Federated Learning (FL) emerges as a distributed machine learning paradigm without end-user data transmission, effectively avoiding privacy leakage. Participating devices in FL are usually bandwidth-constrained, and the uplink is much slower than the downlink in wireless networks, which causes a severe uplink communication bottleneck. A prominent direction to alleviate this problem is federated dropout, which drops fractional weights of local models. However, existing federated dropout studies focus on random or ordered dropout and lack theoretical support, resulting in unguaranteed performance. In this paper, we propose Federated learning with Bayesian Inference-based Adaptive Dropout (FedBIAD), which regards weight rows of local models as probability distributions and adaptively drops partial weight rows based on importance indicators correlated with the trend of local training loss. By applying FedBIAD, each client adaptively selects a high-quality dropping pattern with accurate approximations and only transmits parameters of non-dropped weight rows to mitigate uplink costs while improving accuracy. Theoretical analysis demonstrates that the convergence rate of the average generalization error of FedBIAD is minimax optimal up to a squared logarithmic factor. Extensive experiments on image classification and next-word prediction show that compared with status quo approaches, FedBIAD provides 2x uplink reduction with an accuracy increase of up to 2.41% even on non-Independent and Identically Distributed (non-IID) data, which brings up to 72% decrease in training time.