# US 2019/0317951 A1 · Indexing of large scale patient set

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

- Number: US 2019/0317951 A1
- Document ID: US20190317951A1
- Status: Published application
- Kind: A1
- Application number: 16/453,165
- Filed: 2019-06-26
- Published: 2019-10-17
- Earliest claimed: 2012-12-19
- Assignees: International Business Machines Corporation
- Applicants: International Business Machines Corporation
- Inventors: FEI WANG; JUN WANG
- Web page: https://patentgrep.com/patent/US20190317951A1

## CPC

- G06F 16/285: {Clustering or classification}
- G06F 16/13: File access structures, e.g. distributed indices (arrangements of input from, or output to, record carriers G06F3/06)
- G06F 16/2228: {Indexing structures}
- G06F 16/2246: {Trees, e.g. B+trees}
- G06F 16/278: {Data partitioning, e.g. horizontal or vertical partitioning}
- 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
- G06F 16/31: Indexing; Data structures therefor; Storage structures
- G06F 16/316: {Indexing structures}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- G16H: HEALTHCARE INFORMATICS, i.e. INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR THE HANDLING OR PROCESSING OF MEDICAL OR HEALTHCARE DATA

## Abstract

Systems and methods for indexing data include formulating an objective function to index a dataset, a portion of the dataset including supervision information. A data property component of the objective function is determined, which utilizes a property of the dataset to group data of the dataset. A supervised component of the objective function is determined, which utilizes the supervision information to group data of the dataset. The objective function is optimized using a processor based upon the data property component and the supervised component to partition a node into a plurality of child nodes.

## Claims

### Claim 1

A method for indexing data, comprising:
determining a data property component of an objective function indexing a dataset, the data property component configured to utilize a property of the dataset for grouping data of the dataset, and for maximizing a variance of the dataset to reduce computational costs during the indexing;
determining a supervised component of the objective function which utilizes supervision information from the dataset to group data of the dataset; and
optimizing the objective function using a processor based upon the data property component and the supervised component to partition a node into a plurality of child nodes.

### Claim 2 (depends on 1)

The method as recited in claim 1, wherein the optimizing the objective function includes recursively optimizing the objective function at each node to provide a binary space partitioning tree.

### Claim 3 (depends on 1)

The method as recited in claim 1, wherein the maximizing a variance of the dataset comprises applying at least one of a principal component analysis (PCA) and maximum variance unfolding (MVU).

### Claim 4 (depends on 3)

The method as recited in claim 3, wherein the maximizing the variance includes applying both the principal component analysis and the maximum variance unfolding.

### Claim 5 (depends on 1)

The method as recited in claim 1, wherein the determining the data property component includes clustering data around a median of the dataset.

### Claim 6 (depends on 1)

The method as recited in claim 1, wherein the determining the supervised component includes minimizing pairwise distance of similar data identified by the supervision information and maximizing pairwise distance of dissimilar data identified by the supervision information.

### Claim 7 (depends on 1)

The method as recited in claim 1, wherein the determining the supervised component includes applying the dataset as a linear prediction function.

### Claim 8 (depends on 1)

The method as recited in claim 1, wherein the objective function includes a tradeoff parameter to balance contributions from the data property component and the supervision component.

### Claim 9 (depends on 1)

The method as recited in claim 1, wherein the supervision information includes must-links indicating pairs of data that are similar to each other and cannot-links indicating pairs of data that are dissimilar to each other.

### Claim 10 (depends on 1)

The method as recited in claim 1, wherein the dataset includes patient medical information.

### Claim 11 (depends on 1)

The method as recited in claim 1, wherein the objective function includes a tradeoff parameter to balance contributions from the data property component and the supervision component.

### Claim 12 (depends on 1)

The method as recited in claim 1, wherein the determining the data property component includes applying the maximum variance unfolding by forming a projection as an inner product of a data matrix and a learned partition hyperplane and maximizing overall pairwise distances in a projected space.

### Claim 13 (depends on 1)

The method as recited in claim 1, wherein the determining the data property component includes applying the maximum variance unfolding such that a binary partition produces a balanced tree.

### Claim 14 (depends on 13)

The method as recited in claim 13, wherein applying the maximum variance unfolding comprises finding directions under which a projected data variance is maximized such that the binary partition of the directions increases a likelihood of producing the balanced tree.

### Claim 15

A method for indexing data, comprising:
formulating an objective function to index a dataset, a portion of the dataset including supervision information;
determining a data property component of the objective function which utilizes a property of the dataset to group data of the dataset, the determining including maximizing a variance of the dataset by applying at least one of a principal component analysis (PCA) and maximum variance unfolding (MVU) to reduce computational costs during the indexing;
determining a supervised component of the objective function which utilizes the supervision information to group data of the dataset; and
optimizing the objective function using a processor based upon the data property component and the supervised component to partition a node into a plurality of child nodes.

### Claim 16 (depends on 15)

The method as recited in claim 15, wherein the optimizing the objective function includes recursively optimizing the objective function at each node to provide a binary space partitioning tree.

### Claim 17 (depends on 15)

The method as recited in claim 15, wherein the supervision information includes must-links indicating pairs of data that are similar to each other and cannot-links indicating pairs of data that are dissimilar to each other.

### Claim 18

A method for indexing data, comprising:
determining a data property component of an objective function indexing a dataset, the data property component configured to utilize a property of the dataset to group data of the dataset, the determining including maximizing a variance of the dataset by applying at least one of a principal component analysis (PCA) and maximum variance unfolding (MVU) to reduce computational costs during the indexing;
determining a supervised component of the objective function which utilizes supervision information to group data of the dataset; and
optimizing the objective function using a processor based upon the data property component and the supervised component to partition a node into a plurality of child nodes.

### Claim 19 (depends on 18)

The method as recited in claim 18, wherein the optimizing the objective function includes recursively optimizing the objective function at each node to provide a binary space partitioning tree.

### Claim 20 (depends on 18)

The method as recited in claim 18, wherein the supervision information includes must-links indicating pairs of data that are similar to each other and cannot-links indicating pairs of data that are dissimilar to each other.
