US 12,468,705 B2
Answering complex queries in knowledge graphs with bidirectional sequence encoders usable to support decision making and having medical use applications
Bhushan Kotnis, Heidelberg (DE); Mathias Niepert, Heidelberg (DE); and Carolin Lawrence, Heidelberg (DE)
Assigned to NEC CORPORATION, Tokyo (JP)
Filed by NEC Corporation, Tokyo (JP)
Filed on Jul. 20, 2023, as Appl. No. 18/355,435.
Application 18/355,435 is a continuation of application No. 16/857,194, filed on Apr. 24, 2020, granted, now 11,748,356.
Claims priority of application No. 19214254 (EP), filed on Dec. 6, 2019.
Prior Publication US 2023/0359630 A1, Nov. 9, 2023
This patent is subject to a terminal disclaimer.
Int. Cl. G06F 16/2455 (2019.01); G06F 16/22 (2019.01); G06F 16/31 (2019.01); G06F 16/901 (2019.01)
CPC G06F 16/24553 (2019.01) [G06F 16/2246 (2019.01); G06F 16/322 (2019.01); G06F 16/9024 (2019.01)] 20 Claims
OG exemplary drawing
 
1. A computer-implemented method of encoding a query graph, the query graph having a plurality of nodes including m root nodes and n leaf nodes, wherein m and n are integer values, the method comprising the steps, implemented in a processor, of:
receiving a set of m×n path queries representing the query graph, wherein each of the m×n path queries starts with a root node and ends with a leaf node, wherein the query graph includes at least one of: one or more missing nodes or one or more missing edges between nodes;
encoding positions of each node and each edge between nodes within each of the m×n path queries independently, wherein the encoded positions include a positional order within each path query, and wherein the encoded positions include positional counter values that are reset at a start position of each of the m×n path queries;
masking each of the at least one of the one or more missing nodes or one or more missing edges between nodes to produce a masked query; and
feeding the masked query to a transformer encoder.