Modeling electronic discharge summaries as a simple temporal constraint satisfaction problem

被引:17
作者
Hripcsak, G
Zhou, L
Parsons, S
Das, AK
Johnson, SB
机构
[1] Columbia Univ, Dept Med Informat, New York, NY 10032 USA
[2] CUNY Brooklyn Coll, Dept Comp & Informat Sci, Brooklyn, NY 11210 USA
[3] Columbia Univ, Dept Psychiat, New York, NY USA
关键词
D O I
10.1197/jamia.M1623
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Objective: To model the temporal information contained in medical narrative reports as a simple temporal constraint satisfaction problem. Design: A constraint satisfaction problem is defined by time points and constraints (inequalities between points). A time interval comprises a pair of points and a constraint. Five complete electronic discharge summaries and paragraphs from 226 other discharge summaries were studied. Medical events were represented as intervals, and assertions about events were represented as constraints. Through a consensus process, a set of encoding procedures and a list of issues related to encoding were generated. Measurements: Instances of temporal disjunction and contradiction and distribution of temporal constraints were used. Results: An average of 95 medical events (range, 46-151) and 234 temporal assertions (range, 118-388) were identified per complete discharge summary. Nondefinitional assertions were explicit (36%) or implicit (64%) and absolute (17%), qualitative (72%), or metric (11%). Implicit assertions were based on domain knowledge and assumptions, e.g., the section of the report determined the ordering of events. Issues included linking events, intermittence, periodicity, granularity, vagueness, ambiguity, uncertainty, and plans. Abstractions such as intermittence were not represented explicitly. The temporal network was sparse: Only 0.80% (range, 0.42%-1.38%) of possible constraints were instantiated. No instances of discontinuous temporal disjunction were found in the complete summaries or the 226 paragraphs. One instance of temporal contradiction was found (intrareport rate of 0.2 with a 95% confidence interval of 0.005-1.114). Conclusion: A simple temporal constraint satisfaction problem appears sufficient to represent most temporal assertions in discharge summaries and may be useful for encoding electronic medical records.
引用
收藏
页码:55 / 63
页数:9
相关论文
共 50 条
  • [31] The complexity of the counting constraint satisfaction problem
    Bulatov, Andrei A.
    AUTOMATA, LANGUAGES AND PROGRAMMING, PT 1, PROCEEDINGS, 2008, 5125 : 646 - 661
  • [32] Accuracy of medication documentation in hospital discharge summaries: A retrospective analysis of medication transcription errors in manual and electronic discharge summaries
    Callen, Joanne
    McIntosh, Jean
    Li, Julie
    INTERNATIONAL JOURNAL OF MEDICAL INFORMATICS, 2010, 79 (01) : 58 - 64
  • [33] No-Rainbow Problem and the Surjective Constraint Satisfaction Problem
    Zhuk, Dmitriy
    2021 36TH ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS), 2021,
  • [34] The evaluation of a temporal reasoning system in processing clinical discharge summaries
    Zhou, Li
    Parsons, Simon
    Hripcsak, Georce
    JOURNAL OF THE AMERICAN MEDICAL INFORMATICS ASSOCIATION, 2008, 15 (01) : 99 - 106
  • [35] STCSP - structured temporal constraint satisfaction problems
    Balaban, M
    Rosen, T
    ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE, 1999, 25 (1-2) : 35 - 67
  • [36] A simple algorithm for identifying negated findings and diseases in discharge summaries
    Chapman, WW
    Bridewell, W
    Hanbury, P
    Cooper, GF
    Buchanan, BG
    JOURNAL OF BIOMEDICAL INFORMATICS, 2001, 34 (05) : 301 - 310
  • [37] On the Descriptive Complexity of Temporal Constraint Satisfaction Problems
    Bodirsky, Manuel
    Rydval, Jakub
    JOURNAL OF THE ACM, 2023, 70 (01)
  • [38] TEMPORAL CONSTRAINT SATISFACTION ON CAUSAL-MODELS
    CONSOLE, L
    TORASSO, P
    INFORMATION SCIENCES, 1993, 68 (1-2) : 1 - 32
  • [39] On finding a solution in temporal constraint satisfaction problems
    Gerevini, A
    Cristani, M
    IJCAI-97 - PROCEEDINGS OF THE FIFTEENTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, VOLS 1 AND 2, 1997, : 1460 - 1465
  • [40] STCSP — structured temporal constraint satisfaction problems
    Mira Balaban
    Tzachi Rosen
    Annals of Mathematics and Artificial Intelligence, 1999, 25 : 35 - 67