Embeddings for feed and pages

Patent metadata

Field	Value
Publication number	US-2018268317-A1
Application number	US-201715460716-A
Country	US
Kind code	A1
Filing date	Mar 16, 2017
Priority date	Mar 16, 2017
Publication date	Sep 20, 2018
Grant date	—

Abstract

An embedding vector is the determined for a target user based on a weighted sum or the embedding vectors of entities the target user has interacted with in the past. Then, for each entity of a plurality of entities of the online system, a measure of similarity between the embedding vector of the user and the embedding vectors of the plurality of entities is determined. Based on the measure of similarity of each of the entities, the plurality of entities are ranked and one or more entities are selected to be presented to the user.

First claim

What is claimed is:

1 . A method comprising:
determining embedding vectors for a plurality of entities of a social networking system, the embedding vectors determined based on entity co-engagement by a set of users interacting with the plurality of entities; determining a user vector for a target user of the social networking system, the user vector based on a weighted sum of embedding vectors of entities the target user interacted with in the past; for each entity of a set of entities of the social networking system, determining a measure of similarity between the user vector and an embedding vector of the entity; ranking the set of entities based on the determined measure of similarity; and selecting a top threshold number of entities to be presented to the target user based on the ranking.

2 . The method of claim 1 , wherein the measure of similarity is a cosine similarity score between the user vector and the embedding vectors.

3 . The method of claim 1 , wherein determining a measure of similarity between the user vector and an embedding vector of the entity comprises:
determining a measure of similarity between the user vector and embedding vectors that are in a same orthant as the user vector.

4 . The method of claim 1 , wherein the measure of similarity between the user vector and an embedding vector of an entity is performed responsive to determining that the embedding vector of the entity is within a threshold Euclidean distance value of the user vector.

5 . The method of claim 1 , further comprising:
identifying one or more entities to be presented to the user based on a measure of similarity between an embedding vector of an entity the target user has previously interacted with and embedding vectors of the entities of the set of entities of the social networking system.

6 . The method of claim 1 , further comprising responsive to the user interacting with a first entity:
determining an embedding vector for the first entity; for each entity of the set of entities of the social networking system, determining a measure of similarity between the embedding vector of the first entity and an embedding vector of the entity; ranking the set of entities based on the determined measure of similarity; and selecting one or two entities to be presented to the target user based on the ranking.

7 . The method of claim 1 , wherein training the model based on entity co-engagement comprises:
training the model so that a distance between embedding vectors for two entities of the social networking system is based on a level of co-engagement of the two entities.

8 . The method of claim 1 , further comprising:
determining a level of engagement for each of the set of entities, the level of engagement directly proportional to an amount of engagement for an entity of the set of entities, and indirectly proportional to a number of users the entity was presented to; and filtering the set of entities based on the determined level of engagement.

9 . A non-transitory computer readable storage medium storing instructions, the instructions when executed by a processor cause the processor to:
determine embedding vectors for a plurality of entities of a social networking system, the embedding vectors determined based on entity co-engagement by a set of users interacting with the plurality of entities; determine a user vector for a target user of the social networking system, the user vector based on a weighted sum of embedding vectors of entities the target user interacted with in the past; for each entity of a set of entities of the social networking system, determine a measure of similarity between the user vector and an embedding vector of the entity; rank the set of entities based on the determined measure of similarity; and select a top threshold number of entities to be presented to the target user based on the ranking.

10 . The non-transitory computer readable storage medium of claim 9 , wherein the measure of similarity is a cosine similarity score between the user vector and the embedding vectors.

11 . The non-transitory computer readable storage medium of claim 9 , wherein determining a measure of similarity between the user vector and an embedding vector of the entity comprises:
determining a measure of similarity between the user vector and embedding vectors that are in a same orthant as the user vector.

12 . The non-transitory computer readable storage medium of claim 9 , wherein the measure of similarity between the user vector and an embedding vector of an entity is performed responsive to determining that the embedding vector of the entity is within a threshold Euclidean distance value of the user vector.

13 . The non-transitory computer readable storage medium of claim 9 , wherein the instructions further cause the processor to:
identify one or more entities to be presented to the user based on a measure of similarity between an embedding vector of an entity the target user has previously interacted with and embedding vectors of the entities of the set of entities of the social networking system.

14 . The non-transitory computer readable storage medium of claim 9 , wherein the instructions further cause the processor to responsive to the user interacting with a first entity:
determine an embedding vector for the first entity; for each entity of the set of entities of the social networking system, determine a measure of similarity between the embedding vector of the first entity and an embedding vector of the entity; rank the set of entities based on the determined measure of similarity; and select one or two entities to be presented to the target user based on the ranking.

15 . The non-transitory computer readable storage medium of claim 9 , wherein training the model based on entity co-engagement comprises:
training the model so that a distance between embedding vectors for two entities of the social networking system is based on a level of co-engagement of the two entities.

16 . The non-transitory computer readable storage medium of claim 9 , wherein the instructions further cause the processor to:
determine a level of engagement for each of the set of entities, the level of engagement directly proportional to an amount of engagement for an entity of the set of entities, and indirectly proportional to a number of users the entity was presented to; and filter the set of entities based on the determined level of engagement.

17 . A system comprising:
a processor; and non-transitory computer readable storage medium storing instructions, the instructions when executed by the processor cause the processor to:
determine embedding vectors for a plurality of entities of a social networking system, the embedding vectors determined based on entity co-engagement by a set of users interacting with the plurality of entities;
determine a user vector for a target user of the social networking system, the user vector based on a weighted sum of embedding vectors of entities the target user interacted with in the past;
for each entity of a set of entities of the social networking system, determine a measure of similarity between the user vector and an embedding vector of the entity;
rank the set of entities based on the determined measure of similarity; and
select a top threshold number of entities to be presented to the target user based on the ranking.

18 . The system of claim l 7 , wherein the measure of similarity is a cosine similarity score between the user vector and the embedding vect

Assignees

• Facebook Inc

Inventors

• Dharwadker Amey Ajit Porobo
• Hajarnis Sanjeet Uday

Classifications

• G06V10/761

  Proximity, similarity or dissimilarity measures · CPC title

• G06V10/764

  using classification, e.g. of video objects · CPC title

• G06Q10/40

  Business processes related to social networking or social networking services · CPC title

• G06F18/22

  Matching criteria, e.g. proximity measures · CPC title

• G06F18/24

  Classification techniques · CPC title