# US 10,311,050 B2 · Crowdsourced discovery of paths in a knowledge graph > Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt - Number: US 10,311,050 B2 - Document ID: US10311050B2 - Status: Granted - Kind: B2 - Application number: 15/413,103 - Filed: 2017-01-23 - Published: 2018-07-26 - Granted: 2019-06-04 - Earliest claimed: 2017-01-23 - Assignees: International Business Machines Corporation - Applicants: International Business Machines Corporation - Inventors: Charles E. Beller; Donna K. Byron; Benjamin L. Johnson - Web page: https://patentgrep.com/patent/US10311050B2 ## CPC - G06F 16/243: {Natural language query formulation} - G06F 16/9024: {Graphs; Linked lists (G06F16/9027 takes precedence)} - G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N) ## Abstract The disclosed embodiments include a system, computer program product, and computer-implemented method configured to modify a knowledge graph. The disclosed embodiments seek to improve the process of expanding a knowledge graph by identifying information that is useful and relevant to the needs of the users based on questions being asked by users. In one embodiment, the information is collected using a gaming platform. The disclosed embodiments augment the knowledge graph, by adding new entities and/or relationships, based on the gathered information. ## Claims ### Claim 1 A computer-implemented method for improving the functionality of a system, the computer-implemented method comprising: receiving a question; determining a first entity and a second entity from the question; determining whether a knowledge gap exists between the first entity and the second entity in the knowledge graph, wherein the knowledge gap exists when there is less than a predetermined number of connection paths (N) between the first entity and the second entity that are within a predetermined number of hops (M); performing a request to collect information to correct the knowledge gap in the knowledge graph in response to a determination that the knowledge gap exists between the first entity and the second entity in the knowledge graph; receiving the information based on the request; validating the information; and updating the knowledge graph based on the information in response to the information being validated to improve the functionality of the system for answering questions as compared to the functionality of the system prior to the knowledge graph being updated. ### Claim 2 (depends on 1) The computer-implemented method of claim 1, wherein values for N and M are determined based on a statistical analysis of the knowledge graph to identify a number of connection paths and a number of hops between entities that provide useful knowledge. ### Claim 3 (depends on 1) The computer-implemented method of claim 1, wherein the request for information is implemented in a gaming application. ### Claim 4 (depends on 3) The computer-implemented method of claim 3, wherein validating the information is performed by comparing the information to other user's responses to the request. ### Claim 5 (depends on 4) The computer-implemented method of claim 4, wherein validating the information is performed by providing the information to a second user of the gaming application and requesting that the second user validate the information. ### Claim 6 (depends on 4) The computer-implemented method of claim 4, wherein points are accrued by a user of the gaming application based on a quality of the information provided by the user. ### Claim 7 (depends on 4) The computer-implemented method of claim 4, wherein the information is a connection path between the first entity and the second entity, and wherein the connection path comprises at least a third entity between the first entity and the second entity. ### Claim 8 (depends on 7) The computer-implemented method of claim 7, further comprising restricting the third entity based on a list of entities that cannot be part of the connection path. ### Claim 9 A system comprising a processor configured to execute instructions to: receive a question; determine a first entity and a second entity from the question; determine whether a knowledge gap exists between the first entity and the second entity in the knowledge graph, wherein the knowledge gap exists when there is less than a predetermined number of connection paths (N) between the first entity and the second entity that are within a predetermined number of hops (M); perform a request to collect information to correct the knowledge gap in the knowledge graph in response to a determination that the knowledge gap exists between the first entity and the second entity in the knowledge graph; receive the information based on the request; validate the information; and update the knowledge graph based on the information in response to the information being validated to improve the functionality of the system for answering questions as compared to the functionality of the system prior to the knowledge graph being updated. ### Claim 10 (depends on 9) The system of claim 9, wherein the request for information is implemented in a gaming application. ### Claim 11 (depends on 10) The system of claim 10, wherein validating the information is performed by comparing the information to other user's responses to the request. ### Claim 12 (depends on 10) The system of claim 10, wherein validating the information is performed by providing the information to a second user of the gaming application and requesting that the second user validate the information. ### Claim 13 (depends on 10) The system of claim 10, wherein points are accrued by a user of the gaming application based on a quality of the information provided by the user. ### Claim 14 (depends on 10) The system of claim 10, wherein the information is a connection path between the first entity and the second entity, and wherein the connection path comprises at least a third entity between the first entity and the second entity. ### Claim 15 (depends on 14) The system of claim 14, wherein the processor further executes instructions to restrict at least one of the third entity and a relationship based on a restriction list. ### Claim 16 A computer program product for modifying a knowledge graph, the computer program product comprising a computer readable storage medium having program instructions embodied therewith, the program instructions executable by a processor to cause the processor to: receive a question; determine a first entity and a second entity from the question; determine whether a knowledge gap exists between the first entity and the second entity in the knowledge graph, wherein the knowledge gap exists when there is less than a predetermined number of connection paths (N) between the first entity and the second entity that are within a predetermined number of hops (M); and perform a corrective action to correct the knowledge gap in the knowledge graph in response to a determination that the knowledge gap exists between the first entity and the second entity in the knowledge graph, thereby improving the functionality of the system for answering questions as compared to the functionality of the system prior to the knowledge graph being updated. ### Claim 17 (depends on 16) The computer program product of claim 16, wherein values for N and M are determined based on a statistical analysis of the knowledge graph to identify a number of connection paths and a number of hops between entities that provide useful knowledge.