Internal linking co-convergence using clustering with hierarchy

• US 9,836,524 B2
• Filed: 06/03/2016
• Issued: 12/05/2017
• Est. Priority Date: 04/24/2008
• Status: Active Grant

• Current Assignee: LexisNexis Risk Solutions, Inc. (RELX PLC)
• Original Assignee: LexisNexis Risk Solutions, Inc. (RELX PLC)
• Inventors: Bayliss, David Alan
• Primary Examiner(s): LEROUX, ETIENNE PIERRE
• Application Number:
  US15/172,969
• Publication Number:
  US 20160283575A1
• Time in Patent Office: 550 Days
• CPC Class Codes: G06F 16/215 Improving data quality; Data cleansing, e.g. de-duplication, removing invalid entries or correcting typographical errors
• CPC Class Codes: G06F 16/2246 Trees, e.g. B+trees
• CPC Class Codes: G06F 16/24 Querying
• CPC Class Codes: G06F 16/245 Query processing
• CPC Class Codes: G06F 16/2455 Query execution
• CPC Class Codes: G06F 16/282 Hierarchical databases, e.g. IMS, LDAP data stores or Lotus Notes
• CPC Class Codes: G06F 16/285 Clustering or classification
• CPC Class Codes: G06F 16/35 Clustering; Classification
• CPC Class Codes: G06F 16/951 Indexing; Web crawling techniques

Abstract

Certain implementations of the disclosed technology include systems and methods for internal co-convergence using clustering when there is hierarchy in the data structure. A method is included for clustering hierarchical database records into a first set of clusters having corresponding first cluster identifications (IDs), each hierarchical database record including one or more field values, the clustering based at least in part on determining similarity among corresponding field values of the hierarchical database records. The method includes receiving parent-child hierarchical relationship information for the hierarchical database records, re-clustering at least a portion of the hierarchical database records into a second set of clusters having corresponding second cluster IDs, the re-clustering based at least in part on the received parent-child hierarchical relationship information, and outputting hierarchical database record information, based at least in part on the re-clustering.

Claims

1. A computer-implemented method comprising:

clustering hierarchical database records into a first set of clusters having corresponding first cluster identifications (IDs), wherein each hierarchical database record corresponds to an entity representation, each hierarchical database record comprising a plurality of fields, each field configured to contain a field value, and each field value assigned a field value weight corresponding to a specificity of the field value in relation to all field values in a corresponding field of the hierarchical database records, the clustering based at least in part on determining similarity among corresponding field values of the hierarchical database records;

determining parent-child hierarchical relationships among the hierarchical database records;

associating related hierarchical database records by applying a hierarchal directional linking process, the hierarchal directional linking process comprising selecting and applying at least an upward process based on the determined parent-child hierarchical relationship wherein the upward process comprises;

determining, from the parent-child hierarchical relationships, similarity among a plurality of child records having initial separate parent records;

in response to determining a threshold similarity among the plurality of child records, inferring that the initial separate parent records correspond to the same entity; and

linking, responsive to the inferring, the initial separate parent records as inferred common parent records; and

outputting database record information, based at least in part on associating the related hierarchical database records.

2. The method of claim 1, wherein the hierarchal directional linking process further comprises selecting and applying a downward process comprising linking two or more records on a given hierarchy level based at least in part on the two records sharing the inferred common parent records.

3. The method of claim 1, wherein determining the similarity among the corresponding field values of the database records comprises:

assigning a hyperspace attribute to each database record, wherein the hyperspace attribute corresponding to two database records is correlated with a similarity of the corresponding field values of the two database records;

determining membership of each database record in a plurality of hyperspace clusters based at least in part on the hyperspace attributes;

assigning, to each record, a cluster ID and a match value reflecting a likelihood that the record is a member of a particular hyperspace cluster; and

linking related records based at least in part on the cluster ID and the match value.

4. The method of claim 3, further comprising:

merging database records having hyperspace attribute differences within a predefined criteria to eliminate similar exemplars that are likely to represent a same entity, the merging resulting in a reduced set of database records;

recalculating the field value weights for the reduced set of database records; and

