{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T17:58:07Z","timestamp":1775671087687,"version":"3.50.1"},"publisher-location":"Singapore","reference-count":24,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819708611","type":"print"},{"value":"9789819708628","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-981-97-0862-8_20","type":"book-chapter","created":{"date-parts":[[2024,2,29]],"date-time":"2024-02-29T08:03:04Z","timestamp":1709193784000},"page":"316-327","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["AOPT-FL: A Communication-Efficient Federated Learning Method with\u00a0Clusterd and\u00a0Sparsification"],"prefix":"10.1007","author":[{"given":"Danlei","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Geming","family":"Xia","sequence":"additional","affiliation":[]},{"given":"Yuxuan","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,3,1]]},"reference":[{"key":"20_CR1","unstructured":"McMahan, B., Moore, E., Ramage, D., Hampson, S., Arcas, B.A.: Communication-efficient learning of deep networks from decentralized data. In: Artificial Intelligence and Statistics, pp. 1273\u20131282. PMLR (2017)"},{"issue":"9","key":"20_CR2","doi-asserted-by":"publisher","first-page":"3400","DOI":"10.1109\/TNNLS.2019.2944481","volume":"31","author":"F Sattler","year":"2019","unstructured":"Sattler, F., Wiedemann, S., M\u00fcller, K.R., Samek, W.: Robust and communication-efficient Federated Learning from non-IID data. IEEE Trans. Neural Netw. Learn. Syst. 31(9), 3400\u20133413 (2019)","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"Chaodong, Y., Jian, C., Geming, X.: Coordinated control of intelligent fuzzy traffic signal based on edge computing distribution. Sensors 5953 (2022)","DOI":"10.3390\/s22165953"},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"Sattler, F., Wiedemann, S., M\u00fcller, K.R., Samek, W.: Sparse binary compression: towards distributed deep learning with minimal communication. In: 2019 International Joint Conference on Neural Networks (IJCNN), pp. 1\u20138. IEEE (2019)","DOI":"10.1109\/IJCNN.2019.8852172"},{"key":"20_CR5","unstructured":"Li, X., Huang, K., Yang, W., Wang, S., Zhang, Z.: On the convergence of FedAvg on non-IID data. arXiv preprint arXiv:1907.02189 (2019)"},{"key":"20_CR6","unstructured":"Hsieh, K., Phanishayee, A., Mutlu, O., Gibbons, P.: The non-IID data quagmire of decentralized machine learning. In: International Conference on Machine Learning, pp. 4387\u20134398. PMLR (2020)"},{"key":"20_CR7","doi-asserted-by":"crossref","unstructured":"Agrawal, S., Sarkar, S., Alazab, M., Maddikunta, P.K.R., Gadekallu, T.R., Pham, Q.V., et al.: Genetic CFL: hyperparameter optimization in clustered federated learning. Comput. Intell. Neurosci. 2021 (2021)","DOI":"10.1155\/2021\/7156420"},{"key":"20_CR8","unstructured":"Zhao, Y., Li, M., Lai, L., Suda, N., Civin, D., Chandra, V.: Federated learning with non-IID data (2018)"},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"Str\u00f6m, N.: Scalable distributed DNN training using commodity GPU cloud computing (2015)","DOI":"10.21437\/Interspeech.2015-354"},{"issue":"6","key":"20_CR10","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1109\/TCOM.1971.1090789","volume":"19","author":"R Rice","year":"1971","unstructured":"Rice, R., Plaunt, J.: Adaptive variable-length coding for efficient compression of spacecraft television data. IEEE Trans. Commun. Technol. 19(6), 889\u2013897 (1971)","journal-title":"IEEE Trans. Commun. Technol."},{"key":"20_CR11","doi-asserted-by":"crossref","unstructured":"Aji, A.F., Heafield, K.: Sparse communication for distributed gradient descent. arXiv preprint arXiv:1704.05021 (2017)","DOI":"10.18653\/v1\/D17-1045"},{"key":"20_CR12","unstructured":"Bernstein, J., Wang, Y.-X., Azizzadenesheli, K., Anandkumar, A.: signSGD: compressed optimisation for non-convex problems. In: International Conference on Machine Learning, pp. 560\u2013569. PMLR (2018)"},{"key":"20_CR13","unstructured":"Ghosh, A., Hong, J., Yin, D., Ramchandran, K.: Robust federated learning in a heterogeneous environment (2019)"},{"key":"20_CR14","doi-asserted-by":"crossref","unstructured":"Kim, Y., Hakim, E.A., Haraldson, J., Eriksson, H., Silva, J., Fischione, C.: Dynamic clustering in federated learning (2021)","DOI":"10.1109\/ICC42927.2021.9500877"},{"key":"20_CR15","doi-asserted-by":"crossref","unstructured":"Cheng, X., Gang, L., Pramod, K., V.: Federated learning with soft clustering. IEEE Internet Things J. 7773\u20137782 (2022)","DOI":"10.1109\/JIOT.2021.3113927"},{"key":"20_CR16","doi-asserted-by":"crossref","unstructured":"Khan, K., Rehman, S.U., Aziz, K., Fong, S., Sarasvady, S.: Dbscan: past, present and future. In: The Fifth International Conference on the Applications of Digital Information and Web Technologies (ICADIWT 2014), pp. 232\u2013238. IEEE (2014)","DOI":"10.1109\/ICADIWT.2014.6814687"},{"key":"20_CR17","doi-asserted-by":"crossref","unstructured":"Deutsch, P.: RFC 1951: Deflate compressed data format specification version 1.3(1996)","DOI":"10.17487\/rfc1951"},{"issue":"3","key":"20_CR18","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1109\/TIT.1977.1055714","volume":"23","author":"J Ziv","year":"1977","unstructured":"Ziv, J., Lempel, A.: A universal algorithm for sequential data compression. IEEE Trans. Inf. Theory 23(3), 337\u2013343 (1977)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6","key":"20_CR19","doi-asserted-by":"publisher","first-page":"1109","DOI":"10.1109\/TKDE.2017.2787640","volume":"30","author":"A Bryant","year":"2017","unstructured":"Bryant, A., Cios, K.: RNN-DBSCAN: a density-based clustering algorithm using reverse nearest neighbor density estimates. IEEE Trans. Knowl. Data Eng. 30(6), 1109\u20131121 (2017)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"20_CR20","doi-asserted-by":"crossref","unstructured":"Ankerst, M., Breunig, M., Kriegel, H.P., Sander, J.: Optics: ordering points to identify the clustering structure. ACM SIGMOD Rec. 49\u201360 (1999)","DOI":"10.1145\/304181.304187"},{"key":"20_CR21","doi-asserted-by":"crossref","unstructured":"Arisdakessian, S., Wahab, O.A., Mourad, A., Otrok, H.: Towards instant clustering approach for federated learning client selection. In: 2023 International Conference on Computing, Networking and Communications (ICNC), pp. 409\u2013413. IEEE (2023)","DOI":"10.1109\/ICNC57223.2023.10074237"},{"key":"20_CR22","unstructured":"Geming, X., Jian, C., Chaodong, Y., Jun, M.: Poisoning attacks in federated learning: a survey. IEEE Access 1 (2023)"},{"key":"20_CR23","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-79228-4_1","volume-title":"Theory and Applications of Models of Computation","author":"C Dwork","year":"2008","unstructured":"Dwork, C.: Differential privacy: a survey of results. In: Agrawal, M., Du, D., Duan, Z., Li, A. (eds.) TAMC 2008. LNCS, vol. 4978, pp. 1\u201319. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-79228-4_1"},{"key":"20_CR24","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/978-3-030-59410-7_33","volume-title":"Database Systems for Advanced Applications","author":"R Liu","year":"2020","unstructured":"Liu, R., Cao, Y., Yoshikawa, M., Chen, H.: FedSel: federated SGD under local differential privacy with top-k dimension selection. In: Nah, Y., Cui, B., Lee, S.W., Yu, J.X., Moon, Y.S., Whang, S.E. (eds.) DASFAA 2020. LNCS, vol. 12112, pp. 485\u2013501. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-59410-7_33"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Architectures for Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-97-0862-8_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,29]],"date-time":"2024-02-29T08:18:52Z","timestamp":1709194732000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-97-0862-8_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9789819708611","9789819708628"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-981-97-0862-8_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"1 March 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICA3PP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms and Architectures for Parallel Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tianjin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 October 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 October 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ica3pp2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/tjutanklab.com\/ica3pp2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Online submission system","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"439","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"145","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"33% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}