GRANDPA:使用度和属性增强的基因相关网络采样,应用于部分保密医疗网络的分析。

IF 1.3 Q3 COMPUTER SCIENCE, THEORY & METHODS
Applied Network Science Pub Date : 2023-01-01 Epub Date: 2023-05-11 DOI:10.1007/s41109-023-00548-5
Carly A Bobak, Yifan Zhao, Joshua J Levy, A James O'Malley
{"title":"GRANDPA:使用度和属性增强的基因相关网络采样,应用于部分保密医疗网络的分析。","authors":"Carly A Bobak, Yifan Zhao, Joshua J Levy, A James O'Malley","doi":"10.1007/s41109-023-00548-5","DOIUrl":null,"url":null,"abstract":"<p><p>Protecting medical privacy can create obstacles in the analysis and distribution of healthcare graphs and statistical inferences accompanying them. We pose a graph simulation model which generates networks using degree and property augmentation and provide a flexible R package that allows users to create graphs that preserve vertex attribute relationships and approximating the retention of topological properties observed in the original graph (e.g., community structure). We illustrate our proposed algorithm using a case study based on Zachary's karate network and a patient-sharing graph generated from Medicare claims data in 2019. In both cases, we find that community structure is preserved, and normalized root mean square error between cumulative distributions of the degrees across the generated and the original graphs is low (0.0508 and 0.0514 respectively).</p>","PeriodicalId":37010,"journal":{"name":"Applied Network Science","volume":null,"pages":null},"PeriodicalIF":1.3000,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10173245/pdf/","citationCount":"0","resultStr":"{\"title\":\"GRANDPA: GeneRAtive network sampling using degree and property augmentation applied to the analysis of partially confidential healthcare networks.\",\"authors\":\"Carly A Bobak, Yifan Zhao, Joshua J Levy, A James O'Malley\",\"doi\":\"10.1007/s41109-023-00548-5\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p><p>Protecting medical privacy can create obstacles in the analysis and distribution of healthcare graphs and statistical inferences accompanying them. We pose a graph simulation model which generates networks using degree and property augmentation and provide a flexible R package that allows users to create graphs that preserve vertex attribute relationships and approximating the retention of topological properties observed in the original graph (e.g., community structure). We illustrate our proposed algorithm using a case study based on Zachary's karate network and a patient-sharing graph generated from Medicare claims data in 2019. In both cases, we find that community structure is preserved, and normalized root mean square error between cumulative distributions of the degrees across the generated and the original graphs is low (0.0508 and 0.0514 respectively).</p>\",\"PeriodicalId\":37010,\"journal\":{\"name\":\"Applied Network Science\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":1.3000,\"publicationDate\":\"2023-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10173245/pdf/\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Applied Network Science\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/s41109-023-00548-5\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"2023/5/11 0:00:00\",\"PubModel\":\"Epub\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Applied Network Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/s41109-023-00548-5","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2023/5/11 0:00:00","PubModel":"Epub","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

摘要

保护医疗隐私会给医疗图表的分析和发布以及随之而来的统计推断造成障碍。我们提出了一个图仿真模型,该模型利用度和属性增强生成网络,并提供了一个灵活的 R 软件包,允许用户创建保留顶点属性关系的图,并近似保留原始图中观察到的拓扑属性(如群落结构)。我们使用基于 Zachary 空手道网络的案例研究和根据 2019 年医疗保险报销数据生成的患者共享图来说明我们提出的算法。在这两种情况下,我们都发现群落结构得到了保留,生成图和原始图的度数累积分布之间的归一化均方根误差很低(分别为 0.0508 和 0.0514)。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

GRANDPA: GeneRAtive network sampling using degree and property augmentation applied to the analysis of partially confidential healthcare networks.

GRANDPA: GeneRAtive network sampling using degree and property augmentation applied to the analysis of partially confidential healthcare networks.

GRANDPA: GeneRAtive network sampling using degree and property augmentation applied to the analysis of partially confidential healthcare networks.

GRANDPA: GeneRAtive network sampling using degree and property augmentation applied to the analysis of partially confidential healthcare networks.

Protecting medical privacy can create obstacles in the analysis and distribution of healthcare graphs and statistical inferences accompanying them. We pose a graph simulation model which generates networks using degree and property augmentation and provide a flexible R package that allows users to create graphs that preserve vertex attribute relationships and approximating the retention of topological properties observed in the original graph (e.g., community structure). We illustrate our proposed algorithm using a case study based on Zachary's karate network and a patient-sharing graph generated from Medicare claims data in 2019. In both cases, we find that community structure is preserved, and normalized root mean square error between cumulative distributions of the degrees across the generated and the original graphs is low (0.0508 and 0.0514 respectively).

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Applied Network Science
Applied Network Science Multidisciplinary-Multidisciplinary
CiteScore
4.60
自引率
4.50%
发文量
74
审稿时长
5 weeks
×
引用
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学术官方微信