re-clustering the reduced set of records based at least in part on the recalculated field value weights.

5. The method of claim 3, wherein the determining membership of each database record in the plurality of hyperspace clusters further comprises creating a plurality of nodes at random locations in hyperspace, each node maintaining records in hyperspace based on the hyperspace attribute for which it is the closest node.

6. The method of claim 1, further comprising:

re-clustering at least a portion of the database records into a second set of clusters having corresponding second cluster IDs, the re-clustering based at least in part on the associating related hierarchical database records and on the determining similarity among corresponding field values of the database records; and

outputting database record information, based at least in part on the re-clustering.

7. The method of claim 1, wherein the associating related hierarchical database records further comprises:

determining highest compelling linkages among the hierarchical database records, the determining comprising;

identifying mutually preferred pairs of records from the hierarchical database records, each mutually preferred pair of records consisting of a first record and a second record, the first record consisting of a preferred record associated with the second record and the second record consisting of a preferred record associated with the first record, wherein the mutually preferred pairs of records each has a match score that meets pre-specified match criteria;

assigning, for each record from the hierarchical database records, at least one associated preferred record, wherein a match value assigned to a given record together with its associated preferred record is at least as great as a match value assigned to the record together with any other record in the database records; and

forming and storing a plurality of entity representations in the database, each entity representation of the plurality of entity representations comprising at least one linked pair of mutually preferred records.

8. A computer-implemented method comprising:

clustering hierarchical database records into a first set of clusters having corresponding first cluster identifications (IDs), wherein each hierarchical database record corresponds to an entity representation, each hierarchical database record comprising a plurality of fields, each field configured to contain a field value, and each field value assigned a field value weight corresponding to a specificity of the field value in relation to all field values in a corresponding field of the hierarchical database records, the clustering based at least in part on determining similarity among corresponding field values of the hierarchical database records;

determining highest compelling linkages among the hierarchical database records to identify at least one linked pair of mutually preferred records; and

outputting database record information, based at least in part determining highest compelling linkages among the hierarchical database records.

9. The method of claim 8, wherein determining the similarity among the corresponding field values of the hierarchical database records comprises:

assigning a hyperspace attribute to each hierarchical database record, wherein the hyperspace attribute corresponding to two hierarchical database records is correlated with a similarity of the corresponding field values of the two hierarchical database records;

determining membership of each hierarchical database record in a plurality of hyperspace clusters based at least in part on the hyperspace attributes;

assigning, to each record, a cluster ID and a match value reflecting a likelihood that the record is a member of a particular hyperspace cluster; and

linking related records based at least in part on the cluster ID and the match value.

10. The method of claim 9, further comprising merging hierarchical database records having hyperspace attribute differences within a predefined criteria to eliminate similar exemplars that are likely to represent a same entity, the merging resulting in a reduced set of hierarchical database records.

11. The method of claim 10, further comprising:

recalculating the field value weights for the reduced set of hierarchical database records; and

re-clustering the reduced set of records based at least in part on the recalculated field value weights.

12. The method of claim 8, wherein determining highest compelling linkages among the hierarchical database records further comprises:

identifying mutually preferred pairs of records from the hierarchical database records, each mutually preferred pair of records consisting of a first record and a second record, the first record consisting of a preferred record associated with the second record and the second record consisting of a preferred record associated with the first record, wherein the mutually preferred pairs of records each has a match score that meets pre-specified match criteria;

assigning, for each record from the database records, at least one associated preferred record, wherein a match value assigned to a given record together with its associated preferred record is at least as great as a match value assigned to the record together with any other record in the hierarchical database records; and

forming and storing a plurality of entity representations in the database, each entity representation of the plurality of entity representations comprising at least one linked pair of mutually preferred records.

13. The method of claim 8, further comprising:

receiving parent-child hierarchical relationship information for the hierarchical database records;

re-clustering at least a portion of the hierarchical database records into a second set of clusters having corresponding second cluster IDs, the re-clustering based at least in part on the received parent-child hierarchical relationship information; and

outputting hierarchical database record information, based at least in part on the re-clustering.

