Adaptive clustering of records and entity representations
First Claim
1. A computer implemented iterative process for generating entity representations by identifying and linking related records in a computer implemented database using a record matching formula, each record and entity representation electronically stored in the database, each record comprising a plurality of fields, each field configured to contain a field value, the process comprising:
- assigning to each pair of records from a plurality of records in the database a match value using the record matching formula, wherein the record matching formula is of the form
2 Assignments
0 Petitions
Accused Products
Abstract
Disclosed is a system for, and method of, determining whether records and entity representations should be linked. The system and method include assigning to each pair of entity references a match value reflecting the likelihood that the entity references are related. Based on the match values, each entity reference may then associated with a preferred entity reference. Pairs of entity references that are mutually preferred may then be identified and linked. The process may be iterated to generate further links.
165 Citations
14 Claims
-
1. A computer implemented iterative process for generating entity representations by identifying and linking related records in a computer implemented database using a record matching formula, each record and entity representation electronically stored in the database, each record comprising a plurality of fields, each field configured to contain a field value, the process comprising:
assigning to each pair of records from a plurality of records in the database a match value using the record matching formula, wherein the record matching formula is of the form - View Dependent Claims (2, 3, 4, 5, 6)
-
7. A computer implemented iterative process for generating entity representations by identifying and linking related records in a computer implemented database using a record matching formula, each record and entity representation electronically stored in the database, each record comprising a plurality of fields, each field configured to contain a field value, the process comprising:
determining a symmetric mutually preferred pair of records consisting of a first record and a second record, each comprising at least a one-way relationship with each other, and wherein a match score of the first record and the second record as computed using the record matching formula is at least as great as a match score of the first record and any other record in the database, and wherein the match score of the first record and the second record as computed using the record matching formula is at least as great as a match score for the second record and any other record in the database, wherein the record matching formula is of the form
-
8. A computer system for iteratively generating entity representations in a computer implemented database using a record matching formula, the database comprising a plurality of records, each record comprising a plurality of fields, each field configured to contain a field value, the system comprising:
-
a computer implemented database comprising a plurality of records, each record comprising a plurality of fields, each field configured to contain a field value; a processor programmed to assign to each pair of records from a plurality of records in the database a match value using a the record matching formula, wherein the record matching formula is of the form - View Dependent Claims (9, 10, 11, 12, 13)
-
-
14. A computer system for iteratively generating entity representations by identifying and linking related records in a computer implemented database using a record matching formula, each record and entity representation electronically stored in the database, each record comprising a plurality of fields, each field configured to contain a field value, the system comprising:
-
a computer implemented database comprising a plurality of records, each record comprising a plurality of fields, each field configured to contain a field value; a processor programmed to determine a symmetric mutually preferred pair of records consisting of a first record and a second record, wherein a match score of the first record and the second record as computed using the record matching formula is at least as great as a match score of the first record and any other record in the database, and wherein the match score of the first record and the second record as computed using the record matching formula is at least as great as a match score for the second record and any other record in the database, wherein the record matching formula is of the form
-
Specification