ANSWERING COMPLEX QUERIES IN KNOWLEDGE GRAPHS WITH BIDIRECTIONAL SEQUENCE ENCODERS HAVING MEDICAL USE APPLICATIONS

A memory for storing data for access by an application program includes an encoded sequential query representing m×n path queries of a query graph having a plurality of elements including m root nodes and n leaf nodes, and a missing element, wherein m and n are integer values. Each of the 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 path queries, and wherein the missing element is masked. The invention can be used for, but is not limited to, medical uses, such as for predicting protein-drug interactions or medical conditions, as well as other applications, and significantly outperforms the optimized model.