Building a social graph with sharing activity between users of the open web and inferring interest of a node based on edges between first-degree and second-degree nodes
First Claim
Patent Images
1. A method comprising:
- collecting activity data from a plurality of Web sources using a plurality of collection devices;
based the activity data, forming a social graph having a first node and a plurality of first-degree nodes connected to the first node, wherein each first-degree node is connected to a plurality of second-degree nodes;
determining edges between first-degree and second-degree nodes comprise a first category type;
determining no edges exist between the first node and the first-degree nodes of the first category type; and
based on the edges of the first category type between first-degree and second-degree nodes, using at least one processor, making an inference that the first node has an interest associated with the first category type.
4 Assignments
0 Petitions
Accused Products
Abstract
A social graph is built which includes interactions, sharing activity, and connections between the users of the open Web and can be used to improve ad targeting and content personalization. Sharing activity between two users will affect ads or content that both users will be presented while surfing the Web. This sharing activity includes sending of links, sending of videos, sending of files, cutting and pasting of content, sending text messages, and sending of e-mails. Interest of a node can be inferred based on edges between first-degree and second-degree nodes.
40 Citations
20 Claims
-
1. A method comprising:
-
collecting activity data from a plurality of Web sources using a plurality of collection devices; based the activity data, forming a social graph having a first node and a plurality of first-degree nodes connected to the first node, wherein each first-degree node is connected to a plurality of second-degree nodes; determining edges between first-degree and second-degree nodes comprise a first category type; determining no edges exist between the first node and the first-degree nodes of the first category type; and based on the edges of the first category type between first-degree and second-degree nodes, using at least one processor, making an inference that the first node has an interest associated with the first category type. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12)
-
-
13. A method comprising:
-
collecting activity data from a plurality of Web sources using a plurality of collection devices. wherein the activity data does not contain any personally identifiable information; based the activity data, forming a social graph having a first node and a plurality of first-degree nodes connected to the first node, wherein each first-degree node is connected to a plurality of second-degree nodes; determining edges between first-degree and second-degree nodes comprise a first category type; determining no edges exist between the first node and the first-degree nodes of the first category type; based on the edges of the first category type between first-degree and second-degree nodes, using at least one processor, making an inference that the first node has an interest associated with the first category type; and based on the inference that the first node has an interest associated with the first category type, selecting an advertisement associated with the first category type for delivery to a user corresponding to the first node in the social graph. - View Dependent Claims (14, 15, 16)
-
-
17. A method comprising:
-
collecting activity data from a plurality of Web sources using a plurality of collection devices, wherein the activity data does not contain any personally identifiable information; based the activity data, forming a social graph having a first node and a plurality of first-degree nodes connected to the first node, wherein each first-degree node is connected to a plurality of second-degree nodes, and the social graph has been formed without the use of any personally identifiable information; determining edges between first-degree and second-degree nodes comprise a first category type; determining no edges exist between the first node and the first-degree nodes of the first category type; based on the edges of the first category type between first-degree and second-degree nodes, using at least one processor, making an inference that the first node has an interest associated with the first category type; and based on the inference that the first node has an interest associated with the first category type, selecting an advertisement associated with the first category type for delivery to a user corresponding to the first node in the social graph. - View Dependent Claims (18, 19, 20)
-
Specification