{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,23]],"date-time":"2026-09-23T22:02:46Z","timestamp":1790200966827,"version":"4.1.0"},"reference-count":56,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Neurocomputing"],"published-print":{"date-parts":[[2026,11]]},"DOI":"10.1016\/j.neucom.2026.134639","type":"journal-article","created":{"date-parts":[[2026,7,29]],"date-time":"2026-07-29T06:45:13Z","timestamp":1785307513000},"page":"134639","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Extract-before-mix: Multi-domain topology-aware recovery for one-shot federated clustering under local differential privacy"],"prefix":"10.1016","volume":"702","author":[{"given":"Yunfei","family":"Li","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1354-2293","authenticated-orcid":false,"given":"Xiaodong","family":"Fu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Li","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jiaman","family":"Ding","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9572-951X","authenticated-orcid":false,"given":"Wei","family":"Peng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.neucom.2026.134639_bib0005","series-title":"International Conference on Artificial Intelligence and Statistics","first-page":"1273","article-title":"Communication-efficient learning of deep networks from decentralized data","author":"McMahan","year":"2017"},{"issue":"1\u20132","key":"10.1016\/j.neucom.2026.134639_bib0010","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1561\/2200000083","article-title":"Advances and open problems in federated learning","volume":"14","author":"Kairouz","year":"2021","journal-title":"Found. Trends Mach. Learn."},{"key":"10.1016\/j.neucom.2026.134639_bib0015","series-title":"Proceedings of the 38th International Conference on Machine Learning","first-page":"2611","article-title":"Heterogeneity for the win: one-shot federated clustering","author":"Dennis","year":"2021"},{"issue":"11","key":"10.1016\/j.neucom.2026.134639_bib0020","doi-asserted-by":"crossref","first-page":"13262","DOI":"10.1109\/TII.2024.3435420","article-title":"One-shot federated clustering based on stable distance relationships","volume":"20","author":"Wang","year":"2024","journal-title":"IEEE Trans. Ind. Inform."},{"key":"10.1016\/j.neucom.2026.134639_bib0025","series-title":"Proceedings of the AAAI Conference on Artificial Intelligence","first-page":"24044","article-title":"Topological federated clustering via gravitational potential fields under local differential privacy","author":"Long","year":"2026"},{"key":"10.1016\/j.neucom.2026.134639_bib0030","series-title":"International Conference on Learning Representations","article-title":"Machine unlearning of federated clusters","author":"Pan","year":"2023"},{"key":"10.1016\/j.neucom.2026.134639_bib0035","series-title":"2013 IEEE 54th Annual Symposium on Foundations of Computer Science","first-page":"429","article-title":"Local privacy and statistical minimax rates","author":"Duchi","year":"2013"},{"key":"10.1016\/j.neucom.2026.134639_bib0040","series-title":"Advances in Neural Information Processing Systems","first-page":"2879","article-title":"Extremal mechanisms for local differential privacy","author":"Kairouz","year":"2014"},{"key":"10.1016\/j.neucom.2026.134639_bib0045","series-title":"Theory of Cryptography Conference","first-page":"265","article-title":"Calibrating noise to sensitivity in private data analysis","author":"Dwork","year":"2006"},{"issue":"3\u20134","key":"10.1016\/j.neucom.2026.134639_bib0050","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1561\/0400000042","article-title":"The algorithmic foundations of differential privacy","volume":"9","author":"Dwork","year":"2014","journal-title":"Found. Trends Theor. Comput. Sci."},{"key":"10.1016\/j.neucom.2026.134639_bib0055","series-title":"Proceedings of the Annual ACM Symposium on Theory of Computing","first-page":"75","article-title":"Smooth sensitivity and sampling in private data analysis","author":"Nissim","year":"2007"},{"key":"10.1016\/j.neucom.2026.134639_bib0060","series-title":"Proceedings of the Annual ACM Symposium on Theory of Computing","first-page":"813","article-title":"Privacy-preserving statistical estimation with optimal convergence rates","author":"Smith","year":"2011"},{"key":"10.1016\/j.neucom.2026.134639_bib0065","series-title":"IEEE Computer Security Foundations Symposium","first-page":"263","article-title":"R\u00e9nyi differential privacy","author":"Mironov","year":"2017"},{"key":"10.1016\/j.neucom.2026.134639_bib0070","series-title":"Proceedings of the ACM SIGSAC Conference on Computer and Communications Security","first-page":"308","article-title":"Deep learning with differential privacy","author":"Abadi","year":"2016"},{"key":"10.1016\/j.neucom.2026.134639_bib0075","series-title":"Proceedings of the ACM SIGSAC Conference on Computer and Communications Security","first-page":"1310","article-title":"Privacy-preserving deep learning","author":"Shokri","year":"2015"},{"issue":"3","key":"10.1016\/j.neucom.2026.134639_bib0080","doi-asserted-by":"crossref","first-page":"793","DOI":"10.1137\/090756090","article-title":"What can we learn privately?","volume":"40","author":"Kasiviswanathan","year":"2011","journal-title":"SIAM J. Comput."},{"issue":"309","key":"10.1016\/j.neucom.2026.134639_bib0085","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1080\/01621459.1965.10480775","article-title":"Randomized response: a survey technique for eliminating evasive answer bias","volume":"60","author":"Warner","year":"1965","journal-title":"J. Am. Stat. Assoc."},{"key":"10.1016\/j.neucom.2026.134639_bib0090","series-title":"Proceedings of the ACM SIGSAC Conference on Computer and Communications Security","first-page":"1054","article-title":"RAPPOR: randomized aggregatable privacy-preserving ordinal response","author":"Erlingsson","year":"2014"},{"key":"10.1016\/j.neucom.2026.134639_bib0095","series-title":"USENIX Security Symposium","first-page":"729","article-title":"Locally differentially private protocols for frequency estimation","author":"Wang","year":"2017"},{"key":"10.1016\/j.neucom.2026.134639_bib0100","series-title":"Advances in Neural Information Processing Systems","first-page":"2285","article-title":"Practical locally private heavy hitters","volume":"vol. 30","author":"Bassily","year":"2017"},{"key":"10.1016\/j.neucom.2026.134639_bib0105","series-title":"International Conference on Artificial Intelligence and Statistics","first-page":"1120","article-title":"Hadamard response: estimating distributions privately, efficiently, and with little communication","author":"Acharya","year":"2019"},{"key":"10.1016\/j.neucom.2026.134639_bib0110","doi-asserted-by":"crossref","DOI":"10.1016\/j.cose.2024.104273","article-title":"Multi-domains personalized local differential privacy frequency estimation mechanism for utility optimization","volume":"150","author":"Li","year":"2025","journal-title":"Comput. Secur."},{"issue":"1","key":"10.1016\/j.neucom.2026.134639_bib0115","first-page":"1","article-title":"Personalized local differential privacy frequency estimation mechanisms based on partitioning the domain of real attribute values","volume":"20","author":"Li","year":"2026","journal-title":"Int. J. Inf. Secur. Priv."},{"key":"10.1016\/j.neucom.2026.134639_bib0120","article-title":"Personalized frequency estimation via multi-domain utility-optimized local differential privacy","author":"Li","year":"2026","journal-title":"J. King Saud Univ. Comput. Inf. Sci."},{"key":"10.1016\/j.neucom.2026.134639_bib0125","series-title":"Proceedings of the 2018 International Conference on Management of Data","first-page":"1655","article-title":"Privacy at scale: local differential privacy in practice","author":"Cormode","year":"2018"},{"key":"10.1016\/j.neucom.2026.134639_bib0130","series-title":"2019 IEEE 35th International Conference on Data Engineering","first-page":"638","article-title":"Collecting and analyzing multidimensional data with local differential privacy","author":"Wang","year":"2019"},{"issue":"8","key":"10.1016\/j.neucom.2026.134639_bib0135","doi-asserted-by":"crossref","first-page":"5662","DOI":"10.1109\/TIT.2018.2809790","article-title":"Optimal schemes for discrete distribution estimation under locally differential privacy","volume":"64","author":"Ye","year":"2018","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"10.1016\/j.neucom.2026.134639_bib0140","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1109\/MSP.2020.2975749","article-title":"Federated learning: challenges, methods, and future directions","volume":"37","author":"Li","year":"2020","journal-title":"IEEE Signal Process. Mag."},{"issue":"2","key":"10.1016\/j.neucom.2026.134639_bib0145","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3298981","article-title":"Federated machine learning: concept and applications","volume":"10","author":"Yang","year":"2019","journal-title":"ACM Trans. Intell. Syst. Technol."},{"key":"10.1016\/j.neucom.2026.134639_bib0150","series-title":"Proceedings of the ACM SIGSAC Conference on Computer and Communications Security","first-page":"1175","article-title":"Practical secure aggregation for privacy-preserving machine learning","author":"Bonawitz","year":"2017"},{"key":"10.1016\/j.neucom.2026.134639_bib0155","series-title":"International Conference on Learning Representations","article-title":"Learning differentially private recurrent language models","author":"McMahan","year":"2018"},{"key":"10.1016\/j.neucom.2026.134639_bib0160","series-title":"NIPS Workshop on Machine Learning on the Phone and Other Consumer Devices","article-title":"Differentially private federated learning: a client level perspective","author":"Geyer","year":"2017"},{"key":"10.1016\/j.neucom.2026.134639_bib0165","doi-asserted-by":"crossref","first-page":"3454","DOI":"10.1109\/TIFS.2020.2988575","article-title":"Federated learning with differential privacy: algorithms and performance analysis","volume":"15","author":"Wei","year":"2020","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"10.1016\/j.neucom.2026.134639_bib0170","series-title":"International Joint Conference on Neural Networks","first-page":"1","article-title":"Federated learning with hierarchical clustering of local updates to improve training on Non-IID data","author":"Briggs","year":"2020"},{"issue":"8","key":"10.1016\/j.neucom.2026.134639_bib0175","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":"10.1016\/j.neucom.2026.134639_bib0180","author":"Ghosh"},{"issue":"2","key":"10.1016\/j.neucom.2026.134639_bib0185","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1109\/TIT.1982.1056489","article-title":"Least squares quantization in PCM","volume":"28","author":"Lloyd","year":"1982","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10.1016\/j.neucom.2026.134639_bib0190","series-title":"Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms","first-page":"1027","article-title":"k-means++: the advantages of careful seeding","author":"Arthur","year":"2007"},{"issue":"8","key":"10.1016\/j.neucom.2026.134639_bib0195","doi-asserted-by":"crossref","first-page":"651","DOI":"10.1016\/j.patrec.2009.09.011","article-title":"Data clustering: 50 years beyond K-means","volume":"31","author":"Jain","year":"2010","journal-title":"Pattern Recognit. Lett."},{"issue":"336","key":"10.1016\/j.neucom.2026.134639_bib0200","doi-asserted-by":"crossref","first-page":"846","DOI":"10.1080\/01621459.1971.10482356","article-title":"Objective criteria for the evaluation of clustering methods","volume":"66","author":"Rand","year":"1971","journal-title":"J. Am. Stat. Assoc."},{"issue":"1","key":"10.1016\/j.neucom.2026.134639_bib0205","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/BF01908075","article-title":"Comparing partitions","volume":"2","author":"Hubert","year":"1985","journal-title":"J. Classif."},{"key":"10.1016\/j.neucom.2026.134639_bib0210","first-page":"2837","article-title":"Information theoretic measures for clusterings comparison: variants, properties, normalization and correction for chance","volume":"11","author":"Vinh","year":"2010","journal-title":"J. Mach. Learn. Res."},{"key":"10.1016\/j.neucom.2026.134639_bib0215","first-page":"583","article-title":"Cluster ensembles \u2013 a knowledge reuse framework for combining multiple partitions","volume":"3","author":"Strehl","year":"2002","journal-title":"J. Mach. Learn. Res."},{"issue":"6","key":"10.1016\/j.neucom.2026.134639_bib0220","doi-asserted-by":"crossref","first-page":"835","DOI":"10.1109\/TPAMI.2005.113","article-title":"Combining multiple clusterings using evidence accumulation","volume":"27","author":"Fred","year":"2005","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"12","key":"10.1016\/j.neucom.2026.134639_bib0225","doi-asserted-by":"crossref","first-page":"1866","DOI":"10.1109\/TPAMI.2005.237","article-title":"Clustering ensembles: models of consensus and weak partitions","volume":"27","author":"Topchy","year":"2005","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"10.1016\/j.neucom.2026.134639_bib0230","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1007\/s00454-002-2885-2","article-title":"Topological persistence and simplification","volume":"28","author":"Edelsbrunner","year":"2002","journal-title":"Discrete Comput. Geom."},{"issue":"2","key":"10.1016\/j.neucom.2026.134639_bib0235","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/s00454-004-1146-y","article-title":"Computing persistent homology","volume":"33","author":"Zomorodian","year":"2005","journal-title":"Discrete Comput. Geom."},{"issue":"2","key":"10.1016\/j.neucom.2026.134639_bib0240","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1090\/S0273-0979-09-01249-X","article-title":"Topology and data","volume":"46","author":"Carlsson","year":"2009","journal-title":"Bull. Am. Math. Soc."},{"key":"10.1016\/j.neucom.2026.134639_bib0245","series-title":"Computational Topology: An Introduction","author":"Edelsbrunner","year":"2010"},{"issue":"1","key":"10.1016\/j.neucom.2026.134639_bib0250","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/s00454-006-1276-5","article-title":"Stability of persistence diagrams","volume":"37","author":"Cohen-Steiner","year":"2007","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/j.neucom.2026.134639_bib0255","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/s10711-013-9937-z","article-title":"Persistence stability for geometric complexes","volume":"173","author":"Chazal","year":"2014","journal-title":"Geom. Dedicata"},{"issue":"6","key":"10.1016\/j.neucom.2026.134639_bib0260","doi-asserted-by":"crossref","first-page":"2301","DOI":"10.1214\/14-AOS1252","article-title":"Confidence sets for persistence diagrams","volume":"42","author":"Fasy","year":"2014","journal-title":"Ann. Stat."},{"key":"10.1016\/j.neucom.2026.134639_bib0265","series-title":"The Structure and Stability of Persistence Modules","author":"Chazal","year":"2016"},{"issue":"5","key":"10.1016\/j.neucom.2026.134639_bib0270","doi-asserted-by":"crossref","first-page":"603","DOI":"10.1109\/34.1000236","article-title":"Mean shift: a robust approach toward feature space analysis","volume":"24","author":"Comaniciu","year":"2002","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"6191","key":"10.1016\/j.neucom.2026.134639_bib0275","doi-asserted-by":"crossref","first-page":"1492","DOI":"10.1126\/science.1242072","article-title":"Clustering by fast search and find of density peaks","volume":"344","author":"Rodriguez","year":"2014","journal-title":"Science"},{"key":"10.1016\/j.neucom.2026.134639_bib0280","doi-asserted-by":"crossref","DOI":"10.1016\/j.knosys.2019.06.032","article-title":"Fast density peak clustering for large scale data based on kNN","volume":"187","author":"Chen","year":"2020","journal-title":"Knowl.-Based Syst."}],"container-title":["Neurocomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925231226020370?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925231226020370?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,9,23]],"date-time":"2026-09-23T21:13:13Z","timestamp":1790197993000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0925231226020370"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,11]]},"references-count":56,"alternative-id":["S0925231226020370"],"URL":"https:\/\/doi.org\/10.1016\/j.neucom.2026.134639","relation":{},"ISSN":["0925-2312"],"issn-type":[{"value":"0925-2312","type":"print"}],"subject":[],"published":{"date-parts":[[2026,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Extract-before-mix: Multi-domain topology-aware recovery for one-shot federated clustering under local differential privacy","name":"articletitle","label":"Article Title"},{"value":"Neurocomputing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.neucom.2026.134639","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"134639"}}