{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,11]],"date-time":"2026-06-11T14:55:10Z","timestamp":1781189710026,"version":"3.54.1"},"reference-count":48,"publisher":"MDPI AG","issue":"12","license":[{"start":{"date-parts":[[2022,12,13]],"date-time":"2022-12-13T00:00:00Z","timestamp":1670889600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Future Internet"],"abstract":"<jats:p>Federated Learning (FL) provides a promising solution for preserving privacy in learning shared models on distributed devices without sharing local data on a central server. However, most existing work shows that FL incurs high communication costs. To address this challenge, we propose a clustering-based federated solution, entitled Federated Learning via Clustering Optimization (FedCO), which optimizes model aggregation and reduces communication costs. In order to reduce the communication costs, we first divide the participating workers into groups based on the similarity of their model parameters and then select only one representative, the best performing worker, from each group to communicate with the central server. Then, in each successive round, we apply the Silhouette validation technique to check whether each representative is still made tight with its current cluster. If not, the representative is either moved into a more appropriate cluster or forms a cluster singleton. Finally, we use split optimization to update and improve the whole clustering solution. The updated clustering is used to select new cluster representatives. In that way, the proposed FedCO approach updates clusters by repeatedly evaluating and splitting clusters if doing so is necessary to improve the workers\u2019 partitioning. The potential of the proposed method is demonstrated on publicly available datasets and LEAF datasets under the IID and Non-IID data distribution settings. The experimental results indicate that our proposed FedCO approach is superior to the state-of-the-art FL approaches, i.e., FedAvg, FedProx, and CMFL, in reducing communication costs and achieving a better accuracy in both the IID and Non-IID cases.<\/jats:p>","DOI":"10.3390\/fi14120377","type":"journal-article","created":{"date-parts":[[2022,12,14]],"date-time":"2022-12-14T02:54:21Z","timestamp":1670986461000},"page":"377","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["FedCO: Communication-Efficient Federated Learning via Clustering Optimization"],"prefix":"10.3390","volume":"14","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6061-0861","authenticated-orcid":false,"given":"Ahmed A.","family":"Al-Saedi","sequence":"first","affiliation":[{"name":"Department of Computer Science, Blekinge Institute of Technology, SE-371 79 Karlskrona, Sweden"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3128-191X","authenticated-orcid":false,"given":"Veselka","family":"Boeva","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Blekinge Institute of Technology, SE-371 79 Karlskrona, Sweden"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3118-5058","authenticated-orcid":false,"given":"Emiliano","family":"Casalicchio","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Blekinge Institute of Technology, SE-371 79 Karlskrona, Sweden"},{"name":"Department of Computer Science, Sapienza University of Rome, 00185 Rome, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"1968","published-online":{"date-parts":[[2022,12,13]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"24411","DOI":"10.1109\/ACCESS.2018.2830661","article-title":"A Survey of Deep Learning: Platforms, Applications and Emerging Research Trends","volume":"6","author":"Hatcher","year":"2018","journal-title":"IEEE Access"},{"key":"ref_2","unstructured":"Goodfellow, I., Bengio, Y., and Courville, A. (2017). Deep Learning, The MIT Press."},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Papernot, N., McDaniel, P., Sinha, A., and Wellman, M.P. (2018, January 24\u201326). Sok: Security and Privacy in Machine Learning. Proceedings of the 2018 IEEE European Symposium on Security and Privacy (EuroS&P), London, UK.","DOI":"10.1109\/EuroSP.2018.00035"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"158126","DOI":"10.1109\/ACCESS.2019.2948912","article-title":"Machine Learning for Security and the Internet of Things: The Good, the Bad, and the Ugly","volume":"7","author":"Liang","year":"2019","journal-title":"IEEE Access"},{"key":"ref_5","first-page":"50","article-title":"Federated Learning: Challenges, Methods, and Future Directions","volume":"37","author":"Li","year":"2020","journal-title":"IEEE Signal Process. Mag."},{"key":"ref_6","first-page":"1273","article-title":"Communication-efficient learning of deep networks from decentralized data","volume":"54","author":"McMahan","year":"2017","journal-title":"Artif. Intell. Stat."},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Huang, G., Liu, Z., Van Der Maaten, L., and Weinberger, K.Q. (2017, January 21\u201326). Densely Connected Convolutional Networks. Proceedings of the 2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), Honolulu, HI, USA.","DOI":"10.1109\/CVPR.2017.243"},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Sattler, F., Wiedemann, S., Muller, K.-R., and Samek, W. (2019, January 14\u201319). Sparse Binary Compression: Towards Distributed Deep Learning with Minimal Communication. Proceedings of the 2019 International Joint Conference on Neural Networks (IJCNN), Budapest, Hungary.","DOI":"10.1109\/IJCNN.2019.8852172"},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Al-Saedi, A.A., Boeva, V., and Casalicchio, E. (2021, January 5\u20138). Reducing Communication Overhead of Federated Learning through Clustering Analysis. Proceedings of the 2021 IEEE Symposium on Computers and Communications (ISCC), Athens, Greece.","DOI":"10.1109\/ISCC53001.2021.9631391"},{"key":"ref_10","unstructured":"Li, T., Sahu, A.K., Zaheer, M., Sanjabi, M., Talwalkar, A., and Smith, V. (2021). Federated optimization in heterogeneous networks. arXiv."},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Wang, L., Wang, W., and Li, B. (2019, January 7\u20139). CMFL: Mitigating Communication Overhead for Federated Learning. Proceedings of the 2019 IEEE 39th International Conference on Distributed Computing Systems (ICDCS), Dallas, TX, USA.","DOI":"10.1109\/ICDCS.2019.00099"},{"key":"ref_12","unstructured":"Diao, E., Ding, J., and Tarokh, V. (2021). HeteroFL: Computation and Communication Efficient Federated Learning for Heterogeneous Clients. arXiv."},{"key":"ref_13","unstructured":"Reisizadeh, A., Mokhtari, A., Hassani, H., Jadbabaie, A., and Pedarsani, R. (2020). FedPAQ: A Communication-Efficient Federated Learning Method with Periodic Averaging and Quantization. arXiv."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"3710","DOI":"10.1109\/TNNLS.2020.3015958","article-title":"Clustered Federated Learning: Model-Agnostic Distributed Multitask Optimization under Privacy Constraints","volume":"32","author":"Sattler","year":"2021","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Shlezinger, N., Rini, S., and Eldar, Y.C. (2020, January 21\u201326). The Communication-Aware Clustered Federated Learning Problem. Proceedings of the 2020 IEEE International Symposium on Information Theory (ISIT), Los Angeles, CA, USA.","DOI":"10.1109\/ISIT44484.2020.9174245"},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Kim, Y., Hakim, E.A., Haraldson, J., Eriksson, H., da Silva, J.M., and Fischione, C. (2021, January 14\u201323). Dynamic Clustering in Federated Learning. Proceedings of the ICC 2021\u2014IEEE International Conference on Communications, Montreal, QC, Canada.","DOI":"10.1109\/ICC42927.2021.9500877"},{"key":"ref_17","unstructured":"Ghosh, A., Chung, J., Yin, D., and Ramchandran, K. (2020). An Efficient Framework for Clustered Federated Learning. arXiv."},{"key":"ref_18","unstructured":"Ouyang, X., Xie, Z., Zhou, J., Huang, J., and Xing, G. (July, January 24). CLUSTERFL. Proceedings of the 19th Annual International Conference on Mobile Systems, Applications, and Services, Virtual Event, WI, USA."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"4229","DOI":"10.1109\/TNNLS.2019.2953131","article-title":"Communication-Efficient Federated Deep Learning with Layerwise Asynchronous Model Update and Temporally Weighted Aggregation","volume":"31","author":"Chen","year":"2020","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"ref_20","unstructured":"Caldas, S., Konecn\u00fd, J., McMahan, H.B., and Talwalkar, A.S. (2018). Expanding the Reach of Federated Learning by Reducing Client Resource Requirements. arXiv."},{"key":"ref_21","unstructured":"Lin, Y., Han, S., Mao, H., Wang, Y., and Dally, W. (2018). Deep Gradient Compression: Reducing the Communication Bandwidth for Distributed Training. arXiv."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"3400","DOI":"10.1109\/TNNLS.2019.2944481","article-title":"Robust and Communication-Efficient Federated Learning from Non-I.i.d. Data","volume":"31","author":"Sattler","year":"2020","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"ref_23","unstructured":"Vogels, T., Karimireddy, S.P., and Jaggi, M. (2019, January 8\u201314). PowerSGD: Practical Low-Rank Gradient Compression for Distributed Optimization. Proceedings of the NeurIPS 2019\u2014Advances in Neural Information Processing Systems, Vancouver, BC, Canada."},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Asad, M., Moustafa, A., and Ito, T. (2020). Fedopt: Towards Communication Efficiency and Privacy Preservation in Federated Learning. Appl. Sci., 10.","DOI":"10.3390\/app10082864"},{"key":"ref_25","unstructured":"Malekijoo, A., Fadaeieslam, M.J., Malekijou, H., Homayounfar, M., Alizadeh-Shabdiz, F., and Rawassizadeh, R. (2021). FEDZIP: A Compression Framework for Communication-Efficient Federated Learning. arXiv."},{"key":"ref_26","unstructured":"Rothchild, D., Panda, A., Ullah, E., Ivkin, N., Stoica, I., Braverman, V., Gonzalez, J.E., and Arora, R. (2020). FetchSGD: Communication-Efficient Federated Learning with Sketching. arXiv."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"1162","DOI":"10.1109\/TNNLS.2020.3041185","article-title":"Ternary Compression for Communication-Efficient Federated Learning","volume":"33","author":"Xu","year":"2022","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"ref_28","doi-asserted-by":"crossref","unstructured":"Chai, Z., Chen, Y., Anwar, A., Zhao, L., Cheng, Y., and Rangwala, H. (2021, January 14\u201319). FedAT: A high-performance and communication-efficient federated learning system with asynchronous tiers. Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis, St. Louis, MI, USA.","DOI":"10.1145\/3458817.3476211"},{"key":"ref_29","doi-asserted-by":"crossref","unstructured":"Wu, X., Liang, Z., and Wang, J. (2020). FedMed: A Federated Learning Framework for Language Modeling. Sensors, 20.","DOI":"10.3390\/s20144048"},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"107235","DOI":"10.1016\/j.asoc.2021.107235","article-title":"CEEP-FL: A Comprehensive Approach for Communication Efficiency and Enhanced Privacy in Federated Learning","volume":"104","author":"Asad","year":"2021","journal-title":"Appl. Soft Comput."},{"key":"ref_31","doi-asserted-by":"crossref","unstructured":"Nishio, T., and Yonetani, R. (2019, January 20\u201324). Client Selection for Federated Learning with Heterogeneous Resources in Mobile Edge. Proceedings of the ICC 2019\u20142019 IEEE International Conference on Communications (ICC), Shanghai, China.","DOI":"10.1109\/ICC.2019.8761315"},{"key":"ref_32","doi-asserted-by":"crossref","unstructured":"Park, S., Suh, Y., and Lee, J. (2021). FedPSO: Federated Learning Using Particle Swarm Optimization to Reduce Communication Costs. Sensors, 21.","DOI":"10.3390\/s21020600"},{"key":"ref_33","unstructured":"Chen, Z., Chong, K.F.E., and Quek, T.Q.S. (2021). Dynamic Attention-based Communication-Efficient Federated Learning. arXiv."},{"key":"ref_34","doi-asserted-by":"crossref","unstructured":"Larsson, H., Riaz, H., and Ickin, S. (2021, January 23). Automated Collaborator Selection for Federated Learning with Multi-Armed Bandit Agents. Proceedings of the 4th FlexNets Workshop on Flexible Networks Artificial Intelligence Supported Network Flexibility and Agility, Virtual Event.","DOI":"10.1145\/3472735.3473388"},{"key":"ref_35","doi-asserted-by":"crossref","unstructured":"Ji, S., Pan, S., Long, G., Li, X., Jiang, J., and Huang, Z. (2019, January 14\u201319). Learning Private Neural Language Modeling with Attentive Aggregation. Proceedings of the 2019 International Joint Conference on Neural Networks (IJCNN), Budapest, Hungary.","DOI":"10.1109\/IJCNN.2019.8852464"},{"key":"ref_36","doi-asserted-by":"crossref","unstructured":"Ribero, M., and Vikalo, H. (2020). Communication-Efficient Federated Learning via Optimal Client Sampling. arXiv.","DOI":"10.52591\/lxai2020071310"},{"key":"ref_37","unstructured":"Kone\u010dn\u00fd, J., McMahan, H.B., Yu, F.X., Richtarik, P., Suresh, A.T., and Bacon, D. (2016). Federated Learning: Strategies for Improving Communication Efficiency. arXiv."},{"key":"ref_38","first-page":"281","article-title":"Some methods for classification and analysis of multivariate observations","volume":"1","author":"MacQueen","year":"1967","journal-title":"Proc. Berkley Symp. Math. Stat. Probab."},{"key":"ref_39","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0377-0427(87)90125-7","article-title":"Silhouettes: A Graphical Aid to the Interpretation and Validation of Cluster Analysis","volume":"20","author":"Rousseeuw","year":"1987","journal-title":"J. Comput. Appl. Math."},{"key":"ref_40","doi-asserted-by":"crossref","first-page":"2278","DOI":"10.1109\/5.726791","article-title":"Gradient-based learning applied to document recognition","volume":"86","author":"LeCun","year":"1998","journal-title":"Proc. IEEE"},{"key":"ref_41","unstructured":"Xiao, H., Rasul, K., and Vollgraf, R. (2017). Fashion-MNIST: A Novel Image Dataset for Benchmarking Machine Learning Algorithms. arXiv."},{"key":"ref_42","unstructured":"Krizhevsky, A. (2022, April 18). Learning Multiple Layers of Features from Tiny Images. Available online: https:\/\/www.cs.toronto.edu\/~kriz\/learning-features-2009-TR.pdf."},{"key":"ref_43","unstructured":"Caldas, S., Wu, P., Li, T., Konecn\u00fd, J., McMahan, H.B., Smith, V., and Talwalkar, A.S. (2018). LEAF: A Benchmark for Federated Settings. arXiv."},{"key":"ref_44","unstructured":"LeCun, Y., and Cortes, C. (2022, April 18). The Mnist Database of Handwritten Digits. Available online: https:\/\/www.lri.fr\/~marc\/Master2\/MNIST_doc.pdf."},{"key":"ref_45","doi-asserted-by":"crossref","first-page":"10700","DOI":"10.1109\/JIOT.2019.2940820","article-title":"Incentive Mechanism for Reliable Federated Learning: A Joint Optimization Approach to Combining Reputation and Contract Theory","volume":"6","author":"Kang","year":"2019","journal-title":"IEEE Internet Things J."},{"key":"ref_46","doi-asserted-by":"crossref","unstructured":"Tran, N.H., Bao, W., Zomaya, A., Nguyen, M.N., and Hong, C.S. (2019\u20132, January 29). Federated Learning over Wireless Networks: Optimization Model Design and Analysis. Proceedings of the IEEE INFOCOM 2019\u2014IEEE Conference on Computer Communications, Paris, France.","DOI":"10.1109\/INFOCOM.2019.8737464"},{"key":"ref_47","unstructured":"Kone\u010dn\u00fd, J., McMahan, H.B., Ramage, D., and Richtarik, P. (2016). Federated optimization: Distributed machine learning for on-device intelligence. arXiv."},{"key":"ref_48","unstructured":"Zhou, P., Fang, P., and Hui, P. (2021). Loss Tolerant Federated Learning. arXiv."}],"container-title":["Future Internet"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-5903\/14\/12\/377\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T01:40:47Z","timestamp":1760146847000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-5903\/14\/12\/377"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,13]]},"references-count":48,"journal-issue":{"issue":"12","published-online":{"date-parts":[[2022,12]]}},"alternative-id":["fi14120377"],"URL":"https:\/\/doi.org\/10.3390\/fi14120377","relation":{},"ISSN":["1999-5903"],"issn-type":[{"value":"1999-5903","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,12,13]]}}}