# US 2015/0106122 A1 · Method, server and recording medium for providing electronic patient information

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2015/0106122 A1
- Document ID: US20150106122A1
- Status: Published application
- Kind: A1
- Application number: 14/512,760
- Filed: 2014-10-13
- Published: 2015-04-16
- Earliest claimed: 2013-10-15
- Assignees: General Electric Company
- Applicants: General Electric Company
- Inventors: KyooHo Lee; Jahyoung Park; Marcelo Duarte Esperidiao
- Web page: https://patentgrep.com/patent/US20150106122A1

## CPC

- G16H 10/60: for patient-specific data, e.g. for electronic patient records
- G16H: HEALTHCARE INFORMATICS, i.e. INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR THE HANDLING OR PROCESSING OF MEDICAL OR HEALTHCARE DATA

## Abstract

A method of providing an event tree enabling institutive understanding of the creation of electronic patient information including or any changes in electronic patient information, a server for performing the same, and a recording medium for storing the same are provided. A method for providing electronic patient information includes receiving electronic patient information of a patient from at least one terminal, identifying one or more events from the received electronic patient information, and generating an event tree of the patient based on the identified events, wherein the event tree graphically represents the electronic patient information of the patient.

## Claims

### Claim 1

A method for providing electronic patient information, implemented at an electronic patient information server, comprising:
receiving electronic patient information of a patient from at least one terminal;
identifying one or more events from the received electronic patient information; and
generating an event tree of the patient based on the identified events,
wherein the event tree graphically represents the electronic patient information of the patient.

### Claim 2 (depends on 1)

The method of claim 1, further comprising:
matching the electronic patient information of the patient represented in the event tree of the patient with electronic patient information of another patient represented in an event tree of said another patient; and
merging the event tree of the patient and that of said another patient if a matching ratio exceeds a first threshold value, and transmitting the event tree of the patient and that of said another patient to at least one terminal if the matching ratio does not exceed the first threshold value but exceeds a third threshold value which is lower than the first threshold value.

### Claim 3 (depends on 2)

The method of claim 2, wherein, if the matching ratio exceeds the first threshold value but does not exceed a second threshold value which is greater than the first threshold value, the event tree of the patient and that of said another patient are merged at a node having a first symbol, the first symbol indicating that the electronic patient information of the patient and that of said another patient are matched in part.

### Claim 4 (depends on 2)

The method of claim 2, wherein, if the matching ratio exceeds a second threshold value which is greater than the first threshold value, the event tree of the patient and that of said another patient are merged at a node having a second symbol, the second symbol indicating that the electronic patient information of the patient and that of said another patient are identical.

### Claim 5 (depends on 2)

The method of claim 2, wherein, in the event of merging, one of the event trees of the patient and said another patient is graphically deactivated.

### Claim 6 (depends on 1)

The method of claim 1, further comprising: transmitting the generated event tree to a terminal when the electronic patient information server receives a request regarding the patient from the terminal.

### Claim 7 (depends on 1)

The method of claim 1,
wherein the electronic patient information includes one or more keys and at least one value corresponding to each of said one or more keys, each key representing an item of the electronic patient information, and
wherein said one or more events include a generation event which indicates a generation of a new key in the electronic patient information of the patient and an update event which indicates a change of a value in the electronic patient information of the patient.

### Claim 8 (depends on 7)

The method of claim 7 wherein the generation event is represented as a generation symbol and the update event is represented as an update symbol in the event tree.

### Claim 9 (depends on 8)

The method of claim 8, wherein the generation symbol is a circle and the update symbol is a quadrangle.

### Claim 10 (depends on 1)

The method of claim 1, wherein the event tree has a tree structure including one or more nodes, each of said identified events corresponds one of the nodes, the nodes in the event tree are arranged in the events' chronological order.

### Claim 11 (depends on 10)

The method of claim 10, wherein two neighboring nodes are spaced apart from each other on the event tree at a predetermined distance.

### Claim 12

An electronic patient information server for providing electronic patient information to at least one terminal, the electronic patient information server configured to perform steps of:
receiving electronic patient information of a patient from the at least one terminal;
identifying one or more events from the received electronic patient information; and
generating an event tree of the patient based on the identified events,
wherein the event tree graphically represents the electronic patient information of the patient.

### Claim 13 (depends on 12)

The electronic patient information server of claim 12,
wherein the electronic patient information server is configured to further perform steps of:
matching the electronic patient information of the patient represented in the event tree of the patient with electronic patient information of another patient represented in an event tree of said another patient; and
merging the event tree of the patient and that of said another patient if a matching ratio exceeds a first threshold value, and transmitting the event tree of the patient and that of said another patient to the at least one terminal if the matching ratio does not exceed the first threshold value but exceeds a third threshold value which is lower than the first threshold value.

### Claim 14 (depends on 13)

The electronic patient information server of claim 13,
wherein, if the matching ratio exceeds the first threshold value but does not exceed a second threshold value which is greater than the first threshold value, the event tree of the patient and that of said another patient are merged at a node having a first symbol, the first symbol indicating that the electronic patient information of the patient and that of said another patient are matched in part.

### Claim 15 (depends on 13)

The electronic patient information server of claim 13,
wherein, if the matching ratio exceeds a second threshold value which is greater than the first threshold value, the event tree of the patient and that of said another patient are merged at a node having a second symbol, the second symbol indicating that the electronic patient information of the patient and that of said another patient are identical.

### Claim 16 (depends on 13)

The electronic patient information server of claim 13, wherein, in the event of merging, one of the event trees of the patient and said another patient is graphically deactivated.

### Claim 17 (depends on 12)

The electronic patient information server of claim 12, wherein the electronic patient information server further performs a step of transmitting the generated event tree to a terminal when the electronic patient information server receives a request regarding the patient from the terminal.

### Claim 18 (depends on 12)

The electronic patient information server of claim 12, wherein the event tree has a tree structure including one or more nodes, each of said identified events corresponds one of the nodes, the nodes in the event tree are arranged in the events' chronological order, and wherein two neighboring nodes are spaced apart from each other on the event tree at a predetermined distance.

### Claim 19 (depends on 1)

A computer-readable storage medium storing a computer program which, when executed by a processor, causes the processor to perform the method according to claim 1.

### Claim 20 (depends on 2)

A computer-readable storage medium storing a computer program which, when executed by a processor, causes the processor to perform the method according to claim 2.
