IP Library Granted Patent US 11,113,300
Granted Patent B2
US 11,113,300 · App. 16/425,224 · Granted Sep 7, 2021

System and method for enabling interoperability between a first knowledge base and a second knowledge base

Inventors: Georgios Stoilos (London, GB); David Geleta (London, GB); Damir Juric (London, GB); Gregory McKay (London, GB); Jonathan Moore (London, GB); Jessica Tanon (London, GB); Claudia Schulz (London, GB); Mohammad Khodadadi (London, GB)
Assignee: Babylon Partners Limited
G06F16/25G06F16/2282G06F16/248G06F16/24578G06F16/27G06F16/284G06F16/288G06F40/279G06F40/295G06N5/022G06N5/04G16H50/70G06N20/00
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 11,113,300
App. No.
16/425,224
Granted
Sep 7, 2021
Kind
B2
Abstract

The subject-matter described herein relates to a computer-implemented method of enabling interoperability between a first knowledge base and a second knowledge base. Each knowledge base is graphically represented and includes a plurality of nodes each defining a concept and a plurality of relations linking the plurality of nodes. The first knowledge base and the second knowledge base are encoded using different coding standards. The method comprises: identifying an entity from the plurality of entities in the second knowledge base; obtaining a mapping between the identified entity from the second knowledge base and a matching entity from the first knowledge base; and creating and storing a link between the identified entity from the second knowledge base and the matching entity from the first knowledge base.

Claims (29)

1. A computer-implemented method of enabling interoperability between a first knowledge base and a second knowledge base,

wherein each knowledge base is graphically represented and includes a plurality of nodes each defining a concept and a plurality of relations linking the plurality of nodes,

wherein the first knowledge base and the second knowledge base are encoded using different coding standards, the method comprising:

identifying a first node in the second knowledge base;

identifying a first node in the first knowledge base that partially matches the first node in the second knowledge base, wherein identifying a partial match comprises identifying a key word of the first node in the first knowledge base within a key word of the first node in the second knowledge base;

identifying a second node in the first knowledge base that partially matches the first node in the second knowledge base;

adding a second node to the second knowledge base that matches the first node from the first knowledge base, and a third node to the second knowledge base that matches the second node from the first knowledge base;

generating and storing a link between the second node from the second knowledge base and the first node from the first knowledge base, and a link between the third node from the second knowledge base and the second node from the first knowledge base; and

generating and storing a relation between the first node from the second knowledge base and the second node from the second knowledge base, and between the first node from the second knowledge base and the third node from the second knowledge base, wherein:

the nodes in the first and second knowledge bases each include a label,

identifying the first node from the first knowledge base includes searching the first knowledge base for one or more labels having a key word of one or more key words matching a key word of one or more key words of a label of the first node from the second knowledge base,

identifying the second node in the first knowledge base includes searching the first knowledge base for one or more labels having a key word of one or more key words matching a key word of one or more key words of a label of the first node from the second knowledge base,

adding the second node to the second knowledge base comprises adding the second node to the second knowledge base to include a label having an exact linguistic match to the label of the first node from the first knowledge base, and

adding the third node to the second knowledge base comprises adding the third node to the second knowledge base to include a label having an exact linguistic match to the label of the second node from the first knowledge base.

2. The computer-implemented method of claim 1 wherein searching includes a key word search.

3. The computer-implemented method of claim 1 , further comprising sending the link to a user for verification.

4. A non-transitory computer-readable medium including instructions stored thereon that, when executed by a processor, cause the processor to perform the method of claim 1 .

5. A computer-implemented method of enabling interoperability between a first knowledge base and a second knowledge base,

wherein each knowledge base is graphically represented and includes a plurality of nodes each defining a concept and a plurality of relations linking the plurality of nodes,

wherein the first knowledge base and the second knowledge base are encoded using different coding standards, the method comprising:

identifying a first node in the first knowledge base;

identifying that no node in the second knowledge base matches the first node in the first knowledge base;

identifying a second node in the first knowledge base, the second node from the first knowledge base taxonomically linked to the first node from the first knowledge base, wherein the second node in the first knowledge base matches a first node in the second knowledge base;

adding a second node to the second knowledge base matching the first node from the first knowledge base;

adding a relation between the first and second nodes from the second knowledge base; and

generating and storing a link between the second node from the second knowledge base and the first node from the first knowledge base.

6. The computer-implemented method of claim 5 , wherein the nodes in the first and second knowledge bases include a label, and wherein identifying that no node from the second knowledge base matches the first node from the first knowledge base includes performing a search for a label that matches the first node from the first knowledge base, and returning no matches.

7. The computer-implemented method of claim 5 , further comprising sending the link to a user for verification.

8. A non-transitory computer-readable medium including instructions stored thereon that, when executed by a processor, cause the processor to perform the method of claim 5 .

Assignments (5)
CHANGE OF NAME Recorded Aug 13, 2025
From: EMED POPULATION HEALTH, LLC
To: EMED POPULATION HEALTH, INC.
Reel/Frame 072434/0946 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded May 23, 2025
From: EMED HEALTHCARE UK, LIMITED
To: EMED POPULATION HEALTH, LLC
Reel/Frame 071207/0882 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Nov 15, 2023
From: BABYLON PARTNERS LIMITED
To: EMED HEALTHCARE UK, LIMITED
Reel/Frame 065597/0640 →
CORRECTIVE ASSIGNMENT TO CORRECT THE EXECUTION DATE FOR THE LAST THREE INVENTORS PREVIOUSLY RECORDED ON REEL 049381 FRAME 0799. ASSIGNOR(S) HEREBY CONFIRMS THE ASSIGNMENT. Recorded Jun 3, 2021
From: GELETA, DAVID; JURIC, DAMIR; MCKAY, GREGORY; MOORE, JONATHAN; STOILOS, GEORGIOS; TANON, JESSICA; SCHULZ, CLAUDIA; KHODADADI, MOHAMMAD
To: BABYLON PARTNERS LIMITED
Reel/Frame 056475/0514 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jun 5, 2019
From: GELETA, DAVID; JURIC, DAMIR; MCKAY, GREGORY; MOORE, JONATHAN; STOILOS, GEORGIOS; TANON, JESSICA; SCHULZ, CLAUDIA; KHODADADI, MOHAMMAD
To: BABYLON PARTNERS LIMITED
Reel/Frame 049381/0799 →
Continuity (1)
Related Publication 20200380005A1 · Dec 3, 2020