联合单次组合聚类

Rui Duan, Xin Xiong, Jueyi Liu, Katherine P. Liao, Tianxi Cai
{"title":"联合单次组合聚类","authors":"Rui Duan, Xin Xiong, Jueyi Liu, Katherine P. Liao, Tianxi Cai","doi":"arxiv-2409.08396","DOIUrl":null,"url":null,"abstract":"Cluster analysis across multiple institutions poses significant challenges\ndue to data-sharing restrictions. To overcome these limitations, we introduce\nthe Federated One-shot Ensemble Clustering (FONT) algorithm, a novel solution\ntailored for multi-site analyses under such constraints. FONT requires only a\nsingle round of communication between sites and ensures privacy by exchanging\nonly fitted model parameters and class labels. The algorithm combines locally\nfitted clustering models into a data-adaptive ensemble, making it broadly\napplicable to various clustering techniques and robust to differences in\ncluster proportions across sites. Our theoretical analysis validates the\neffectiveness of the data-adaptive weights learned by FONT, and simulation\nstudies demonstrate its superior performance compared to existing benchmark\nmethods. We applied FONT to identify subgroups of patients with rheumatoid\narthritis across two health systems, revealing improved consistency of patient\nclusters across sites, while locally fitted clusters proved less transferable.\nFONT is particularly well-suited for real-world applications with stringent\ncommunication and privacy constraints, offering a scalable and practical\nsolution for multi-site clustering.","PeriodicalId":501340,"journal":{"name":"arXiv - STAT - Machine Learning","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2024-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Federated One-Shot Ensemble Clustering\",\"authors\":\"Rui Duan, Xin Xiong, Jueyi Liu, Katherine P. Liao, Tianxi Cai\",\"doi\":\"arxiv-2409.08396\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Cluster analysis across multiple institutions poses significant challenges\\ndue to data-sharing restrictions. To overcome these limitations, we introduce\\nthe Federated One-shot Ensemble Clustering (FONT) algorithm, a novel solution\\ntailored for multi-site analyses under such constraints. FONT requires only a\\nsingle round of communication between sites and ensures privacy by exchanging\\nonly fitted model parameters and class labels. The algorithm combines locally\\nfitted clustering models into a data-adaptive ensemble, making it broadly\\napplicable to various clustering techniques and robust to differences in\\ncluster proportions across sites. Our theoretical analysis validates the\\neffectiveness of the data-adaptive weights learned by FONT, and simulation\\nstudies demonstrate its superior performance compared to existing benchmark\\nmethods. We applied FONT to identify subgroups of patients with rheumatoid\\narthritis across two health systems, revealing improved consistency of patient\\nclusters across sites, while locally fitted clusters proved less transferable.\\nFONT is particularly well-suited for real-world applications with stringent\\ncommunication and privacy constraints, offering a scalable and practical\\nsolution for multi-site clustering.\",\"PeriodicalId\":501340,\"journal\":{\"name\":\"arXiv - STAT - Machine Learning\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-09-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv - STAT - Machine Learning\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/arxiv-2409.08396\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - STAT - Machine Learning","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2409.08396","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

由于数据共享方面的限制,跨机构聚类分析面临着巨大挑战。为了克服这些限制,我们引入了联合单次集合聚类(FONT)算法,这是一种新颖的解决方案,专为这种限制下的多站点分析而设计。FONT 只需要在站点之间进行一轮通信,并通过只交换拟合模型参数和类标签来确保隐私。该算法将本地拟合的聚类模型组合成一个数据适应性集合,使其广泛适用于各种聚类技术,并对不同研究地点的聚类比例差异具有鲁棒性。我们的理论分析验证了 FONT 所学习的数据自适应权重的有效性,而模拟研究则证明了它与现有基准方法相比的卓越性能。我们将 FONT 应用于识别两个医疗系统中的类风湿关节炎患者亚群,结果表明患者聚类在不同地点的一致性得到了改善,而局部拟合聚类的可转移性较差。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Federated One-Shot Ensemble Clustering
Cluster analysis across multiple institutions poses significant challenges due to data-sharing restrictions. To overcome these limitations, we introduce the Federated One-shot Ensemble Clustering (FONT) algorithm, a novel solution tailored for multi-site analyses under such constraints. FONT requires only a single round of communication between sites and ensures privacy by exchanging only fitted model parameters and class labels. The algorithm combines locally fitted clustering models into a data-adaptive ensemble, making it broadly applicable to various clustering techniques and robust to differences in cluster proportions across sites. Our theoretical analysis validates the effectiveness of the data-adaptive weights learned by FONT, and simulation studies demonstrate its superior performance compared to existing benchmark methods. We applied FONT to identify subgroups of patients with rheumatoid arthritis across two health systems, revealing improved consistency of patient clusters across sites, while locally fitted clusters proved less transferable. FONT is particularly well-suited for real-world applications with stringent communication and privacy constraints, offering a scalable and practical solution for multi-site clustering.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信