Indexing of large scale patient set

• US 10,242,085 B2
• Filed: 03/03/2016
• Issued: 03/26/2019
• Est. Priority Date: 12/19/2012
• Status: Active Grant

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Wang, Fei, Wang, Jun
• Primary Examiner(s): Alam, Shahid A
• Assistant Examiner(s): Sultana, Nargis
• Application Number:
  US15/059,392
• Publication Number:
  US 20160188699A1
• Time in Patent Office: 1,118 Days
• Field of Search: 707741
• CPC Class Codes: G06F 16/13 File access structures, e.g. distributed indices arrangements of input from, or output to, record carriers G06F3/06
• CPC Class Codes: G06F 16/2228 Indexing structures
• CPC Class Codes: G06F 16/2246 Trees, e.g. B+trees
• CPC Class Codes: G06F 16/278 Data partitioning, e.g. horizontal or vertical partitioning
• CPC Class Codes: G06F 16/285 Clustering or classification
• CPC Class Codes: G06F 16/31 Indexing; Data structures therefor; Storage structures
• CPC Class Codes: G06F 16/316 Indexing structures
• CPC Class Codes: G16H 10/60 for patient-specific data, e.g. for electronic patient records
• CPC Class Codes: G16H 50/70 for mining of medical data, e.g. analysing previous cases of other patients

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

1. A non-transitory computer readable storage medium comprising a computer readable program for indexing data, wherein the computer readable program when executed on a computer causes the computer to perform the steps of:

formulating an objective function to index a dataset, a portion of the dataset including supervision information;

determining a data property component and a supervised component for grouping data of the dataset, the determining the data property component including maximizing a variance of the dataset by applying a principal component analysis (PCA) and maximum variance unfolding (MVU), the MVU comprising forming an inner product of a data matrix and a learned partition hyperplane and maximizing overall pairwise distances in a projected space to reduce computational costs during the indexing, and the PCA comprising determining an eigenvector from a data covariance matrix with a largest corresponding eigenvector; and

optimizing, using a processor, the objective function based upon the data property component and the supervised component to partition a node into a plurality of child nodes.

2. A system for indexing data, comprising:

a processor operatively coupled to a memory, the processor being configured to;

formulate an objective function to index a dataset stored on a computer readable storage medium, a portion of the dataset including supervision information;

determine a data property component and a supervision module configured to determine a supervised component of the objective function for grouping data of the dataset, the data property component being determined by maximizing a variance of the dataset by applying a principal component analysis (PCA) and maximum variance unfolding (MVU), MVU comprising forming an inner product of a data matrix and a learned partition hyperplane and maximizing overall pairwise distances in a projected space to reduce computational costs during the indexing, and the PCA comprising determining an eigenvector from a data covariance matrix with a largest corresponding eigenvector; and

optimize the objective function based upon the data property component and the supervised component to partition a node into a plurality of child nodes.

3. The system as recited in claim 2, wherein the processor is further configured to recursively optimize the objective function at each node to provide a binary space partitioning tree.

4. The system as recited in claim 2, wherein the processor is further configured to cluster data around a median of the dataset.

5. The system as recited in claim 2, wherein the processor is further configured to minimize pairwise distance of similar data identified by the supervision information and maximize pairwise distance of dissimilar data identified by the supervision information.

6. The system as recited in claim 2, wherein the processor is further configured to apply the dataset as a linear prediction function.

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

8. The system as recited in claim 2, 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.