LexisNexis Risk & Information Analytics Group Inc. Patent applications |
Patent application number | Title | Published |
20120290585 | AUTOMATED DETECTION OF NULL FIELD VALUES AND EFFECTIVELY NULL FIELD VALUES - Disclosed are systems for, and methods of, automatically detecting and treating field values of a particular field as null field values in records of a database. The system and method provide automatic treatment of these field values as null field values by calculating a critical frequency for the field. Based on the critical frequency of the field, the system and method treats field values that occur more than the critical frequency of the field as null field values and treats field values that occur less than the critical frequency as non-null field values. | 11-15-2012 |
20120284260 | STATISTICAL MEASURE AND CALIBRATION OF INTERNALLY INCONSISTENT SEARCH CRITERIA WHERE ONE OR BOTH OF THE SEARCH CRITERIA AND DATABASE IS INCOMPLETE - Disclosed is a system for, and method of, searching for and identifying an entity representation. Some embodiments permit search criteria that are internally inconsistent. Such internally inconsistent criteria may include, for example, a maiden last name and a married last name. Certain embodiments account for such criteria in an intelligent manner and identify matching entity representations with a known confidence level of accuracy. | 11-08-2012 |
20120278340 | DATABASE SYSTEMS AND METHODS FOR LINKING RECORDS AND ENTITY REPRESENTATIONS WITH SUFFICIENTLY HIGH CONFIDENCE - Disclosed are a system for, and method of, determining whether records correspond to the same individual. The system and method provide such a determination with a known minimum level of confidence. That is, the system and method provide an indication that records correspond to the same individual along with an associated confidence level. The system and method may be used to link records in a database that correspond to the same individuals, creating entity representations in the database. | 11-01-2012 |
20120173548 | STATISTICAL RECORD LINKAGE CALIBRATION FOR REFLEXIVE, SYMMETRIC AND TRANSITIVE DISTANCE MEASURES AT THE FIELD AND FIELD VALUE LEVELS WITHOUT THE NEED FOR HUMAN INTERACTION - Disclosed is a system for, and method of, calculating parameters used to determine whether records and entity representations should be linked. The system and method use a symmetric, transitive and reflexive function to allow for linking records and entity representations whose field values differ. The system and method apply iterative techniques such that parameters from each linking iteration are used in the next linking iteration. The system and method need no human interaction in order to calibrate and utilize record matching formulas used for the linking decisions. | 07-05-2012 |
20120173546 | AUTOMATED CALIBRATION OF NEGATIVE FIELD WEIGHTING WITHOUT THE NEED FOR HUMAN INTERACTION - Disclosed is a system for, and method of, calculating parameters used to determine whether records and entity representations should be linked. Such parameters may be set as negative to account for fields that do not match. The system and method apply iterative techniques such that parameters from each linking iteration are used in the next linking iteration. The system and method need no human interaction in order to calibrate and utilize record matching formulas used for the linking decisions. | 07-05-2012 |
20120173545 | STATISTICAL RECORD LINKAGE CALIBRATION FOR MULTI TOKEN FIELDS WITHOUT THE NEED FOR HUMAN INTERACTION - Disclosed is a system for, and method of, calculating parameters used to determine whether records and entity representations should be linked. The system and method utilize blended field weights to account for certain types of partial matches. The system and method apply iterative techniques such that parameters from each linking iteration are used in the next linking iteration. The system and method need no human interaction in order to calibrate and utilize record matching formulas used for the linking decisions. | 07-05-2012 |
20120072417 | STATISTICAL MEASURE AND CALIBRATION OF SEARCH CRITERIA WHERE ONE OR BOTH OF THE SEARCH CRITERIA AND DATABASE IS INCOMPLETE - Disclosed is a system for, and method of, identifying an entity representation. In some embodiments, search criteria are used to identify an entity representation in a universal database, and this identification is then used to identify a corresponding entity representation in a foreign database. Certain embodiments provide assurance, with a know probability of error, that the entity representation identified in the universal database is correct. | 03-22-2012 |
20110066629 | TECHNIQUE FOR PROVIDING SUPPLEMENTAL INTERNET SEARCH CRITERIA - Disclosed is a system for, and method of, supplementing an interne search. The disclosed techniques may be used to receive an initial internet search criteria entered by a user at an interface (such as a web site) to the internet search engine, identify an entity representation in a database that corresponds to the internet search criteria, and produce an enhanced internet search criteria that may incorporate both the initial internet search criteria and field values from the identified entity representation. The enhanced internet search criteria may be passed to the internet search engine in a manner that is transparent to a user. | 03-17-2011 |
20100017399 | TECHNIQUE FOR RECYCLING MATCH WEIGHT CALCULATIONS - Disclosed is a system for, and method of, recycling field value weights as computed for database linking purposes. Such field value weights may be used for a search operation. In some embodiments, such weights may be used for a search operation prior to their values stabilizing during an iterative linking operation. | 01-21-2010 |
20100010988 | ENTITY REPRESENTATION IDENTIFICATION USING ENTITY REPRESENTATION LEVEL INFORMATION - Disclosed is a system for, and method of, searching for and identifying one or more entity representations using comprehensive search criteria built from known entity representations. The comprehensive search criteria are permitted to include inconsistent field values, that is, multiple different field values corresponding to the same field. The system and method may perform using search queries or batch files. | 01-14-2010 |
20100005091 | STATISTICAL MEASURE AND CALIBRATION OF REFLEXIVE, SYMMETRIC AND TRANSITIVE FUZZY SEARCH CRITERIA WHERE ONE OR BOTH OF THE SEARCH CRITERIA AND DATABASE IS INCOMPLETE - Disclosed is a system for, and method of, searching for and identifying an entity representation. Some embodiments utilize a reflexive, symmetric and transitive function to allow for non-identical matches between field values. The function may be used to generate field value codes, which are associated with a portion of a field value weight for the original field value. In such embodiments, the field value weight for the original field values may be distributed among the original field value and the associated field value code. | 01-07-2010 |
20100005090 | STATISTICAL MEASURE AND CALIBRATION OF SEARCH CRITERIA WHERE ONE OR BOTH OF THE SEARCH CRITERIA AND DATABASE IS INCOMPLETE - Disclosed is a system for, and method of, identifying an entity representation. In some embodiments, search criteria are used to identify an entity representation in a universal database, and this identification is then used to identify a corresponding entity representation in a foreign database. Certain embodiments provide assurance, with a know probability of error, that the entity representation identified in the universal database is correct. | 01-07-2010 |
20100005079 | SYSTEM FOR AND METHOD OF PARTITIONING MATCH TEMPLATES - Disclosed is a system for, and method of, identifying an entity representation. In some embodiments, a match template is used to partition a search criteria so that an expected number of matching records does not exceed a desired threshold. In such embodiments, the match template may limit the number of records that are expected to identically match in certain fields designated as fixed fields, and limit the number of records that are expected to either identically match or have blank field values in certain fields designated as optional fields. Such embodiments thus provide probabilistic limits on a number of database fetches required for a particular search and on a number of record transfers required for a particular search. | 01-07-2010 |
20100005078 | SYSTEM AND METHOD FOR IDENTIFYING ENTITY REPRESENTATIONS BASED ON A SEARCH QUERY USING FIELD MATCH TEMPLATES - Disclosed is a system for, and method of, identifying a universal entity representation in an electronic universal database that corresponds to a foreign entity representation in an electronic foreign database, each entity representation including a plurality of linked records, each record including a plurality of fields, each field capable of containing a field value, each field value associated with a field value weight. The system and method include constructing a plurality of field match templates, wherein at least one field match template comprises a fixed field portion, an optional field portion, and an extra-credit field portion, the fixed field portion designating at least one field of a record as fixed, the optional field portion designating at least one field of a record as optional, the extra-credit field portion designating at least one field of a record as extra-credit, wherein an arbitrary record is considered to match an arbitrary query if a fixed field of the arbitrary record is populated with a field value that matches a corresponding fixed field value of the arbitrary query and an optional field of the arbitrary record is populated with one of a null field value and a field value that matches a corresponding optional field value of the arbitrary query. The system and method also providing a plurality of distributed tables, each distributed table being associated with a field match template and storing a plurality of records sorted in a list according to a plurality of fields of the field match template, wherein each record is associated with one or more entity representations. The system and method further include receiving, using a computing apparatus, a query identifying or constraining a plurality of field values, the query associated with a record in the foreign database. The system and method further include comparing, using a computing apparatus, the query to a plurality of field values of the plurality of fields of the plurality of distributed tables to identify an entity representation in the universal database that corresponds to the query based on field designations specified by the field match template. The system and method even further include outputting, using a computing apparatus, an identifier for the identified entity representation. | 01-07-2010 |
20100005057 | STATISTICAL MEASURE AND CALIBRATION OF INTERNALLY INCONSISTENT SEARCH CRITERIA WHERE ONE OR BOTH OF THE SEARCH CRITERIA AND DATABASE IS INCOMPLETE - Disclosed is a system for, and method of, searching for and identifying an entity representation. Some embodiments permit search criteria that are internally inconsistent. Such internally inconsistent criteria may include, for example, a maiden last name and a married last name. Certain embodiments account for such criteria in an intelligent manner and identify matching entity representations with a known confidence level of accuracy. | 01-07-2010 |
20100005056 | BATCH ENTITY REPRESENTATION IDENTIFICATION USING FIELD MATCH TEMPLATES - Techniques may be used to match records of a batch file to an entity representation in a universal database. Inputs may include, but are not limited to, a batch file and a universal (or other) database. The technique may compare the records of the batch file to the records of the universal database, and may attempt to create matches between the records in the batch file and the entity representations or records in the universal database. One possible output may include one or more tables that include foreign record IDs of the batch file records, each in association with an entity representation of the universal database. The techniques may include a batch style processing of records. | 01-07-2010 |
20090292695 | AUTOMATED SELECTION OF GENERIC BLOCKING CRITERIA - Field probabilities associated with fields in a database may be used to create one or more blocking criteria. The blocking criteria may be a set of fields that should be equal among two or more records in a database, so that a search of the records in the database according to the blocking criteria yields a subset of records approximately equal to or less than the specified maximum block size. Generic blocking criteria may also be created. The generic blocking criteria may be used for a batch comparison or batch linking operation within the records of the database. | 11-26-2009 |
20090292694 | STATISTICAL RECORD LINKAGE CALIBRATION FOR MULTI TOKEN FIELDS WITHOUT THE NEED FOR HUMAN INTERACTION - Disclosed is a system for, and method of, calculating parameters used to determine whether records and entity representations should be linked. The system and method utilize blended field weights to account for certain types of partial matches. The system and method apply iterative techniques such that parameters from each linking iteration are used in the next linking iteration. The system and method need no human interaction in order to calibrate and utilize record matching formulas used for the linking decisions. | 11-26-2009 |
20090287689 | AUTOMATED CALIBRATION OF NEGATIVE FIELD WEIGHTING WITHOUT THE NEED FOR HUMAN INTERACTION - Disclosed is a system for, and method of, calculating parameters used to determine whether records and entity representations should be linked. Such parameters may be set as negative to account for fields that do not match. The system and method apply iterative techniques such that parameters from each linking iteration are used in the next linking iteration. The system and method need no human interaction in order to calibrate and utilize record matching formulas used for the linking decisions. | 11-19-2009 |
20090271694 | AUTOMATED DETECTION OF NULL FIELD VALUES AND EFFECTIVELY NULL FIELD VALUES - Disclosed are systems for, and methods of, automatically detecting and treating field values of a particular field as null field values in records of a database. The system and method provide automatic treatment of these field values as null field values by calculating a critical frequency for the field. Based on the critical frequency of the field, the system and method treats field values that occur more than the critical frequency of the field as null field values and treats field values that occur less than the critical frequency as non-null field values. | 10-29-2009 |
20090271404 | STATISTICAL RECORD LINKAGE CALIBRATION FOR INTERDEPENDENT FIELDS WITHOUT THE NEED FOR HUMAN INTERACTION - Disclosed is a system for, and method of, calculating parameters used to determine whether records and entity representations should be linked. The system and method take into consideration interdependent fields, e.g., fields whose constituent field values may be positively or negatively correlated. The system and method apply iterative techniques such that parameters from each linking iteration are used in the next linking iteration. The system and method need no human interaction in order to calibrate and utilize record matching formulas used for the linking decisions. | 10-29-2009 |
20090271397 | STATISTICAL RECORD LINKAGE CALIBRATION AT THE FIELD AND FIELD VALUE LEVELS WITHOUT THE NEED FOR HUMAN INTERACTION - Disclosed is a system for, and method of, calculating parameters used to determine whether records and entity representations should be linked. The system and method apply iterative techniques such that parameters from each linking iteration are used in the next linking iteration. The system and method need no human interaction in order to calibrate and utilize record matching formulas used for the linking decisions. | 10-29-2009 |
20090271363 | ADAPTIVE CLUSTERING OF RECORDS AND ENTITY REPRESENTATIONS - 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. | 10-29-2009 |
20090271359 | STATISTICAL RECORD LINKAGE CALIBRATION FOR REFLEXIVE AND SYMMETRIC DISTANCE MEASURES AT THE FIELD AND FIELD VALUE LEVELS WITHOUT THE NEED FOR HUMAN INTERACTION - Disclosed is a system for, and method of, calculating parameters used to determine whether records and entity representations should be linked. The system and method use a symmetric and reflexive function to allow for linking records and entity representations whose field values differ. The system and method apply iterative techniques such that parameters from each linking iteration are used in the next linking iteration. The system and method need no human interaction in order to calibrate and utilize record matching formulas used for the linking decisions. | 10-29-2009 |