Invention Grant
- Patent Title: Answering complex queries in knowledge graphs with bidirectional sequence encoders
-
Application No.: US16857194Application Date: 2020-04-24
-
Publication No.: US11748356B2Publication Date: 2023-09-05
- Inventor: Bhushan Kotnis , Mathias Niepert , Carolin Lawrence
- Applicant: NEC Laboratories Europe GmbH
- Applicant Address: DE Heidelberg
- Assignee: NEC CORPORATION
- Current Assignee: NEC CORPORATION
- Current Assignee Address: JP Tokyo
- Agency: Leydig, Voit & Mayer, Ltd.
- Priority: EP 214254 2019.12.06
- Main IPC: G06F16/2455
- IPC: G06F16/2455 ; G06F16/901 ; G06F16/31 ; G06F16/22

Abstract:
Method for encoding a query graph into a sequence representation includes receiving a set of m×n path queries representing 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, each of the m×n path queries beginning with a root node and ending with a leaf node, and 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. The positional encodings may include no positional ordering between different path queries. The query graph may include one or more missing entities and each token representing one of the one or more missing entities may be masked to produce a masked sequential query, which may be fed to a transformer encoder.
Public/Granted literature
- US20210173841A1 ANSWERING COMPLEX QUERIES IN KNOWLEDGE GRAPHS WITH BIDIRECTIONAL SEQUENCE ENCODERS Public/Granted day:2021-06-10
Information query