# US 2020/0349211 A1 · Content item audience selection

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

- Number: US 2020/0349211 A1
- Document ID: US20200349211A1
- Status: Published application
- Kind: A1
- Application number: 16/930,880
- Filed: 2020-07-16
- Published: 2020-11-05
- Earliest claimed: 2013-03-08
- Assignees: Google Inc.
- Applicants: Google LLC
- Inventors: Praveen Paritosh
- Web page: https://patentgrep.com/patent/US20200349211A1

## CPC

- G06F 16/9535: Search customisation based on user profiles and personalisation
- G06F 16/90324: {using system suggestions}
- G06F 16/335: Filtering based on additional data, e.g. user or group profiles (filtering in web context G06F16/9535, G06F16/9536)
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for selecting an audience for content are disclosed. In one aspect, a method includes receiving, from a content item provider, a request to distribute content items to users that have been deemed interested in a particular entity. First users that have expressed an interest in the particular entity are identified. Expansion entities for the particular entity are identified in a knowledge graph. At least one of the expansion entities can be connected to the particular entity by a relationship path. Second users are identified. The second users are deemed interested in the particular entity based on the second users having expressed an interest in an expansion entity. The content items are provided to at least a portion of the first users and at least a portion of the second users.

## Claims

### Claim 1

(canceled)

### Claim 2

A method performed by one or more data processing apparatus, wherein the one or more data processing apparatus comprise one or more processors configured to perform operations comprising:
receiving a request to distribute content to a specified number of users of a particular social network that are interested in a first entity;
determining that distribution of the content to users of the particular social network that have expressed an interest in the first entity will reach fewer than the specified number of users; and
in response to determining that the distribution will reach fewer than the specified number of users, using links in both of a social graph and a knowledge graph to expand an audience for the content beyond the users that have expressed an interest in the first entity, including:
identifying, within a social graph, links between nodes that identify a set of users that are socially connected, in the particular social network, to a particular user who has expressed an interest in the first entity;
after identifying the set of users, identifying a set of entities beyond the first entity in which the set of users have expressed an interest;
accessing the knowledge graph to identify one or more relationships that connect the set of entities to the first entity in the knowledge graph;
determining, based on the identified relationships, a largest number of entities from the set of entities that share a same relationship with the first entity;
classifying the same relationship to the first entity as an expansion relationship based on the largest number of entities sharing the same relationship with the first entity;
selecting the users in the particular social network that have expressed an interest in other entities that share the same relationship with the first entity, but have not expressed an interest in the first entity as additional audience members that will receive the content based on the same relationship being classified as an expansion relationship for the first entity; and
distributing the content to the users of the particular social network that have expressed an interest in the first entity as well as the additional audience members that have expressed an interest in the other entities.

### Claim 3 (depends on 2)

The method of claim 2, further comprising determining a relationship score for the same relationship based on a portion of the set of users who have expressed an interest in an entity that shares the same relationship with the first entity, wherein classifying the same relationship as an expansion relationship is further based on the relationship score.

### Claim 4 (depends on 3)

The method of claim 3, wherein determining the relationship score further comprises determining the relationship score based on a portion of the set of entities that share the same relationship with the first entity.

### Claim 5 (depends on 3)

The method of claim 3, further comprising:
classifying one or more additional relationships between the first entity and entities in the set of entities as an expansion relationship based on corresponding relationship scores for the one or more additional relationships meeting a relationship score threshold; and
distributing the content to users of the particular social network that have expressed an interest in the one or more additional entities, but have not expressed an interest in the first entity.

### Claim 6 (depends on 2)

The method of claim 2, wherein determining that distribution of the content to users of the particular social network that have expressed an interest in the first entity will reach fewer than the specified number of users comprises determining that fewer of than the specified number of users have interacted with a positive feedback element that references the first entity.

### Claim 7 (depends on 6)

The method of claim 6, wherein determining that fewer of than the specified number of users have interacted with a positive feedback element that references the first entity comprises determining that fewer of than the specified number of users have performed none of interacting with a positive feedback element that references the first entity, visiting a social network page about the first entity, and identifying the first entity as an interest in the users' social network profiles.

### Claim 8 (depends on 2)

The method of claim 2, wherein selecting the users as additional audience members comprises selecting, as additional audience members, only those users that are socially connected to the particular user in the particular social network and that have expressed an interest in at least one of the other entities.

### Claim 9

A system, comprising:
one or more data stores storing data representing a social graph and data representing a knowledge graph that is different from the social graph; and
one or more data processing apparatus comprising one or more processors, wherein the one or more processors interact with the one or more data stores and execute instructions that cause the one or more data processing apparatus to perform operations comprising:
receiving a request to distribute content to a specified number of users of a particular social network that are interested in a first entity;
determining that distribution of the content to users of the particular social network that have expressed an interest in the first entity will reach fewer than the specified number of users; and
in response to determining that the distribution will reach fewer than the specified number of users, using links in both of a social graph and a knowledge graph to expand an audience for the content beyond the users that have expressed an interest in the first entity, including:
identifying, within a social graph, links between nodes that identify a set of users that are socially connected, in the particular social network, to a particular user who has expressed an interest in the first entity;
after identifying the set of users, identifying a set of entities beyond the first entity in which the set of users have expressed an interest;
accessing the knowledge graph to identify one or more relationships that connect the set of entities to the first entity in the knowledge graph;
determining, based on the identified relationships, a largest number of entities from the set of entities that share a same relationship with the first entity;
classifying the same relationship to the first entity as an expansion relationship based on the largest number of entities sharing the same relationship with the first entity;
selecting the users in the particular social network that have expressed an interest in other entities that share the same relationship with the first entity, but have not expressed an interest in the first entity as additional audience members that will receive the content based on the same relationship being classified as an expansion relationship for the first entity; and
distributing the content to the users of the particular social network that have expressed an interest in the first entity as well as the additional audience members that have expressed an interest in the other entities.

