QUERYNG GRAPH TOPOLOGIES

In some examples, a query answering (QA) system to query a graph topology may include a physical processor that executes machine readable instructions that cause the processor to obtain a query provided by a user to query the graph topology. An actual answer to the query is unknown from the graph topology. Furthermore, the machine readable instructions cause the processor to query a set of nodes and a set of edges in the graph topology associated with the obtained query. Querying the set of nodes and edges comprises applying neighboring graph structure statistics to the set of nodes and edges to obtain a set of node grouping patterns and each of the node grouping patterns comprises an associated score within the graph topology. Furthermore, the machine readable instructions cause the processor to identify a set of unconnected nodes within the obtained set of patterns based on the associated score, infer one or more edges to link the set of unconnected nodes based on machine learning and feedback techniques and provide a most-likely answer to the query based on the linking of the set of unconnected nodes.