A computer program product, system, and method for building a knowledge graph may include receiving a plurality of new nodes, receiving a base knowledge graph having existing nodes selectively connected by existing edges, and superimposing the new nodes onto selected ones of the existing nodes of the base knowledge graph. The method may further include connecting the new nodes by creating a new edge with a new weight between at least two of the 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 the new nodes with the new edges from the base knowledge graph.