# US 2017/0286565 A1 · Relationship graph

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2017/0286565 A1
- Document ID: US20170286565A1
- Status: Published application
- Kind: A1
- Application number: 15/627,873
- Filed: 2017-06-20
- Published: 2017-10-05
- Earliest claimed: 2011-06-23
- Assignees: Fullcontact, Inc.
- Applicants: FullContact, Inc.
- Inventors: Scott Brave; Daniel Kenton Lynn
- Web page: https://patentgrep.com/patent/US20170286565A1

## CPC

- G06F 16/9024: {Graphs; Linked lists (G06F16/9027 takes precedence)}
- G06F 16/2458: Special types of queries, e.g. statistical queries, fuzzy queries or distributed queries
- G06F 16/288: {Entity relationship models}
- G06Q 10/00: Administration; Management
- G06Q 10/107: Computer-aided management of electronic mailing [e-mailing]
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- G06Q: INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR

## 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

### Claim 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 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.

### Claim 2 (depends on 1)

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.

### Claim 3 (depends on 1)

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.

### Claim 4 (depends on 1)

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

### Claim 5 (depends on 4)

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

### Claim 6 (depends on 1)

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.
