GASP: Graph-based Approximate Sequential Pattern Mining for Electronic Health Records.

GASP: Graph-based Approximate Sequential Pattern Mining for Electronic Health Records.
复制标题

DOI:
10.1007/978-3-030-85082-1_5
复制
发表时间:
2021-08
期刊:
Advances in databases and information systems. ADBIS
影响因子:
--
通讯作者:
Ho JC
Ho JC
中科院分区:
其他
文献类型:
--
作者:
Dong W;Lee EW;Hertzberg VS;Simpson RL;Ho JC

文献摘要

参考文献

相似文献

序列模式挖掘可用于从电子健康记录中提取有意义的序列。然而,发现所有频繁序列模式的传统序列模式挖掘算法可能会产生高计算量,并且容易受到观测中噪声的影响。为了解决这些缺点,引入了近似序列模式挖掘技术,但现有的近似方法无法反映真实的频繁序列模式或仅针对单项事件序列。多项目事件序列在医疗保健中很突出,因为患者一次就诊可以接受多种干预措施。为了缓解这些问题,我们提出了 GASP,一种基于图的近似序列模式挖掘,可以发现多项目事件序列的频繁模式。我们的方法将顺序信息压缩成简洁的图结构,这具有计算优势。两个医疗数据集的实证结果表明,GASP 通过提高可恢复性并提取更好的预测模式,优于现有的近似模型。
Sequential pattern mining can be used to extract meaningful sequences from electronic health records. However, conventional sequential pattern mining algorithms that discover all frequent sequential patterns can incur a high computational and be susceptible to noise in the observations. Approximate sequential pattern mining techniques have been introduced to address these shortcomings yet, existing approximate methods fail to reflect the true frequent sequential patterns or only target single-item event sequences. Multi-item event sequences are prominent in healthcare as a patient can have multiple interventions for a single visit. To alleviate these issues, we propose GASP, a graph-based approximate sequential pattern mining, that discovers frequent patterns for multi-item event sequences. Our approach compresses the sequential information into a concise graph structure which has computational benefits. The empirical results on two healthcare datasets suggest that GASP outperforms existing approximate models by improving recoverability and extracts better predictive patterns.
DOI: 10.1097/00005650-199706000-00005
发表时间: 1997-06-01
期刊: MEDICAL CARE
影响因子: 3
作者:
Geraci, JM;Ashton, CM;Wu, L
通讯作者: Wu, L
DOI: 10.1177/0165551505055405
发表时间: 2005-01-01
影响因子: 2.4
作者:
Chang, JH;Lee, WS
通讯作者: Lee, WS