IP Library › Granted Patent US 10,599,993
Granted Patent B2
US 10,599,993 · App. 15/004,009 · Granted Mar 24, 2020

Discovery of implicit relational knowledge by mining relational paths in structured data

Inventors: Kenneth J. Barker (Mahopac, NY); Mihaela A. Bornea (White Plains, NY)
Assignee: International Business Machines Corporation
G06N20/00G06N5/02G06N5/022G06N5/04
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 10,599,993
App. No.
15/004,009
Granted
Mar 24, 2020
Kind
B2
Abstract

Predefined relation items on paths traversing predefined entities of a knowledge base are collected and feature sets are assembled from the collected relation items. A classifier is computed for the feature sets and a relation score of a query pair of the entities is computed using the classifier.

Claims (32)

1. An apparatus comprising:

a memory that stores a knowledge base including predefined entities, wherein a graphical representation of the knowledge base includes nodes representing the predefined entities and edges coupling the nodes representing relationships between the predefined entities represented by the nodes, and wherein the relationships are indicated by predefined relation items;

a processor to:

receive a query for a plurality of entities;

identify paths in the graphical representation between the plurality of entities of the query, wherein the identified paths include intermediate entities along the paths and path segments coupling the intermediate entities to other entities, and wherein each path segment is associated with a predefined relation item;

collect the predefined relation items of the path segments of the identified paths;

assemble the collected predefined relation items into feature sets;

apply the feature sets to a machine learning classifier, wherein the machine learning classifier is trained with a training set of relation items along paths between known entities in the graphical representation; and

generate results for the query including a relation score indicating a measure of relatedness for the plurality of entities of the query using the machine learning classifier.

2. The apparatus of claim 1 , wherein the processor is further configured to:

form generalized path statements from the predefined relation items collected from the path segments of the identified paths; and

provide the generalized path statements as the feature set.

3. The apparatus of claim 2 , wherein the processor is further configured to:

replace entity names on each of the path segments with variables; and

interpose the variables between corresponding predefined relation items to form the generalized path statements.

4. The apparatus of claim 1 , wherein the identified paths include positive and negative relations.

5. The apparatus of claim 1 , wherein the predefined entities and relation items in the knowledge base are indicative of medical entities and relations.

6. A computer program product for implicit knowledge discovery in a knowledge base including predefined entities, wherein a graphical representation of the knowledge base includes nodes representing the predefined entities and edges coupling the nodes representing relationships between the predefined entities represented by the nodes, wherein the relationships are indicated by predefined relation items, the computer program product comprising a computer readable storage medium having program instructions embodied therewith, the program instructions executable by a processor to cause the processor to:

receive a query for a plurality of entities;

identify paths in the graphical representation between the plurality of entities of the query, wherein the identified paths include intermediate entities along the paths and path segments coupling the intermediate entities to other entities, and wherein each path segment is associated with a predefined relation item;

collect the predefined relation items of the path segments of the identified paths;

assemble the collected predefined relation items into feature sets;

apply the feature sets to a machine learning classifier, wherein the machine learning classifier is trained with a training set of relation items along paths between known entities in the graphical representation; and

generate results for the query including a relation score indicating a measure of relatedness for the plurality of entities of the query using the machine learning classifier.

7. The computer program product of claim 6 , wherein the program instructions embodied on the computer readable storage medium include program instructions that cause the processor to:

form generalized path statements from the predefined relation items collected from the path segments of the identified paths; and

provide the generalized path statements as the feature set.

8. The computer program product of claim 7 , wherein the program instructions embodied on the computer readable storage medium include program instructions that cause the processor to:

replace entity names on each of the path segments with variables; and

interpose the variables between corresponding predefined relation items to form the generalized path statements.

9. The computer program product of claim 6 , wherein the identified paths include positive and negative relations.

10. The computer program product of claim 6 , wherein the predefined entities and relation items in the knowledge base are indicative of medical entities and relations.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jan 22, 2016
From: BARKER, KENNETH J.; BORNEA, MIHAELA A.
To: INTERNATIONAL BUSINESS MACHINES CORPORATION
Reel/Frame 037557/0438 →
Continuity (1)
Related Publication 20170213136A1 · Jul 27, 2017