Systems and methods for updating a knowledge graph through user input

Patent metadata

Field	Value
Publication number	US-11934372-B2
Application number	US-202218084338-A
Country	US
Kind code	B2
Filing date	Dec 19, 2022
Priority date	Apr 27, 2015
Publication date	Mar 19, 2024
Grant date	Mar 19, 2024

Abstract

Methods and systems are disclosed herein for updating a knowledge graph based on a user confirmation. A media guidance application receives a user communication and isolates a term of the user communication. The media guidance application identifies a candidate component of a knowledge graph associated with the term. The media guidance application requests user input directed to confirming whether the term is associated with the candidate component. In response to receiving the user input, the media guidance application modifies a strength of association between the term and the component.

First claim

What is claimed is:

1. A method comprising:
receiving, via a user interface, a user communication;
determining whether a first term of the user communication corresponds to a node in a knowledge graph;
in response to determining that the first term corresponds to a node in the knowledge graph, generating for output, via the user interface, a recommendation associated with the first term; and
in response to determining that the first term does not correspond to any node in the knowledge graph:
generating for output, via the user interface, a prompt to confirm an association between the first term and a second term represented by a candidate node of the knowledge graph; and
in response to receiving, via the user interface, in response to the prompt, a confirmation of association between the first term and the second term, generating for output, via the user interface, a recommendation associated with the second term.

2. The method of claim 1 , further comprising creating a new node corresponding to the first term in response to receiving a confirmation of association between the first term and the second term.

3. The method of claim 2 , further comprising creating an edge connecting the new node with the candidate node in the knowledge graph in response to receiving a confirmation of association between the first term and the second term.

4. The method of claim 2 , further comprising:
receiving a second user communication;
identifying a third term of the second user communication, wherein the third term corresponds to the candidate node;
displaying a second prompt to confirm whether the third term is associated with the first term; and
in response to receiving a user input, modifying a strength of association between the new node and the candidate node.

5. The method of claim 4 , wherein modifying the strength of associated between the new node and the candidate node further comprises:
determining whether the user input confirms or denies that the third term is associated with the first term; and
in response to determining that the user input confirms that the third term is associated with the first term, increasing the strength of association between the new node and the candidate node.

6. The method of claim 4 , wherein modifying the strength of associated between the new node and the candidate node further comprises:
determining whether the user input confirms or denies that the third term is associated with the first term; and
in response to determining that the user input denies that the third term is associated with the first term, decreasing the strength of association between the new node and the candidate node.

7. The method of claim 4 , wherein the strength of association is represented by a weight allocated to an edge connecting the new node and the candidate node.

8. The method of claim 1 , further comprising providing information associated with an additional component of the knowledge graph that has high strength of association between the first term and the additional component.

9. The method of claim 1 , wherein the user communication is verbal or textual.

10. A system comprising:
storage circuitry configured to store a knowledge graph having a plurality of nodes and a plurality of edges;
communications circuitry configured to receive a user communication; and
control circuitry configured to:
receive, via a user interface, a user communication;
determine whether a first term of the user communication corresponds to a node in a knowledge graph;
in response to determining that the first term corresponds to a node in the knowledge graph, generate for output, via the user interface, a recommendation associated with the first term; and
in response to determining that the first term does not correspond to any node in the knowledge graph:
generate for output, via the user interface, a prompt to confirm an association between the first term and a second term represented by a candidate node of the knowledge graph; and
in response to receiving, via the user interface, in response to the prompt, a confirmation of association between the first term and the second term, generate for output, via the user interface, a recommendation associated with the second term.

11. The system of claim 10 , wherein the control circuitry is further configured to create a new node corresponding to the first term in response to receiving a confirmation of association between the first term and the second term.

12. The system of claim 11 , wherein the control circuitry is further configured to create an edge connecting the new node with the candidate node in the knowledge graph in response to receiving a confirmation of association between the first term and the second term.

13. The system of claim 11 , wherein the control circuitry is further configured to:
receive a second user communication;
identify a third term of the second user communication, wherein the third term corresponds to the candidate node;
display a second prompt to confirm whether the third term is associated with the first term; and
modify a strength of association between the new node and the candidate node in response to receiving a user input.

14. The system of claim 13 , wherein the control circuitry is further configured, when modifying the strength of associated between the new node and the candidate node, to:
determine whether the user input confirms or denies that the third term is associated with the first term; and
increase the strength of association between the new node and the candidate node in response to determining that the user input confirms that the third term is associated with the first term.

15. The system of claim 13 , wherein the control circuitry is further configured, when modifying the strength of associated between the new node and the candidate node, to:
determine whether the user input confirms or denies that the third term is associated with the first term; and
decrease the strength of association between the new node and the candidate node in response to determining that the user input denies that the third term is associated with the first term.

16. The system of claim 13 , wherein the strength of association is represented by a weight allocated to an edge connecting the new node and the candidate node.

17. The system of claim 11 , wherein the control circuitry is further configured to provide information associated with an additional component of the knowledge graph that has high strength of association between the first term and the additional component.

18. The system of claim 11 , wherein the user communication is verbal or textual.

Assignees

• Rovi Guides Inc

Inventors

• Kelly Timothy Christensen
• Morgan Patrick Gerard
• Peterson Brian
• Klappert Walter R

Classifications

• G06F16/23 Primary

  Updating · CPC title

• G06F16/217

  Database tuning (G06F16/2282 takes precedence; database performance monitoring G06F11/3409) · CPC title

• G06F16/367 Primary

  Ontology · CPC title

• G06F40/279

  Recognition of textual entities · CPC title