US 2026/0203602 A1Published application

Discrete monotonic entity resolution models

AssigneeCapital One Services, LLC

InventorsJeffrey GABLER, Benjamin COOK

Life of this patent

Estimating the term…

Loading patent…

Abstract

Systems and methods for performing entity resolution. In some aspects, the system uses a plurality of attributes represented in a plurality of records to construct a feature vector for pairs of records based on whether corresponding attributes between pairs of records in the plurality of records match. The system generates a directed graph of the feature vectors where nodes represent feature vectors and edges connect nodes if the preceding feature vector has fewer matches than the subsequent feature vector. When the similarity between feature vectors of node pairs satisfies a threshold, the system merges reachable feature vectors in the directed graph. The system can generate a lookup table from the remaining feature vectors in the modified graph, mapping each to a classification of either matching or non-matching entities. The system merges pairs of records with a corresponding classification from the lookup table that the pair of records are matching entities.

Claims20

Dependent claims

A system for training entity resolution models using monotonicity constraints, the system comprising:

one or more processors;
and
one or more non-transitory, computer-readable media comprising instructions that, when executed by the one or more processors, cause operations comprising:
receiving a plurality of records from one or more sources;
determining a plurality of attributes represented in the plurality of records;
using the plurality of attributes, generating a plurality of discrete features for each attribute of the plurality of attributes by:
(i) comparing corresponding attributes between pairs of records of the plurality of records, and
(ii) determining whether the corresponding attributes between the pairs of records match;
constructing a feature vector for each pair of records, wherein the feature vector comprises corresponding discrete features of the pair of records;
generating a directed graph of the constructed feature vectors comprising:
(i) a set of nodes representing each constructed feature vector, and (ii) a set of edges between the set of nodes when a preceding feature vector has one less matching attribute than a subsequent feature vector that the preceding feature vector is directed to;
for each particular pair of nodes in the set of nodes:
determining whether the particular pair of nodes be merged, based on whether a distance between the feature vector of the particular pair of nodes satisfy a predefined threshold, and
responsive to the distance between the feature vectors of the particular pair of nodes satisfying the predefined threshold, modifying the directed graph by merging feature vectors reachable, via one or more edges, from the node of the particular feature vector in the directed graph;
generating a lookup table using remaining feature vectors within the modified directed graph, wherein the lookup table maps each remaining feature vector of the modified directed graph to a classification indicating either matching entities or non-matching entities;
and
using the lookup table to merge pairs of records of the plurality of records for each feature vector having a corresponding classification from the lookup table that the pair of records for the feature vector are matching entities.

14 more elements

One or more non-transitory, computer-readable media comprising instructions that, when executed by one or more processors, cause operations comprising:

using an entity resolution model to merge a pair of records based on a feature vector for the pair of records having a corresponding classification from the entity resolution model that the pair of records are matching entities,
wherein, using one or more of attributes represented in a plurality of records, feature vectors are constructed for each pair of records based on whether corresponding attributes between pairs of records in the plurality of records match,
wherein a directed graph of the constructed feature vectors is generated comprising:
(i) a set of nodes representing each constructed feature vector, and (ii) a set of edges between the set of nodes,
wherein, for each particular pair of nodes in the set of nodes, the directed graph is modified by merging feature vectors reachable, via one or more edges, from the node of the particular feature vector in the directed graph, and
wherein the entity resolution model is generated using remaining feature vectors within the modified directed graph.

3 more elements

Dependencies are inferred from the claim text.