高利用率医疗保健接触间到达时间的聚类

Chengliang Yang, C. Delcher, E. Shenkman, S. Ranka
{"title":"高利用率医疗保健接触间到达时间的聚类","authors":"Chengliang Yang, C. Delcher, E. Shenkman, S. Ranka","doi":"10.1109/HealthCom.2018.8531173","DOIUrl":null,"url":null,"abstract":"Patients with a large number of health care encounters receive great attention in health care research because their expensive and problematic health care utilization has important implications for the US health care system. The large volume of emergency department (ED) visits and inpatient hospital stays through time provides a unique opportunity to apply data-driven methods for identifying temporal signals associated with these patients. The micro variations in the inter-arrival time of these encounters within this population are not well-studied. Computational approaches for distinguishing various temporal visiting patterns leads to the problem of efficiently clustering asynchronous time series. Thus, we propose a Wasserstein distance based spectral clustering for this problem. Asynchronous time series are first represented as histograms of inter-arrival time and their pairwise similarities are computed under Wasserstein distance. Spectral clustering operates on the similarity matrix as input thereby avoiding the computational bottleneck of Wasserstein barycenters. The effectiveness of this method is demonstrated by synthetic data and application to a large real world health insurance encounters dataset, identifying potential associations between temporal visiting patterns and health factors from a population of frequent ED and inpatient hospital users.","PeriodicalId":232709,"journal":{"name":"2018 IEEE 20th International Conference on e-Health Networking, Applications and Services (Healthcom)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Clustering Inter-Arrival Time of Health Care Encounters for High Utilizers\",\"authors\":\"Chengliang Yang, C. Delcher, E. Shenkman, S. Ranka\",\"doi\":\"10.1109/HealthCom.2018.8531173\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Patients with a large number of health care encounters receive great attention in health care research because their expensive and problematic health care utilization has important implications for the US health care system. The large volume of emergency department (ED) visits and inpatient hospital stays through time provides a unique opportunity to apply data-driven methods for identifying temporal signals associated with these patients. The micro variations in the inter-arrival time of these encounters within this population are not well-studied. Computational approaches for distinguishing various temporal visiting patterns leads to the problem of efficiently clustering asynchronous time series. Thus, we propose a Wasserstein distance based spectral clustering for this problem. Asynchronous time series are first represented as histograms of inter-arrival time and their pairwise similarities are computed under Wasserstein distance. Spectral clustering operates on the similarity matrix as input thereby avoiding the computational bottleneck of Wasserstein barycenters. The effectiveness of this method is demonstrated by synthetic data and application to a large real world health insurance encounters dataset, identifying potential associations between temporal visiting patterns and health factors from a population of frequent ED and inpatient hospital users.\",\"PeriodicalId\":232709,\"journal\":{\"name\":\"2018 IEEE 20th International Conference on e-Health Networking, Applications and Services (Healthcom)\",\"volume\":\"19 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 IEEE 20th International Conference on e-Health Networking, Applications and Services (Healthcom)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/HealthCom.2018.8531173\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE 20th International Conference on e-Health Networking, Applications and Services (Healthcom)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/HealthCom.2018.8531173","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

大量就诊的患者在医疗保健研究中受到极大关注,因为他们昂贵且有问题的医疗保健利用对美国医疗保健系统具有重要意义。随着时间的推移,大量的急诊科(ED)就诊和住院患者提供了一个独特的机会,可以应用数据驱动的方法来识别与这些患者相关的时间信号。在这一群体中,这些相遇之间到达时间的微小变化尚未得到很好的研究。区分各种时间访问模式的计算方法导致了异步时间序列有效聚类的问题。因此,我们提出了一种基于Wasserstein距离的光谱聚类方法。首先将异步时间序列表示为到达间隔时间的直方图,并在Wasserstein距离下计算它们的成对相似度。谱聚类以相似矩阵作为输入,从而避免了Wasserstein质心的计算瓶颈。该方法的有效性通过综合数据和对大型现实世界健康保险遭遇数据集的应用得到了证明,从频繁急诊科和住院医院用户的人群中确定了时间访问模式和健康因素之间的潜在关联。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Clustering Inter-Arrival Time of Health Care Encounters for High Utilizers
Patients with a large number of health care encounters receive great attention in health care research because their expensive and problematic health care utilization has important implications for the US health care system. The large volume of emergency department (ED) visits and inpatient hospital stays through time provides a unique opportunity to apply data-driven methods for identifying temporal signals associated with these patients. The micro variations in the inter-arrival time of these encounters within this population are not well-studied. Computational approaches for distinguishing various temporal visiting patterns leads to the problem of efficiently clustering asynchronous time series. Thus, we propose a Wasserstein distance based spectral clustering for this problem. Asynchronous time series are first represented as histograms of inter-arrival time and their pairwise similarities are computed under Wasserstein distance. Spectral clustering operates on the similarity matrix as input thereby avoiding the computational bottleneck of Wasserstein barycenters. The effectiveness of this method is demonstrated by synthetic data and application to a large real world health insurance encounters dataset, identifying potential associations between temporal visiting patterns and health factors from a population of frequent ED and inpatient hospital users.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信