A knowledge graph is traversed by receiving a knowledge graph at a deep neural network, the knowledge graph including a plurality of nodes connected by a plurality of edges, each respective edge of the plurality of edges being associated with a corresponding distance representing embedded semantic information. The deep neural network is trained to capture the embedded semantic information. A path query is received at the deep neural network. A context is determined for the received path query at the deep neural network. The deep neural network performs the traversing of the knowledge graph in response to the received path query, based upon the determined context and the embedded semantic information.
Please help me write a proper abstract based on the patent claims. CLAIM: 1. A computer-implemented method for traversing a knowledge graph including a plurality of nodes connected by a plurality of edges, each edge of the plurality of edges representing embedded semantic information, the method comprising: receiving the knowledge graph at a deep neural network (DNN); capturing the embedded semantic information by the DNN; receiving a path query at the DNN specifying a starting node of the knowledge graph and a termination node of the knowledge graph; determining a context for the received path query; and traversing the knowledge graph, based on the context and the embedded semantic information, in response to said receiving a path query at the DNN specifying a starting node of the knowledge graph and a termination node of the knowledge graph. 2. The computer-implemented method of claim 1, wherein said determining the context further comprises determining the context by identifying one or more previously traversed nodes of the knowledge graph. 3. The computer-implemented method of claim 1, wherein the embedded semantic information comprises a corresponding semantic relatedness for each respective edge of the plurality of edges. 4. The computer-implemented method of claim 1, further comprising: learning a fixed-size vector based on the embedded semantic information embedded in one or more edges of the plurality of edges; capturing an unsupervised graph structural similarity; and generating a fixed input size for the starting node and the termination node specified in the path query. 5. The computer-implemented method of claim 1, wherein the traversing further comprises analyzing the knowledge graph as a likelihood of reaching a next node to be traversed in the knowledge graph. 6. The computer-implemented method of claim 1, wherein the traversing further comprises performing a cognitive traversal process for analyzing the knowledge graph as a likelihood of reaching a next node to be traversed in the knowledge graph, given a determined context of the knowledge graph. 7. The computer-implemented method of claim 1, wherein each node of the plurality of nodes is represented using a textual embedding procedure in a vector space model. 8. The computer-implemented method of claim 1, further comprising explicitly establishing one or more relationships among at least two of the plurality of nodes, using one or more true path queries. 9. The computer-implemented method of claim 1, further comprising selecting a process from the group consisting of: (a) deriving one or more respective relations among at least two of the plurality of nodes using subgraph mining by searching for one or more common subgraphs of the knowledge graph, or by searching for a common collection of subrelations within the knowledge graph; (b) reserving a portion of an input of the knowledge graph for new entities or nodes that are subsequently added to the knowledge graph; and (c) combinations of said (a) and said (b). 10. A computer program product for traversing a knowledge graph including a plurality of nodes connected by a plurality of edges, each edge of the plurality of edges representing embedded semantic information, the computer program product comprising a computer-readable storage medium having a computer-readable program stored therein, wherein the computer-readable program, when executed on a deep neural network (DNN) including at least one processor, causes the at least one processor to perform: receiving the knowledge graph at the DNN; capturing the embedded semantic information by the DNN; receiving a path query at the DNN specifying a starting node of the knowledge graph and a termination node of the knowledge graph; determining a context for the received path query; and traversing the knowledge graph, based on the context and the embedded semantic information, in response to said receiving the path query at the DNN. 11. The computer program product of claim 10, wherein the DNN includes at least one processor, and wherein the computer-readable program, when executed on the DNN, causes the at least one processor to determine the context by identifying one or more previously traversed nodes of the knowledge graph. 12. The computer program product of claim 10, wherein the embedded semantic information comprises a corresponding semantic relatedness for each respective edge of the plurality of edges. 13. The computer program product of claim 10, wherein the DNN includes at least one processor, and wherein the computer-readable program, when executed on the DNN, is further configured for: learning a fixed-size vector based on the embedded semantic information embedded in one or more edges of the plurality of edges; capturing an unsupervised graph structural similarity; and generating a fixed input size for the starting node and the termination node specified in the path query. 14. The computer program product of claim 10, wherein the DNN includes at least one processor, and wherein the computer-readable program, when executed on the DNN, is further configured for performing the traversing by analyzing the knowledge graph as a likelihood of reaching a next node to be traversed in the knowledge graph. 15. The computer program product of claim 10, wherein the DNN includes at least one processor, and wherein the computer-readable program, when executed on the DNN, is further configured for performing a cognitive traversal process for analyzing the knowledge graph as a likelihood of reaching a next node to be traversed in the knowledge graph, given a determined context of the knowledge graph. 16. The computer program product of claim 10, wherein the DNN includes at least one processor, and wherein the computer-readable program, when executed on the DNN, is further configured for representing each node of the plurality of nodes using a textual embedding procedure in a vector space model. 17. The computer program product of claim 10, wherein the DNN includes at least one processor, and wherein the computer-readable program, when executed on the DNN, is further configured for explicitly establishing one or more relationships among at least two of the plurality of nodes, using one or more true path queries. 18. The computer program product of claim 10, wherein the DNN includes at least one processor, and wherein the computer-readable program, when executed on the DNN, is further configured for selecting a process from the group consisting of: (a) deriving one or more respective relations among at least two of the plurality of nodes using subgraph mining by searching for one or more common subgraphs of the knowledge graph, or by searching for a common collection of subrelations within the knowledge graph; (b) reserving a portion of an input of the knowledge graph for new entities or nodes that are subsequently added to the knowledge graph; and (c) a combination of said (a) and said (b). 19. An system for traversing a knowledge graph including a plurality of nodes connected by a plurality of edges, each edge of the plurality of edges representing embedded semantic information, the system comprising a deep neural network (DNN) including at least one processor and a memory coupled to the at least one processor, wherein the memory comprises instructions which, when executed by the at least one processor, cause the at least one processor to perform: receiving the knowledge graph at a deep neural network (DNN); capturing the embedded semantic information by the DNN; receiving a path query at the DNN specifying a starting node of the knowledge graph and a termination node of the knowledge graph; determining a context for the received path query; and traversing the knowledge graph, based on the context and the embedded semantic information, in response to said receiving the path query at the DNN. 20. The system of claim 19, wherein the memory comprises instructions which, when executed by the at least one processor, cause the at least one processor to further perform: determining the context by identifying one or more previously traversed nodes of the knowledge graph; learning a fixed-size vector based on the embedded semantic information embedded in one or more edges of the plurality of edges; capturing an unsupervised graph structural similarity; and generating a fixed input size for the starting node and the termination node specified in the path query; wherein the embedded semantic information comprises a corresponding semantic relatedness for each respective edge of the plurality of edges.