Search system, method and device based on knowledge graph shortest path query
A technology of shortest path and knowledge graph, applied in the field of computer network, to achieve the effect of accurate semantic analysis and fast and accurate search
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0126] An embodiment of the present invention provides a search device based on knowledge graph shortest path query, such as Figure 10 As shown, it includes: a memory 1010, a processor 1020, and a computer program stored on the memory 1010 and operable on the processor 1020. When the computer program is executed by the processor 1020, the following method steps are implemented:
[0127] Step 901, receiving user input information based on predetermined input rules;
[0128] Step 902: Divide the input information according to the instance synonyms and concept synonyms, and output the target point and constraint point. When the target point corresponds to multiple concepts, obtain the concept node corresponding to the constraint point to the target point in the concept graph. For the shortest path of multiple concept nodes, the concept of the concept node with the shortest path is used as the concept of the target node. In the instance map, the instance node is determined accord...
Embodiment 2
[0145] An embodiment of the present invention provides a computer-readable storage medium, where a program for realizing information transmission is stored on the computer-readable storage medium, and when the program is executed by the processor 1020, the following method steps are implemented:
[0146] Step 901, receiving user input information based on predetermined input rules;
[0147] Step 902: Divide the input information according to the instance synonyms and concept synonyms, and output the target point and constraint point. When the target point corresponds to multiple concepts, obtain the concept node corresponding to the constraint point to the target point in the concept graph. For the shortest path of multiple concept nodes, the concept of the concept node with the shortest path is used as the concept of the target node. In the instance map, the instance node is determined according to the concept of the target node and the instance name, or the instance correspon...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


