# US 2015/0106115 A1 · Densification of longitudinal emr for improved phenotyping

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

- Number: US 2015/0106115 A1
- Document ID: US20150106115A1
- Status: Published application
- Kind: A1
- Application number: 14/050,870
- Filed: 2013-10-10
- Published: 2015-04-16
- Earliest claimed: 2013-10-10
- Assignees: International Business Machines Corporation
- Applicants: International Business Machines Corporation
- Inventors: Jianying Hu; Fei Wang; Jiayu Zhou
- Web page: https://patentgrep.com/patent/US20150106115A1

## CPC

- G16H 10/60: for patient-specific data, e.g. for electronic patient records
- G16H 50/70: for mining of medical data, e.g. analysing previous cases of other patients
- G16Z 99/00: Subject matter not provided for in other main groups of this subclass
- G16H: HEALTHCARE INFORMATICS, i.e. INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR THE HANDLING OR PROCESSING OF MEDICAL OR HEALTHCARE DATA
- G16Z: INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR SPECIFIC APPLICATION FIELDS, NOT OTHERWISE PROVIDED FOR

## Abstract

Systems and methods for data densification include representing patient data as a sparse patient matrix for each patient. The sparse patient matrix is decomposed into a plurality of matrices including a concept matrix indicating medical concepts of the patient data and an evolution matrix indicating a temporal relationship of the medical concepts. Missing information in the sparse patient matrix is imputed using a processor based on the plurality of matrices to provide a densified patient matrix.

## Claims

### Claim 1

A method for data densification, comprising:
representing patient data as a sparse patient matrix for each patient;
decomposing the sparse patient matrix into a plurality of matrices including a concept matrix indicating medical concepts of the patient data and an evolution matrix indicating a temporal relationship of the medical concepts; and
imputing missing information in the sparse patient matrix using a processor based on the plurality of matrices to provide a densified patient matrix.

### Claim 2 (depends on 1)

The method as recited in claim 1, wherein the missing information is represented by zeros in the sparse patient matrix.

### Claim 3 (depends on 1)

The method as recited in claim 1, wherein imputing missing information includes formulating an optimization problem based on a nature of a cohort of patients.

### Claim 4 (depends on 3)

The method as recited in claim 3, wherein imputing missing information includes learning an individual concept matrix for each patient where the cohort is heterogeneous.

### Claim 5 (depends on 3)

The method as recited in claim 3, wherein imputing missing information includes sharing the concept matrix among the cohort where the cohort is homogeneous.

### Claim 6 (depends on 3)

The method as recited in claim 3, further comprising solving the optimization problem to densify the plurality of matrices.

### Claim 7 (depends on 6)

The method as recited in claim 6, further comprising determining the densified patient matrix as a product of the plurality of matrices.

### Claim 8 (depends on 3)

The method as recited in claim 3, further comprising solving the optimization problem by block coordinate descent.

### Claim 9 (depends on 8)

The method as recited in claim 8, wherein a solution to the optimization problem includes a local minima having a lowest function value.

### Claim 10 (depends on 1)

The method as recited in claim 1, wherein decomposing and imputing are performed simultaneously.

### Claim 11

A computer readable storage medium comprising a computer readable program for data densification, wherein the computer readable program when executed on a computer causes the computer to perform the steps of:
representing patient data as a sparse patient matrix for each patient;
decomposing the sparse patient matrix into a plurality of matrices including a concept matrix indicating medical concepts of the patient data and an evolution matrix indicating a temporal relationship of the medical concepts; and
imputing missing information in the sparse patient matrix based on the plurality of matrices to provide a densified patient matrix.

### Claim 12

A system for data densification, comprising:
a matrix formation module configured to represent patient data as a sparse patient matrix for each patient;
a factorization module configured to decompose the sparse patient matrix into a plurality of matrices including a concept matrix indicating medical concepts of the patient data and an evolution matrix indicating a temporal relationship of the medical concepts; and
an imputation module configured to impute missing information in the sparse patient matrix using a processor based on the plurality of matrices to provide a densified patient matrix.

### Claim 13 (depends on 12)

The system as recited in claim 12, wherein the missing information is represented by zeros in the sparse patient matrix.

### Claim 14 (depends on 12)

The system as recited in claim 12, wherein the imputation module is further configured to formulate an optimization problem based on a nature of a cohort of patients.

### Claim 15 (depends on 14)

The system as recited in claim 14, wherein the imputation module is further configured to learn an individual concept matrix for each patient where the cohort is heterogeneous.

### Claim 16 (depends on 14)

The system as recited in claim 14, wherein the imputation module is further configured to share the concept matrix among the cohort where the cohort is homogeneous.

### Claim 17 (depends on 14)

The system as recited in claim 14, further comprising a solving module configured to solve the optimization problem to densify the plurality of matrices.

### Claim 18 (depends on 17)

The system as recited in claim 17, wherein the solving module is further configured to determine the densified patient matrix as a product of the plurality of matrices.

### Claim 19 (depends on 14)

The system as recited in claim 14, further comprising a solving module configured to solve the optimization problem by block coordinate descent.

### Claim 20 (depends on 19)

The system as recited in claim 19, wherein a solution to the optimization problem includes a local minima having a lowest function value.
