International Business Machines Corporation
Information Matching Using Subgraphs

Abstract:

A method matches information. A first center node in a first subgraph and a second center node in a second subgraph are identified. Groups of neighboring nodes having the neighboring nodes from both of subgraphs are identified. A group of the neighboring nodes in the groups has the neighboring nodes with a same node type. A best matching node pair of the neighboring nodes in each cluster is identified. The neighboring nodes in each best matching node pair comprise a first node from the first subgraph and a second node from the second subgraph. Whether the center nodes match is determined based on an overall distance between the center nodes using the first and second center node and the best matching node pair pairs.