Performing a search using a hypergraph

A computer program product, the computer program product comprising a computer readable storage medium having program instructions embodied therewith, the program instructions executable by a processor to cause the processor to perform operations for:

• identifying entities;
• generating a knowledge graph using the entities, wherein nodes of the knowledge graph represent the entities, wherein edges between the nodes represent pair-wise relationships, and wherein each of the edges carries an edge score that quantifies a degree of coherence between a pair of the entities;
• generating a hypergraph by traversing the knowledge graph, wherein nodes of the hypergraph represent the entities, wherein hyperedges represent relationships between multiple entities, wherein each of the hyperedges carries a hyperedge score that quantifies a degree of coherence between the multiple entities, and wherein each of the hyperedges comprises a set of edges of the knowledge graph;
• receiving a search request;
• generating a search result using the hypergraph, wherein the search result comprises coherently related entities comprising the entities from at least one hyperedge of the hyperedges;
• and
• returning the search result.

A computer system, comprising:

• one or more processors, one or more computer-readable memories and one or more computer-readable, tangible storage devices;
• and
• program instructions, stored on at least one of the one or more computer-readable, tangible storage devices for execution by at least one of the one or more processors via at least one of the one or more computer-readable memories, to perform operations comprising:
• identifying entities;
• generating a knowledge graph using the entities, wherein nodes of the knowledge graph represent the entities, wherein edges between the nodes represent pair-wise relationships, and wherein each of the edges carries an edge score that quantifies a degree of coherence between a pair of the entities;
• generating a hypergraph by traversing the knowledge graph, wherein nodes of the hypergraph represent the entities, wherein hyperedges represent relationships between multiple entities, wherein each of the hyperedges carries a hyperedge score that quantifies a degree of coherence between the multiple entities, and wherein each of the hyperedges comprises a set of edges of the knowledge graph;
• receiving a search request;
• generating a search result using the hypergraph, wherein the search result comprises coherently related entities comprising the entities from at least one hyperedge of the hyperedges;
• and
• returning the search result.