Updating a Social Graph Based on Recency of Sharing Activity of Users of the Open Web
First Claim
1. A method comprising:
- receiving first activity information for a sender of a message to at least one recipient by a collection resource at a Web site, wherein the message comprises text and a first link added by the collection resource, and no personally identifiable information of the sender is collected in collecting the first activity information;
storing the first activity information at a storage server;
receiving second activity information when a recipient accesses the first link sent by the sender corresponding to the first activity information stored at the storage server, wherein no personally identifiable information of the recipient is collected in collecting the second activity information;
using at least one processor, attempting to identify a first node representative of the sender in a social graph;
when a first node representative of the sender in a social graph is not identified and after receiving the second activity information, creating a second node to represent the sender in the social graph; and
when the second node has inactive over a first amount of time, purging the second node from the social graph.
2 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. A technique can include a sender sending a first link to at least one recipient. When a first node representative of the sender in a social graph is not identified and after receiving the activity information, creating a second node to represent the sender in the social graph. The social graph can be updated based on a recency of the sharing activity.
21 Citations
28 Claims
-
1. A method comprising:
-
receiving first activity information for a sender of a message to at least one recipient by a collection resource at a Web site, wherein the message comprises text and a first link added by the collection resource, and no personally identifiable information of the sender is collected in collecting the first activity information; storing the first activity information at a storage server; receiving second activity information when a recipient accesses the first link sent by the sender corresponding to the first activity information stored at the storage server, wherein no personally identifiable information of the recipient is collected in collecting the second activity information; using at least one processor, attempting to identify a first node representative of the sender in a social graph; when a first node representative of the sender in a social graph is not identified and after receiving the second activity information, creating a second node to represent the sender in the social graph; and when the second node has inactive over a first amount of time, purging the second node from the social graph. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13)
-
-
14. A method comprising:
-
receiving first activity information for a sender of a message to at least one recipient by a collection resource at a Web site, wherein the message comprises text and a first link added by the collection resource, and no personally identifiable information of the sender is collected in collecting the first activity information; storing the first activity information at a storage server; receiving second activity information when a first recipient accesses the first link sent by the sender corresponding to the first activity information stored at the storage server, wherein no personally identifiable information of the first recipient is collected in the second activity information; using at least one processor, using the first activity information to identify a first node in a social graph as being representative of the sender; using the second activity information to identify a second node in the social graph as being representative of the first recipient; determining a category for the first link as a first category type; in the social graph, creating a first edge between the first and second nodes, wherein the first edge is representative of the first category type; and after a first amount of time has passed, reducing a weight of the first edge. - View Dependent Claims (15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28)
-
Specification