14. A system comprising:

at least one memory for storing data and computer-executable instructions; and

at least one processor configured to access the at least one memory and further configured to execute the computer-executable instructions for;

clustering hierarchical database records into a first set of clusters having corresponding first cluster identifications (IDs), wherein each hierarchical database record corresponds to an entity representation, each hierarchical database record comprising a plurality of fields, each field configured to contain a field value, and each field value assigned a field value weight corresponding to a specificity of the field value in relation to all field values in a corresponding field of the hierarchical database records, the clustering based at least in part on determining similarity among corresponding field values of the hierarchical database records;

when a hierarchy structure of the hierarchical database records is unavailable;

determining parent-child hierarchical relationships among the hierarchical database records;

associating related hierarchical database records by applying a hierarchal directional linking process, the hierarchal directional linking process comprising selecting and applying at least an upward process based on the determined parent-child hierarchical relationship wherein the upward process comprises;

determining, from the parent-child hierarchical relationships, similarity among a plurality of child records having initial separate parent records;

in response to determining a threshold similarity among that the plurality of child records, inferring that the initial separate parent records correspond to the same entity; and

linking, responsive to the inferring, the initial separate parent records as inferred common parent records; and

when a hierarchy structure of the hierarchical database records is available;

receiving parent-child hierarchical relationship information for the hierarchical database records; and

outputting hierarchical database record information, based at least in part on one or more of associating the related hierarchical database records and receiving the parent-child hierarchical relationship information.

15. The system of claim 14, further comprising:

when a hierarchy structure of the hierarchical database records is unavailable;

re-clustering at least a portion of the hierarchical database records into a second set of clusters having corresponding second cluster IDs, the re-clustering based at least in part on the associating related hierarchical database records and on the determining similarity among corresponding field values of the database records; and

when a hierarchy structure of the hierarchical database records is available;

re-clustering at least a portion of the hierarchical database records into a second set of clusters having corresponding second cluster IDs, the re-clustering based at least in part on the received parent-child hierarchical relationship information; and

outputting hierarchical database record information, based at least in part on the re-clustering.

16. The system of claim 14, wherein determining the similarity among the corresponding field values of the hierarchal database records comprises:

assigning a hyperspace attribute to each hierarchal database record, wherein the hyperspace attribute corresponding to two hierarchal database records is correlated with a similarity of the corresponding field values of the two hierarchal database records;

determining membership of each hierarchal database record in a plurality of hyperspace clusters based at least in part on the hyperspace attributes;

assigning, to each record, a cluster ID and a match value reflecting a likelihood that the record is a member of a particular hyperspace cluster; and

linking related records based at least in part on the cluster ID and the match value.

17. The system of claim 14, further comprising merging hierarchal database records having hyperspace attribute differences within a predefined criteria to eliminate similar exemplars that are likely to represent a same entity, the merging resulting in a reduced set of hierarchal database records.

18. The system of claim 17, further comprising:

recalculating the field value weights for the reduced set of hierarchal database records; and

re-clustering the reduced set of records based at least in part on the recalculated field value weights.

19. The system of claim 16, wherein the determining membership of each database record in the plurality of hyperspace clusters further comprises creating a plurality of nodes at random locations in hyperspace, each node maintaining records in hyperspace based on the hyperspace attribute for which it is the closest node.

20. The system of claim 14, wherein the associating related hierarchical database records further comprises:

determining highest compelling linkages among the hierarchical database records, the determining comprising;

identifying mutually preferred pairs of records from the hierarchical database records, each mutually preferred pair of records consisting of a first record and a second record, the first record consisting of a preferred record associated with the second record and the second record consisting of a preferred record associated with the first record, wherein the mutually preferred pairs of records each has a match score that meets pre-specified match criteria;

assigning, for each record from the hierarchical database records, at least one associated preferred record, wherein a match value assigned to a given record together with its associated preferred record is at least as great as a match value assigned to the record together with any other record in the hierarchical database records; and

forming and storing a plurality of entity representations in the database, each entity representation of the plurality of entity representations comprising at least one linked pair of mutually preferred records.