Structuring incoherent nodes by superimposing on a base knowledge graph

A system comprising

• a processor;
• a memory device coupled to the processor;
• and
• a computer readable storage device coupled to the processor, wherein the storage device contains program code executable by the processor via the memory device to implement a method for building a knowledge graph, the method comprising:
• first receiving, by a processor of a computing system, a plurality of new nodes;
• second receiving, by the processor, a base knowledge graph comprising existing nodes selectively connected by existing edges, each edges of the existing edges having an existing weight;
• superimposing, by the processor, the plurality of new nodes onto selected nodes of the existing nodes of the base knowledge graph, building pairs of new nodes and corresponding existing nodes;
• connecting, by the processor, the plurality of new nodes by creating a new edge with a new weight between at least two nodes of the plurality of new nodes if corresponding existing nodes in the underlying base knowledge graph have a connection via zero or a predetermined maximum number of existing edges, wherein the new weight is determined based on the existing weights of the existing edges of connections between the corresponding existing nodes;
• and
• detaching, by the processor, the plurality of new nodes with the new edges from the base knowledge graph as a resulting knowledge graph.

A computer program product, comprising a computer readable hardware storage device storing a computer readable program code, the computer readable program code comprising an algorithm that when executed by a computer processor of a computing system implements a method for building a knowledge graph, the method comprising:

• first receiving, by a processor of a computing system, a plurality of new nodes;
• second receiving, by the processor, a base knowledge graph comprising existing nodes selectively connected by existing edges, each edges of the existing edges having an existing weight;
• superimposing, by the processor, the plurality of new nodes onto selected nodes of the existing nodes of the base knowledge graph, building pairs of new nodes and corresponding existing nodes;
• connecting, by the processor, the plurality of new nodes by creating a new edge with a new weight between at least two nodes of the plurality of new nodes if corresponding existing nodes in the underlying base knowledge graph have a connection via zero or a predetermined maximum number of existing edges, wherein the new weight is determined based on the existing weights of the existing edges of connections between the corresponding existing nodes;
• and
• detaching, by the processor, the plurality of new nodes with the new edges from the base knowledge graph as a resulting knowledge graph.