Implicit social graph edge strengths
AssigneeAmazon Technologies, Inc.
InventorRussell A. Dicker
Life of this patent
Estimating the term…
Abstract
Techniques for calculating edge strengths for edges of a social graph are described herein. These techniques may determine an affinity between a first user of a social graph and a second user of the social graph. Based at least in part on this affinity, a strength of an edge connecting the first user and the second user on the social graph may be calculated and assigned to the corresponding edge.
Claims31
A method comprising:
- examining, by one or more processors, a social graph to determine, for a first user represented by a first node of the social graph, a group of users represented by respective other nodes that connect to the first node by respective edges of the social graph;
- analyzing, by the one or more processors, activity between the first user and each user of the group of users;
- determining, by the one or more processors, an affinity between the first user and each user of the group of users based at least in part on the analyzed activity;
- assigning, by the one or more processors, an edge strength indicative of the determined affinity to each of the respective edges of the social graph;
- and
- determining, by the one or more processors, a value of a gift for a second user of the group of users, the value of the gift based at least in part on the edge strength between the first user and the second user of the group of users.
One or more non-transitory computer-readable media storing computer-executable instructions that, when executed on one or more processors, perform acts comprising:
- determining an affinity between a first user and a second user based at least in part on behavior of at least one of the first user or the second user;
- calculating a strength of an edge of a social graph based at least in part on the determined affinity, the edge connecting the first user and the second user on the social graph and the social graph having at least one calculated edge strength that is different than another calculated edge strength;
- and
- a value for a gift for the second user, the value of the gift based at least in part on the calculated edge strength between the first user and the second user.
A method comprising:
- analyzing, by one or more processors, implicit data to determine an affinity between a first node and a second node on a social graph, wherein the first node is associated with a first person and the second node is associated with a second person;
- calculating, by the one or more processors, a score for an edge of the social graph based at least in part on the determined affinity;
- wherein on a site that employs the social graph, the first node is associated with a first user of the site corresponding to the first person, and the second node is associated with a second user of the site corresponding to the second person, and wherein the analyzed implicit data comprises activity of the first person, the second person, or both the first person and the second person that is not associated with the site;
- and
- determining, by the one or more processors, a value of a gift for the second person, the value of the gift based at least in part on the score for the edge of the social graph between the first node and second node.
One or more non-transitory computer-readable media storing computer-executable instructions that, when executed on one or more processors, performs acts comprising:
- analyzing behavior of a first user associated with a first node of a social graph, the behavior including:
- behavior of the first user on a social networking site represented by the social graph, and behavior of the first user that is not associated with the social networking site represented by the social graph;
- determining an affinity between the first user and a second user associated with a second node of the social graph based at least in part on the analyzed behavior;
- determining an affinity between the first user and a third user associated with a third node of the social graph based at least in part on the analyzed behavior;
- computing a score for an edge of the social graph that connects the first node and the second node based at least in part on the determined affinity;
- computing a score for an edge of the social graph that connects the first node and the third node based at least in part on the determined affinity;
- and
- determining, by the one or more processors, a value of a gift for the second user based at least in part on the score for the edge of the social graph that connects the first node and the second node and a value of a gift for a third user based at least in part on the score for the edge of the social graph that connects the first node and the third node, wherein the value of the gift for the second user is determined to be higher than the value of the gift for the third user based at least in part on the score for the edge of the social graph that connects the first node and the second node being higher than the score for the edge of the social graph that connects the first node and the third node.
A system comprising:
- one or more processors;
- memory, accessible by the one or more processors;
- a user behavior analysis module stored in the memory and executable on the one or more processors to analyze behavior of a first member in a social graph of a social networking site to determine an affinity between the first member and a second member in the social graph, wherein the user behavior analysis module is configured to analyze behavior of the first member on the social networking site and behavior of the first member that is not associated with the social networking site;
- an edge strength calculator stored in the memory and executable on the one or more processors to calculate an edge strength based at least in part on the determined affinity, the edge strength corresponding to an edge in the social graph connecting the first member and the second member;
- and
- social networking site to suggest a value of a gift for the second member, the value of the gift based at least in part on the edge strength of the edge that connects the first member and the second member.
Dependencies are inferred from the claim text.