US 11,741,379 B2
Automated resolution of over and under-specification in a knowledge graph
Craig M. Trim, Ventura, CA (US); Mary E. Rudden, Denver, CO (US); Mauro Marzorati, Lutz, FL (US); and Jeremy R. Fox, Georgetown, TX (US)
Assigned to KYNDRYL, INC., New York, NY (US)
Filed by Kyndryl, Inc., New York, NY (US)
Filed on Aug. 29, 2022, as Appl. No. 17/897,923.
Application 17/897,923 is a continuation of application No. 16/425,102, filed on May 29, 2019, granted, now 11,475,318.
Prior Publication US 2022/0414491 A1, Dec. 29, 2022
This patent is subject to a terminal disclaimer.
Int. Cl. G06N 5/02 (2023.01); G06N 5/022 (2023.01); G06N 5/04 (2023.01); G06F 18/231 (2023.01); G06F 18/2115 (2023.01); G06F 18/21 (2023.01)
CPC G06N 5/022 (2013.01) [G06F 18/2115 (2023.01); G06F 18/2185 (2023.01); G06F 18/231 (2023.01); G06N 5/04 (2013.01)] 20 Claims
OG exemplary drawing
 
1. A system comprising:
a processor, a computer readable memory and a computer readable storage medium associated with a computing device;
program instructions to determine over-specification of a knowledge graph generated for a knowledge base, based on one or more object clusters of the knowledge graph having less than a threshold amount of data points; and
program instructions to re-initialize the knowledge graph based on the determining the over-specification to generate an updated knowledge graph wherein entities of the one or more object clusters of the knowledge graph are subsumed into a single object cluster of the updated knowledge graph,
wherein the program instructions are stored on the computer readable storage medium for execution by the processor via the computer readable memory.