US 11,934,372 B2
Systems and methods for updating a knowledge graph through user input
Timothy Christensen Kelly, Austin, TX (US); Patrick Gerard Morgan, Wynnewood, PA (US); Brian Peterson, Barrington, IL (US); and Walter R. Klappert, North Hollywood, CA (US)
Assigned to Rovi Guides, Inc., San Jose, CA (US)
Filed by Rovi Guides, Inc., San Jose, CA (US)
Filed on Dec. 19, 2022, as Appl. No. 18/084,338.
Application 18/084,338 is a continuation of application No. 17/151,931, filed on Jan. 19, 2021, granted, now 11,561,955.
Application 17/151,931 is a continuation of application No. 16/133,134, filed on Sep. 17, 2018, granted, now 10,929,372, issued on Feb. 23, 2021.
Application 16/133,134 is a continuation of application No. 14/697,196, filed on Apr. 27, 2015, granted, now 10,078,651, issued on Sep. 18, 2018.
Prior Publication US 2023/0120173 A1, Apr. 20, 2023
This patent is subject to a terminal disclaimer.
Int. Cl. G06F 16/23 (2019.01); G06F 16/21 (2019.01); G06F 16/36 (2019.01); G06F 40/279 (2020.01)
CPC G06F 16/23 (2019.01) [G06F 16/217 (2019.01); G06F 16/367 (2019.01); G06F 40/279 (2020.01)] 18 Claims
OG exemplary drawing
 
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.