Abstract: 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.

Abstract: A method and system for deleting a node of a knowledge graph may be provided. The method comprises receiving knowledge graph data comprising nodes and edges, determining a first relevance degree value for a node and a second relevance degree value for the node, combining the first and the second relevance degree value and marking the node as deletable if the final relevance degree value is above a predefined relevance threshold value. The method comprises further applying queries against the knowledge graph, wherein at least a certain number of such queries invokes accessing of a node, marked as deletable, revising at least one of the first and second relevance degree value based on the accessing of the node marked as deletable, and deleting the node, marked as deletable, if over a predetermined period of time queries against the knowledge graph invoke no access of the node marked as deletable.

Abstract: A computer-implemented method includes associating, using a processor, one or more words in an electronic agenda template to at least one agenda item indicative of a point for discussion. The processor captures a real-time interaction comprising speech from one or more participants of a plurality of discussion participants into a digital representation. The processor isolates a portion of the real-time interaction from the digital representation. The portion is associated with a single speaker of the plurality of discussion participants. The processor makes at least one match between an isolated portion of the real-time interaction and the at least one agenda item. The processor determines an intent of the single speaker from the isolated portion and matching the determined intent of the single speaker to the at least one agenda item on the electronic agenda template, and generates discussion minutes output based on the matched intent and agenda item.

Abstract: A method includes receiving a first query by a computing device and assigning the first query to a plurality of cognitive engines, wherein each of the plurality of cognitive engines include different characteristics for processing data. The method also includes, responsive to receiving a response from each of the plurality of cognitive engines for the first query, comparing the received responses from the plurality of cognitive engines. The method also included responsive to determining a difference between a first response from a first cognitive engine and a second response from a second cognitive engine is above a predetermined threshold value, performing a response mediation process until the difference is below the predetermined threshold value. The method also includes selecting a first final response from the received responses for the first query and the second query and displaying the first final response to a user.