IP Library Granted Patent US 10,445,371
Granted Patent B2
US 10,445,371 · App. 15/627,873 · Granted Oct 15, 2019

Relationship graph

Inventors: Scott Brave (Louisville, CO); Daniel Kenton Lynn (Littleton, CO)
Assignee: FULLCONTACT, INC.
G06F16/9024G06F16/2458G06F16/288G06Q10/107
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,445,371
App. No.
15/627,873
Granted
Oct 15, 2019
Kind
B2
Abstract

A relationship graph system disclosed herein provides a system and method for inferring relationships between various entities based on analysis of a plurality of observations including elements related to two different entities. The method comprises representing each of the plurality of observations using a relationship edge between two nodes, each of the two nodes representing an element related to one of the two different entities, assigning a score to each relationship edge based on metadata related to the observation represented by the relationship edge, combining a plurality of relationship edges between the elements related to the two different entities to generate an aggregate relationship edge between the two different entities, and inferring a relationship between the two different entities based on length of the aggregate relationship edge between the two different entities.

Claims (30)

1. A computer implemented method comprising:

analyzing a plurality of observations including elements related to two different entities;

representing each of the plurality of observations in an information cataloging system executed by one or more hardware processors by storing the observations in a database using a relationship edge between two nodes, each of the two nodes representing an element related to one of the two different entities;

assigning, using the information cataloging system, a score to each relationship edge based on metadata related to the observation represented by the relationship edge;

combining a plurality of relationship edges between the elements related to the two different entities to generate an aggregate relationship edge between the two different entities, wherein the plurality of relationship edges each correspond to different respective ones of the plurality of observations;

inferring, using the information cataloging system, a relationship between the two different entities based on length of the aggregate relationship edge between the two different entities; and

cataloging the relationship in the information cataloging system by storing the relationship in the database, wherein the information cataloging system configured to respond to a user query based on the cataloged relationship.

2. The method of claim 1 , further comprising computing the length of the aggregate relationship edge between the two different entities by:

computing length of each of the plurality of relationship edges between the elements related to the two different entities; and

computing the length of the aggregate relationship edge between the two different entities using a combination of the length of each of the plurality of relationship edges between the elements related to the two different entities.

3. The method of claim 1 , wherein assigning a score to each relationship edge further comprises assigning a score based on recency of the observation represented by the relationship edge.

4. The method of claim 1 , further comprising assigning a trustworthiness score to each of the plurality of observations.

5. The method of claim 4 , wherein assigning a score to each relationship edge further comprises assigning the score based on the trustworthiness score of the observation represented by the relationship edge.

6. The method of claim 1 , further comprising combining one or more of the plurality of relationship edges between the elements related to the two different entities with one or more of identification edges related to the nodes of the one or more of the plurality of relationship edges.

7. A non-transitory computer-readable storage medium embodied with computer-executable instructions for executing, on one or more processors and circuits of a device, a process comprising:

analyzing a plurality of observations including elements related to two different entities;

representing each of the plurality of observations in an information cataloging system executed by one or more hardware processors by storing the observations in a database using a relationship edge between two nodes, each of the two nodes representing an element related to one of the two different entities;

assigning, using the information cataloging system, a score to each relationship edge based on metadata related to the observation represented by the relationship edge;

combining a plurality of relationship edges between the elements related to the two different entities to generate an aggregate relationship edge between the two different entities, wherein the plurality of relationship edges each correspond to different respective ones of the plurality of observations;

inferring, using the information cataloging system, a relationship between the two different entities based on length of the aggregate relationship edge between the two different entities; and

cataloging the relationship in the information cataloging system by storing the relationship in the database, wherein the information cataloging system configured to respond to a user query based on the cataloged relationship.

8. The non-transitory computer-readable storage medium of claim 7 , the process further comprising computing the length of the aggregate relationship edge between the two different entities by:

computing length of each of the plurality of relationship edges between the elements related to the two different entities; and

computing the length of the aggregate relationship edge between the two different entities using a combination of the length of each of the plurality of relationship edges between the elements related to the two different entities.

9. The non-transitory computer-readable storage medium of claim 7 , wherein assigning a score to each relationship edge further comprises assigning a score based on recency of the observation represented by the relationship edge.

10. The non-transitory computer-readable storage medium of claim 7 , the process further comprising:

assigning a trustworthiness score to each of the plurality of observations.

11. The non-transitory computer-readable storage medium of claim 10 , wherein assigning a score to each relationship edge further comprises assigning the score based on the trustworthiness score of the observation represented by the relationship edge.

12. The non-transitory computer-readable storage medium of claim 7 , the process further comprising:

combining one or more of the plurality of relationship edges between the elements related to the two different entities with one or more identification edges related to the nodes of the one or more of the plurality of relationship edges.

Assignments (3)
CHANGE OF NAME Recorded Jan 14, 2025
From: FULLCONTACT, INC.
To: FIDEO INTELLIGENCE, INC.
Reel/Frame 069897/0705 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Oct 25, 2019
From: BRAVE, SCOTT; LYNN, DANIEL KENTON
To: FULLCONTACT, INC.
Reel/Frame 050833/0001 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 4, 2017
From: BRAVE, SCOTT; LYNN, DANIEL KENTON
To: FULLCONTACT, INC.
Reel/Frame 043202/0246 →
Continuity (3)
Continuation In Part 13530413 · Jun 22, 2012
Provisional Application 61500454 · Jun 23, 2011
Related Publication 20170286565A1 · Oct 5, 2017
Cited By (1)
US 12,689,637