ALIGNING KNOWLEDGE GRAPHS USING SUBGRAPH TYPING

Systems and methods for aligning knowledge graphs. A subgraph type is assigned to each node of a plurality of nodes in a first knowledge graph and a second knowledge graph. The assigned subgraph type for each node is determined based on the labels of a plurality of edges and/or other nodes coupled to the node in the knowledge graph. An initial matching is performed to identify a plurality of candidate node-node pairs each including one node from each knowledge graph. A candidate node-node pair is identified as a valid node-node mapping based at least in part on a determination that the subgraph type combination of the candidate node-node pair matches a subgraph type combination of another candidate node-node pair that has previously been confirmed as a valid node-node mapping. In some implementations, a machine-learning model is trained to use the aligned knowledge graphs.