A Formal Model for the Representation of Binary Temporal Relations in Healthcare Applications and an Efficient Algorithm for Logic-Based Temporal Subsumption Testing and Pattern Matching

Author:

Sujansky Walter,Campbell Keith E.

Abstract

AbstractObjectivesImportant temporal relationships exist among pairs of medically relevant events stored in electronic health records (EHRs), such as “the infection began within two weeks after surgery”. Queries for specific temporal patterns also appear in decision-support rules and data-analysis programs. The accurate matching of such patterns to the patient data in EHRs is critical to the effective performance of decision-support systems, statistical analysis programs, data-abstraction processes, digital phenotyping for machine-learning, and other applications. The correct classification of temporally-qualified concepts in biomedical terminologies and ontologies, such as SNOMED-CT, is also important to ensure the accuracy and completeness of these knowledge-based resources.MethodsIn this paper, we describe an expressive model to formally represent temporal relationships between pairs of events, including “Before”, “During”, “Withinndays after”, and “Withinnhours before ormhours after, but not during”. We also describe a novel logic-based algorithm to deduce whether one such relationship temporally matches (i.e., is subsumed by) another such relationship, which enables the querying of structured time-stamped patient data, the querying of semi-structured narrative patient data, and the classification of logically defined medical concepts. Our model assumes an interval-based notion of time and our algorithm implements a logic-based definition of subsumption.ResultsWe formally prove the correctness of the algorithm based on the properties of temporal intervals and the axioms of propositional logic. We also prove that the algorithm has computational complexity of constant-time (i.e., O(1)) with respect to the size of the database being queried or the knowledge base being classified.ConclusionThe novel model and algorithm described here for temporal representation and reasoning are sound and have the potential to facilitate temporal subsumption testing and pattern matching in a number of medical application domains. Empirical testing is needed to establish the full scope of useful applicability.

Publisher

Cold Spring Harbor Laboratory

Reference22 articles.

1. Maintaining knowledge about temporal intervals;Communications of the ACM,1983

2. Temporal constraint networks;Artif Intell,1991

3. Kautz H , Ladkin P. Integrating Metric and Qualitative Temporal Reasoning. Proc. 9th Nat. Conf. on Artificial Intelligence (1991), pp. 241–246

4. Meiri I , Combining qualitative and quantitative constraints in temporal reasoning, in: Proceedings AAAI-91, Anaheim CA (1991).

5. Vilain M , Kautz H. Constraint Propagation Algorithms for Temporal Reasoning. Proceedings of the AAAI Conference on Artificial Intelligence, Volume 5, 1986.

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3