US 12,430,337 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,433.
Application 18/355,433 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/0385281 A1, Nov. 30, 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 tangible, non-transitory memory for storing data for access by an application program being executed on a data processing system, comprising a data structure stored in the memory including information resident in a database used by the application program and including:
an encoded sequential query representing a set of m×n path queries of a query graph having a plurality of elements including m root nodes and n leaf nodes, one or more edges connecting a root node with edge nodes, and at least one missing element, wherein m and n are integer values, wherein each of the m×n path queries includes a root node as a start position and a leaf node as an end position, wherein positional encodings of the elements include a positional order within each path query, wherein the positional encodings of the elements include counter values that are reset at a start position of each of the m×n path queries, and wherein the at least one missing element is masked.