A technique for responding to user input includes assigning respective initial confidence scores to relationship n-tuples in a knowledge graph (KG). Each of the n-tuples designates at least a first entity, a second entity, and a relationship between the first and second entities or a single entity and a relationship between the single entity and one or more properties of the single entity. Respective feature vectors are associated with each of the n-tuples. A training set that includes at least a subset of the n-tuples labeled with respective ground truth labels is generated. Respective initial weights are learned for the feature vectors based on the training set. Respective subsequent confidence scores are generated for each of the n-tuples based on the initial weights for the feature vectors. A response to user input is generated based on the subsequent confidence scores for one or more of the n-tuples.
Please help me write a proper abstract based on the patent claims. CLAIM: 1. A method of responding to user input, comprising: assigning, using a data processing system, respective initial confidence scores to relationship n-tuples in a knowledge graph (KG), wherein each of the relationship n-tuples designates at least a first entity, a second entity, and a relationship between the first and second entities or a single entity and a relationship between the single entity and one or more properties of the single entity; associating, using the data processing system, respective feature vectors with each of the relationship n-tuples; generating, using the data processing system, a training set that includes at least a subset of the relationship n-tuples labeled with respective ground truth labels; learning, using the data processing system, respective initial weights for the feature vectors based on the training set; generating, using the data processing system, respective subsequent confidence scores for each of the relationship n-tuples based on the initial weights for the feature vectors; and generating, using the data processing system, a response to user input based on the respective subsequent confidence scores for one or more of the relationship n-tuples in the KG. 2. The method of claim 1, wherein the method further comprises: extracting the relationship n-tuples from data; and populating the KG with the extracted relationship n-tuples. 3. The method of claim 1, wherein the features vectors have associated dynamic features and associated static features and the method further comprises: determining that one or more of the dynamic features associated with one or more of the feature vectors has changed; in response to determining that one or more of the dynamic features associated with one or more of the feature vectors has changed, learning respective new weights for the feature vectors; and generating respective new confidence scores for each of the relationship n-tuples based on the new weights for the feature vectors. 4. The method of claim 3, wherein the dynamic features include one or more of a ‘klout’ score and a ‘click log’ score. 5. The method of claim 1, wherein the method further comprises: determining that one or more new relationship n-tuples should be promoted to the training set; modifying the training set to include the new relationship n-tuples; learning respective new weights for the feature vectors based on the modified training set; and generating respective new confidence scores for each of the relationship n-tuples based on the new weights for the feature vectors. 6. The method of claim 5, wherein the new relationship n-tuples are selected for promotion to the training set based on a confidence score and a robustness of the new relationship n-tuples. 7. The method of claim 6, wherein the new relationship n-tuples that are automatically added to the training set are weighted differently than the new relationship n-tuples that are not automatically added to the training set. 8. A computer program product configured to respond to user input, the computer program product comprising: a computer-readable storage device; and computer-readable program code embodied on the computer-readable storage device, wherein the computer-readable program code, when executed by a data processing system, causes the data processing system to: assign respective initial confidence scores to relationship n-tuples in a knowledge graph (KG), wherein each of the relationship n-tuples designates at least a first entity, a second entity, and a relationship between the first and second entities or a single entity and a relationship between the single entity and one or more properties of the single entity; associate respective feature vectors with each of the relationship n-tuples; generate a training set that includes at least a subset of the relationship n-tuples labeled with respective ground truth labels; learn respective initial weights for the feature vectors based on the training set; generate respective subsequent confidence scores for each of the relationship n-tuples based on the initial weights for the feature vectors; and generate a response to user input based on the respective subsequent confidence scores for one or more of the relationship n-tuples in the KG. 9. The computer program product of claim 8, wherein the computer-readable program code, when executed by the data processing system, further causes the data processing system to: extract the relationship n-tuples from data; and populate the KG with the extracted relationship n-tuples. 10. The computer program product of claim 8, wherein the features vectors have associated dynamic features and associated static features and the computer-readable program code, when executed by the data processing system, further causes the data processing system to: determine that one or more of the dynamic features associated with one or more of the feature vectors has changed; in response to determining that one or more of the dynamic features associated with one or more of the feature vectors has changed, learn respective new weights for the feature vectors; and generate respective new confidence scores for each of the relationship n-tuples based on the new weights for the feature vectors. 11. The computer program product of claim 10, wherein the dynamic features include one or more of a ‘klout’ score and a ‘click log’ score. 12. The computer program product of claim 8, wherein the computer-readable program code, when executed by the data processing system, further causes the data processing system to: determine that one or more new relationship n-tuples should be promoted to the training set; modify the training set to include the new relationship n-tuples; learn respective new weights for the feature vectors based on the modified training set; and generate respective new confidence scores for each of the relationship n-tuples based on the new weights for the feature vectors. 13. The computer program product of claim 12, wherein the new relationship n-tuples are selected for promotion to the training set based on a confidence score and a robustness of the new relationship n-tuples. 14. The computer program product of claim 13, wherein the new relationship n-tuples that are automatically added to the training set are weighted differently than the new relationship n-tuples that are not automatically added to the training set. 15. A data processing system, comprising: a cache memory; and a processor coupled to the cache memory, wherein the processor is configured to: assign respective initial confidence scores to relationship n-tuples in a knowledge graph (KG), wherein each of the relationship n-tuples designates at least a first entity, a second entity, and a relationship between the first and second entities or a single entity and a relationship between the single entity and one or more properties of the single entity; associate respective feature vectors with each of the relationship n-tuples; generate a training set that includes at least a subset of the relationship n-tuples labeled with respective ground truth labels; learn respective initial weights for the feature vectors based on the training set; generate respective subsequent confidence scores for each of the relationship n-tuples based on the initial weights for the feature vectors; and generate a response to user input based on the respective subsequent confidence scores for one or more of the relationship n-tuples in the KG. 16. The data processing system of claim 15, wherein the processor is further configured to: extract the relationship n-tuples from data; and populate the KG with the extracted relationship n-tuples. 17. The data processing system of claim 15, wherein the features vectors have associated dynamic features and associated static features and the processor is further configured to: determine that one or more of the dynamic features associated with one or more of the feature vectors has changed; in response to determining that one or more of the dynamic features associated with one or more of the feature vectors has changed, learn respective new weights for the feature vectors; and generate respective new confidence scores for each of the relationship n-tuples based on the new weights for the feature vectors. 18. The data processing system of claim 17, wherein the dynamic features include one or more of a ‘klout’ score and a ‘click log’ score. 19. The data processing system of claim 15, wherein the processor is further configured to: determine that one or more new relationship n-tuples should be promoted to the training set; modify the training set to include the new relationship n-tuples; learn respective new weights for the feature vectors based on the modified training set; and generate respective new confidence scores for each of the relationship n-tuples based on the new weights for the feature vectors. 20. The data processing system of claim 19, wherein the new relationship n-tuples are selected for promotion to the training set based on a confidence score and a robustness of the new relationship n-tuples, and wherein the new relationship n-tuples that are automatically added to the training set are weighted differently than the new relationship n-tuples that are not automatically added to the training set.