### Claim 10 (depends on 9)

The system of claim 9, wherein the instructions cause the one or more data processing apparatus to perform operations comprising determining a relationship score for the same relationship based on a portion of the set of users who have expressed an interest in an entity that shares the same relationship with the first entity, wherein classifying the same relationship as an expansion relationship is further based on the relationship score.

### Claim 11 (depends on 10)

The system of claim 10, wherein determining the relationship score further comprises determining the relationship score based on a portion of the set of entities that share the same relationship with the first entity.

### Claim 12 (depends on 10)

The system of claim 10, wherein the instructions cause the one or more data processing apparatus to perform operations comprising:
classifying one or more additional relationships between the first entity and entities in the set of entities as an expansion relationship based on corresponding relationship scores for the one or more additional relationships meeting a relationship score threshold; and
distributing the content to users of the particular social network that have expressed an interest in the one or more additional entities, but have not expressed an interest in the first entity.

### Claim 13 (depends on 9)

The system of claim 9, wherein determining that distribution of the content to users of the particular social network that have expressed an interest in the first entity will reach fewer than the specified number of users comprises determining that fewer of than the specified number of users have interacted with a positive feedback element that references the first entity.

### Claim 14 (depends on 13)

The system of claim 13, wherein determining that fewer of than the specified number of users have interacted with a positive feedback element that references the first entity comprises determining that fewer of than the specified number of users have performed none of interacting with a positive feedback element that references the first entity, visiting a social network page about the first entity, and identifying the first entity as an interest in the users' social network profiles.

### Claim 15 (depends on 9)

The system of claim 9, wherein selecting the users as additional audience members comprises selecting, as additional audience members, only those users that are socially connected to the particular user in the particular social network and that have expressed an interest in at least one of the other entities.

### Claim 16

A non-transitory computer storage medium encoded with a computer program, the program comprising instructions that when executed by one or more data processing apparatus cause the one or more data processing apparatus to perform operations comprising:
receiving a request to distribute content to a specified number of users of a particular social network that are interested in a first entity;
determining that distribution of the content to users of the particular social network that have expressed an interest in the first entity will reach fewer than the specified number of users; and
in response to determining that the distribution will reach fewer than the specified number of users, using links in both of a social graph and a knowledge graph to expand an audience for the content beyond the users that have expressed an interest in the first entity, including:
identifying, within a social graph, links between nodes that identify a set of users that are socially connected, in the particular social network, to a particular user who has expressed an interest in the first entity;
after identifying the set of users, identifying a set of entities beyond the first entity in which the set of users have expressed an interest;
accessing the knowledge graph to identify one or more relationships that connect the set of entities to the first entity in the knowledge graph;
determining, based on the identified relationships, a largest number of entities from the set of entities that share a same relationship with the first entity;
classifying the same relationship to the first entity as an expansion relationship based on the largest number of entities sharing the same relationship with the first entity;
selecting the users in the particular social network that have expressed an interest in other entities that share the same relationship with the first entity, but have not expressed an interest in the first entity as additional audience members that will receive the content based on the same relationship being classified as an expansion relationship for the first entity; and
distributing the content to the users of the particular social network that have expressed an interest in the first entity as well as the additional audience members that have expressed an interest in the other entities.

### Claim 17 (depends on 16)

The non-transitory computer storage medium of claim 16, wherein the instructions cause the one or more data processing apparatus to perform operations comprising determining a relationship score for the same relationship based on a portion of the set of users who have expressed an interest in an entity that shares the same relationship with the first entity, wherein classifying the same relationship as an expansion relationship is further based on the relationship score.

### Claim 18 (depends on 17)

The non-transitory computer storage medium of claim 17, wherein determining the relationship score further comprises determining the relationship score based on a portion of the set of entities that share the same relationship with the first entity.

### Claim 19 (depends on 17)

The non-transitory computer storage medium of claim 17, wherein the instructions cause the one or more data processing apparatus to perform operations comprising:
classifying one or more additional relationships between the first entity and entities in the set of entities as an expansion relationship based on corresponding relationship scores for the one or more additional relationships meeting a relationship score threshold; and
distributing the content to users of the particular social network that have expressed an interest in the one or more additional entities, but have not expressed an interest in the first entity.

### Claim 20 (depends on 16)

The non-transitory computer storage medium of claim 16, wherein determining that distribution of the content to users of the particular social network that have expressed an interest in the first entity will reach fewer than the specified number of users comprises determining that fewer of than the specified number of users have interacted with a positive feedback element that references the first entity.

### Claim 21 (depends on 20)

The non-transitory computer storage medium of claim 20, wherein determining that fewer of than the specified number of users have interacted with a positive feedback element that references the first entity comprises determining that fewer of than the specified number of users have performed none of interacting with a positive feedback element that references the first entity, visiting a social network page about the first entity, and identifying the first entity as an interest in the users' social network profiles.
