International Business Machines Corporation

Thomas Bradley Allen

Barry Mark Caceres

Brian Eugene Macy

Michael Henry D'Amico

Brand Lee Hunt

Keith Caceres

Maria Nichole Schwenger

Dominique Jeremy Evans

Kathleen Miyoko Nojima

Anthony D Curcio

Caroljayne J Vincent

Donald A Bowsher, Jr

Donald Anthony Bowsher

Anthony David Curcio

Michael Henry D'amico

Techniques are disclosed for resolving relationships in a relationship graph of identities. A strength of at least one link from a node of the relationship graph may be reduced, based on at least a count of the links from the node. Further, the reduction may be based on one or more predefined threshold counts. The node having a reduced link strength may be evaluated to identify whether a relationship between the node and a specified node meets predefined criteria for a relationship of interest. A user may be alerted of any identified relationship.

Probabilistic link strength reduction

The present invention generally is directed to a system, method and article of constructing queries from a set of query conditions. The query conditions are grouped using logical operators to generate a database query. Query conditions within a group may be connected using a logical 'OR' operator and groups of query conditions may be connected using a logical 'AND' operator. Once generated, the database query may be presented to a user for review.

Determining Boolean logic and operator precedence of query conditions

A method, article and apparatus for calculating a measure of similarity between names is disclosed. Generally, name elements from an inbound name may be matched to name elements in a candidate matching name. A measure of similarity for the inbound name and candidate matching name may be calculated based on the number of matching name elements, an inbound name word count, a candidate name word count, and the number of transpositions that occur in matching name elements with one another.

Method, apparatus and article for assigning a similarity measure to names

Provided are techniques to search for an entity in an entity resolution system. Search input comprising one or more attribute values of one or more attribute types is received. A resolution search is performed to generate a search result set comprising one or more entities and zero or more generic attribute values for generating additional entities. In response to determining that the resolution search generated at least two generic attribute values, one or more query searches are performed for a unique generic group by generic attribute type to identify the additional entities, wherein the unique generic group comprises a subset of the search input and includes at least two generic attribute types; the identified additional entities are combined with the entities in the search result set; and the search result set is returned.

Smarter search

Systems, methods, and computer program products are disclosed for matching an inbound identity record to existing entities. A composite generic key may be generated from multiple entity resolution (ER) candidate-building keys determined to be generic keys. A query may be generated based on the composite generic key and executed to retrieve candidate entities for an inbound identity record.

Generating candidate entities using over frequent keys

Identifying a set of candidate entities for an identity record

Techniques are disclosed for configuring an identity resolution system to support distinct relevance types. Identity records are accessed that are assigned relevance scores of distinct relevance types. Upon determining that the identity records refer to a common individual, the identity records are resolved into an entity representing the common individual. Relevance scores of the distinct relevance types are then determined for the entity, based on the identity records.

Typed relevance scores in an identity resolution system

Systems, methods and articles of manufacture are disclosed for matching an inbound identity record to existing entities. Entity resolution (ER) candidate-building keys may be determined for a received identity record. A query may be generated from the ER candidate-building keys. When executing the query, a generic key may be identified. Execution of the query may be aborted upon a condition involving the generic key being satisfied.

Multiple candidate selection in an entity resolution system

Non-distinct names are identified in a set of names. The set of names is obtained for a first entity. In response to comparing a first name and a second name in the set of names, it is determined that the first name is similar to the second name. Initials in the first name and the second name are searched for. In response to the search indicating that there is at least one initial in at least one of the first name and the second name, it is determined that the at least one initial matches a corresponding initial in another one of the first name and the second name and one of the first name and the second name are marked as a non-distinct name. A cross-entity scoring technique using distinct names in the set of names for the first entity and names in another set of names for a second entity is applied.

Identifying non-distinct names in a set of names

Techniques are disclosed for matching an inbound identity record to existing entities. Entity resolution (ER) candidate-building keys are determined for a received identity record. A query is generated from the ER candidate-building keys. When executing the query, a generic key is identified. Execution of the query is aborted upon a condition involving the generic key being satisfied.

An entity resolution system and alert analysis system configured to process inbound identity records and to generate alerts based on relevant identities, entities, conditions, activities, or events is disclosed. One process of resolving identity records and detecting relationships between entities may be performed using a pre-determined or configurable entity resolution rules. Further, the entity resolution system may include an alert analysis system configured to allow analysts to review and analyze alerts, entities, and identities, as well as provide comments or assign a disposition to alerts generated by the entity resolution system. Furthermore, the entity resolution system may be configured to handle duplicate alerts, i.e., one or more identical or near-identical alerts generated using the same entities and/or identities as well as assign a relevance score to the particular entities and identities included in the alert.

Determining the degree of relevance of alerts in an entity resolution system

Determining the degree of relevance of duplicate alerts in an entity resolution system

Provided are a method, system, and article of manufacture for a query predicate generator to construct a database query predicate from received query conditions. A plurality of query conditions are received, wherein each query condition includes a comparison operator and a comparison value for a database attribute, and wherein the comparison operator is capable of comprising matching and non-matching operators. The query conditions are processed to determine at least one logical operator to include between the query conditions. A database query predicate is generated to use in a database query to apply against the database comprising the received query conditions chained using the determined logical operators.

Growing community of inventors

Henderson, NV, United States of America

Thomas Bradley Allen