Neighborhood-based entity resolution system and method
AssigneeCherre, Inc.
InventorRon Bekkerman
Life of this patent
Estimating the term…
Abstract
A method for resolving entities in a knowledge graph including determining node sets in the knowledge graph, determining each of the node sets includes determining a first node, determining a second node in a semantic neighborhood of the first node, and determining a third node in the semantic neighborhood of the first node. For each node set, the second node and the third node are compared, and it is determined that the second node and the third node are a similar node pair. For each similar node pair, the first nodes of the node sets are aggregated, and a quantity of overlapping of a semantic neighborhood of the second node and a semantic neighborhood of the third node is determined, and for each similar node pair, the second and third nodes are resolved as a single entity.
Claims15
A computing system comprising at least one hardware processor and at least one non-transitory computer-readable storage medium coupled to the at least one hardware processor and storing programming instructions for execution by the at least one hardware processor, wherein the programming instructions, when executed, cause the computing system to perform operations comprising:
- determining a first node set in a knowledge graph, the determining the first node set comprising:
- determining a first node;
- determining a second node in a semantic neighborhood of the first node;
- and
- determining a third node in the semantic neighborhood of the first node;
- determining a second node set in the knowledge graph, the determining the second node set comprising:
- determining a fourth node;
- determining the second node in a semantic neighborhood of the fourth node;
- and
- determining the third node in the semantic neighborhood of the fourth node;
- comparing the second node and the third node responsive to the determining the second node in the semantic neighborhood of the first node and the determining the third node in the semantic neighborhood of the first node, and determining that the second node and the third node are similar based on the comparing the second node and the third node;
- aggregating at least the first node set and the second node set responsive to the determining the second node and the third node are similar, and determining a quantity of overlapping of a semantic neighborhood of the second node and a semantic neighborhood of the third node based on the aggregating the at least the first node set and the second node set;
- and
- resolving the second node and the third node as a single entity at least based on the determining the quantity of overlapping of the semantic neighborhood of the second node and the semantic neighborhood of the third node and the determining that the second node and the third node are similar.
A method for resolving entities in a knowledge graph to compress the knowledge graph to facilitate a network-based transaction, the method comprising:
- determining a first node set in the knowledge graph, the determining the first node set comprising:
- determining a first node;
- determining a second node in a semantic neighborhood of the first node;
- and
- determining a third node in the semantic neighborhood of the first node;
- determining a second node set in the knowledge graph, the determining the second node set comprising:
- determining a fourth node;
- determining the second node in a semantic neighborhood of the fourth node;
- and
- determining the third node in the semantic neighborhood of the fourth node;
- comparing the second node and the third node responsive to the determining the second node in the semantic neighborhood of the first node and the determining the third node in the semantic neighborhood of the first node, and determining that the second node and the third node are similar based on the comparing the second node and the third node;
- aggregating at least the first node set and the second node set responsive to the determining the second node and the third node are similar, and determining a quantity of overlapping of a semantic neighborhood of the second node and a semantic neighborhood of the third node based on the aggregating the at least the first node set and the second node set;
- and
- resolving the second node and the third node as a single entity at least based on the determining the quantity of overlapping of the semantic neighborhood of the second node and the semantic neighborhood of the third node and the determining that the second node and the third node are similar.
Dependencies are inferred from the claim text.