Lexisnexis Risk Solutions Fl Inc.

Seisint, Inc.

Lexisnexis Risk & Information Analytics Group Inc.

Lexisnexis Risk Data Management, Inc.

Lexisnexis Risk Solution Fl Inc.

Lexisnexis Risk Management Inc.

Lexinexis Risk Data Management Inc.

Sesint, Inc.

David Alan Bayliss

Richard K Chapman

Nigel G Hicks

Ole Poulsen

Gavin C Halliday

Jacob Cobbett-Smith

Jake Smith

Johannes Philippus De Villiers Prichard

Jesse C P B Shaw

Charles Edwards Morton

Armando J Escalante

George Conrad L'Heureux

Michael Lamb

Edin Muharemagic

Charles Edward Morton

Embodiments of the disclosed technology include systems and methods for identifying one or more entities associated with activities. In an example implementation, a method includes determining one or more geographical regions proximate to the plurality of locations associated with the one or more activities; determining connections between one or more identities of a population and a plurality of related entities associated with the one or more identities; determining geographical information associated with related entities; weighting one or more metrics for each of the identities based on the geographical information associated with the related entities and the or more geographical regions proximate to the plurality of locations associated with the one or more activities; scoring the one or more weighted metrics; and providing, based on the scoring, an indication of a likelihood that the one or more identities of the population are associated with the one or more activities.

Systems and methods for identifying entities using geographical and social mapping

Certain implementations of the disclosed technology include systems and methods for external linking based on hierarchal level weightings. The method may include associating external query data having one or more query field values with a record in a linked hierarchical database. The linked hierarchical database may include a plurality of records, each record having a record identifier and representing an entity in a hierarchy, each record associated with a hierarchy level, each record including one or more fields, each field configured to contain a field value. The associating may include receiving the external query data, wherein the external query data includes one or more search values; and identifying, from the plurality of records in the linked hierarchical database, one or more matched fields having field values that at least partially match the one or more search values.

External linking based on hierarchical level weightings

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.

Internal linking co-convergence using clustering with hierarchy

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.

Technique for recycling match weight calculations

Disclosed is a system for, and method of, determining whether records and entity representations should be delinked. The system and method need no human interaction in order to calculate parameters and utilizing formulas used for the delinking decisions.

System of and method for entity representation splitting without the need for human interaction

Disclosed is a system for, and method of, supplementing an internet 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.

Technique for providing supplemental internet search criteria

Embodiment of the disclosed technology include systems and methods for identifying one or more entities associated with activities. In an example implementation, a method includes determining one or more geographical regions proximate to the plurality of locations associated with the one or more activities; determining connections between one or more identities of a population and a plurality of related entities associated with the one or more identities; determining geographical information associated with related entities; weighting one or more metrics for each of the identities based on the geographical information associated with the related entities and the or more geographical regions proximate to the plurality of locations associated with the one or more activities; scoring the one or more weighted metrics; and providing, based on the scoring, an indication of a likelihood that the one or more identities of the population are associated with the one or more activities.

Certain implementations of the disclosed technology include systems and methods for linking entities in an internal database by utilizing co-convergence and clustering. The method may include clustering database records into a first set of clusters having corresponding first cluster identifications (IDs). The clustering may be based at least in part on determining similarity among corresponding field values. The method may include associating mutually matching database records, by performing at least one matching iteration for each of the database records. The method may include determining similarity among corresponding field values of the database records, re-clustering at least a portion of the database records into a second set of clusters, the re-clustering based at least in part on the associating mutually matching database records and on the determining similarity among corresponding field values of the database records.

Internal linking co-convergence using clustering with no hierarchy

Certain implementations may include systems and methods for populating entity fields based on hierarchy partial resolution. According to an example implementation, a method is provided that may include identifying one or more first matching records in a hierarchical database, where matching records include one or more fields having an associated first matching field value that at least partially matches a received portion of a first query term. The method may include outputting, for display, one or more first matching field values of the one or more first matching records and receiving a second indication input signifying a selection of one of the one or more first matching field values.

Populating entity fields based on hierarchy partial resolution

Exemplary systems and methods for linking entity references to entities and identifying associations between entities are presented. In particular, a method for delinking one or more entity references linked to a same entity is provided, where the one or more entity references have at least one common data field. The method comprises the steps of evaluating at least one actual measurement of the entity based at least in part on one or more field values of the one or more entity references, determining a difference between the at least one actual measurement and at least one predefined measurement associated with the entity and delinking the one or more entity references based at least in part on a comparison of the difference and a defined threshold.

Growing community of inventors

Delray Beach, FL, United States of America

David Alan Bayliss