| US 11,714,868 B1 | ||
| Generating a suggestion inventory | ||
| Amit Datta, Los Angeles, CA (US); Aleksandra Korolova, Santa Monica, CA (US); Vasyl Pihur, Santa Monica, CA (US); Subhash Sankuratripati, Playa Vista, CA (US); and Balamurugan Anandan, Los Angeles, CA (US) | ||
| Assigned to Snap Inc., Santa Monica, CA (US) | ||
| Filed by Snap Inc., Santa Monica, CA (US) | ||
| Filed on Jul. 8, 2019, as Appl. No. 16/505,344. | ||
| Claims priority of provisional application 62/695,597, filed on Jul. 9, 2018. | ||
| Int. Cl. G06F 16/9536 (2019.01); G06F 16/901 (2019.01); G06Q 50/00 (2012.01); G06F 16/9535 (2019.01) | ||
| CPC G06F 16/9536 (2019.01) [G06F 16/9024 (2019.01); G06F 16/9535 (2019.01); G06Q 50/01 (2013.01)] | 20 Claims |
|
1. A method of generating a friend suggestion inventory in a social network, the method comprising:
accessing, by one or more processors, an entity graph that specifies connections between a plurality of users on the social network; selecting a particular user of the plurality of users who is directly connected to a given user on the social network; generating a set of candidate users by retrieving a predetermined number of users who are connected to the selected particular user; randomly or pseudo-randomly, selecting from the set of candidate users, a first candidate user; identifying a set of unique paths on the entity graph between the first candidate user and the given user, the set of unique paths comprising a first path having a first number of edges between the first candidate user and the given user and a second path having a second number of edges between the first candidate user and the given user, the second path being different from the first path; computing, by the one or more processors, a quantity of unique paths by counting how many unique paths are included in the set of unique paths between the first candidate user and the given user; determining, by the one or more processors, that the first candidate user satisfies suggestion criteria comprising:
that the quantity of unique paths exceeds a first threshold; and
that the set of unique paths include at least a minimum number of friends of the given user that are directly connected to the given user on the entity graph or at least a minimum number of friends of the first candidate user that are directly connected to the first candidate user; and
adding, by the one or more processors, the first candidate user to the friend suggestion inventory for the given user in response to determining that the first candidate user satisfies the suggestion criteria; and
comparing a quantity of friends of the given user to a threshold number of friends; and selecting a periodic interval at which to regenerate the friend suggestion inventory based on a result of comparing the quantity of friends of the given user to the threshold number of friends. |