TARGETING ADVERTISING BASED ON TRACKING CONTENT SHARING

• US 20120271719A1
• Filed: 04/25/2011
• Published: 10/25/2012
• Est. Priority Date: 04/25/2011
• Status: Abandoned Application

• Current Assignee: Riosoft Holdings, Inc.
• Original Assignee: Riosoft Holdings, Inc.
• Inventors: Straley, Ben, Young, Bradley, Anderson, Ben, Selvas, Filiberto
• Application Number:
  US13/093,805
• Publication Number:
  US 20120271719A1
• Time in Patent Office: Days
• US Class Current: 705/14.66
• CPC Class Codes: G06Q 30/02 Marketing; Price estimation or determination; Fundraising

Abstract

A facility for populating an advertising segment is described. For distinguished content, the facility accesses a data structure that, for each of two or more users, relates an instance of sharing of the distinguished content to the user with one or more instances of sharing the distinguished content from the user. The facility accesses a segment definition that specifies a test that, for each of the users, is either satisfied or not satisfied based upon the contents of the data structure. The facility selects the users for whom the test is satisfies, and constructs a list of identifiers identifying the selected users.

Claims

1. A method in a computing system for conducting an advertising campaign based upon the sharing of distinguished content, the method comprising:

each time a user seeks to access the distinguished content from a client computer system using a URL associated with the distinguished content;

determining whether a user identifier is represented in the URL;

if a user identifier is represented in the URL that is different from a user identifier that is persistently stored by the client computer system, augmenting a content sharing graph to add a node that indicates that the distinguished content has been shared with a user identified by the user identifier that is persistently stored by the client computer system by a user identified by the identifier represented in the URL;

receiving an advertising request indicating both a test to evaluate against the nodes of the content sharing graph and an advertising message that is to be presented to users represented by nodes of the content sharing graph that satisfy the test;

identifying the nodes of the content sharing graph that satisfy the test; and

transmitting a communication identifying the users represented by the identified nodes as candidates for receiving the indicated advertising message.

2. The method of claim 1 wherein the identifying a node of the content sharing graph depends on information about a second-or-greater-generation descendant of the node.

3. The method of claim 1, wherein the communication further indicates a bid amount for presenting the indicated advertising message to each of the identified users.

4. The method of claim 1, wherein the communication further indicates a number of times that the indicated advertising message is to be presented to users among the identified users.

5. A computer-readable medium whose contents are capable of causing a computing system to perform a method for populating an advertising segment, the method comprising:

for a selected piece of content, accessing a tree in which each non-root node represents a user and each edge between a parent and child pair of non-root nodes represents the sharing of the selected piece of content from the user represented by the parent node to the user represented by the child node;

accessing a segment definition specifying a test that, for each non-root node, is either satisfied for the node based on an analysis of the node'"'"'s subtree or not satisfied for the node based on an analysis of the node'"'"'s subtree;

identifying the non-root nodes for which the test is satisfied; and

constructing a list of identifiers identifying the users represented by the identified nodes.

6. The computer-readable medium of claim 5 wherein the accessed tree represents the sharing of a widget.

7. The computer-readable medium of claim 5 wherein the accessed tree represents the sharing of a portion of a web page.

8. The computer-readable medium of claim 5 wherein the accessed tree represents the sharing of a web page.

9. The computer-readable medium of claim 5 wherein the accessed tree represents the sharing of a group of web pages.

10. The computer-readable medium of claim 5 wherein the accessed tree represents the sharing of a web site.

11. The computer-readable medium of claim 5 wherein the tree is accessed in a document-oriented database representation.

12. The computer-readable medium of claim 5 wherein the method further comprises:

detecting instances in each of which the selected content is shared from a sharing source user to a sharing target user;

constructing the accessed tree by;

initializing the tree; and

for each detected instance of sharing, adding to the tree as a child of a node representing the sharing source user a node representing the sharing target user.

13. The computer-readable medium of claim 12 wherein at least one of the instances of sharing for which a node is added to the tree is an implicit instance of sharing first detectable from a request by sharing target user to retrieve the selected piece of content.

14. The computer-readable medium of claim 12 wherein at least one of the instances of sharing for which a node is added to the tree is an instance of sharing in which a reference to the selected piece of content is communicated from the sharing source user to the sharing target user via a channel not monitored as part of the detecting.

15. The computer-readable medium of claim 12 wherein at least one of the instances of sharing for which a node is added to the tree is an instance of sharing in which a reference to the selected piece of content is communicated from the sharing source user to the sharing target user via email.

16. The computer-readable medium of claim 12 wherein at least one of the instances of sharing for which a node is added to the tree is an instance of sharing in which a reference to the selected piece of content is communicated from the sharing source user to the sharing target user via instant message.

17. The computer-readable medium of claim 12 wherein at least one of the detected instances of sharing is to a sharing target user using a mobile device.

18. The computer-readable medium of claim 5 wherein the identifying involves analyzing each node'"'"'s subtree to a depth of at least two.

19. The computer-readable medium of claim 5 wherein the method further comprises conducting an advertising campaign using the constructed list of identifiers.

20. The computer-readable medium of claim 5 wherein the method further comprises transmitting the constructed list of identifiers to a computer system that selects advertising messages to be presented to users including users among the users identified by the identifiers of the list.

21. The computer-readable medium of claim 20 wherein the method further comprises transmitting to the computer system that selects advertising messages to be presented to users including users among the users identified by the identifiers of the list an indication of an advertising message that is to be presented to users among the users identified by the identifiers of the list.

22. A method for populating an advertising segment, comprising:

for distinguished content, accessing a data structure that, for each of a plurality of users, relates an instance of sharing the distinguished content to the user with one or more instances of sharing the distinguished content from the user;

accessing a segment definition specifying a test that, for each of the plurality of users, is either satisfied or not satisfied based upon the contents of the data structure;

identifying the users for whom the test is satisfied; and

constructing a list of identifiers identifying the identified users.

23. The method of claim 22, further comprising:

detecting a plurality of instances of sharing the distinguished content, each by;

receiving an HTTP request for a distinguished URL associated with the distinguished content;

in response to receiving the HTTP request, retrieving a user identifier associated with the distinguished URL;

if the received HTTP request contains a copy of the retrieved user identifier, responding to the received HTTP request by serving a page containing at least a portion of the distinguished content;

if the received HTTP request does not contain a copy of the retrieved user identifier;

generating a new URL associated with the distinguished content;

storing the new URL together with a user identifier for the user originating the received HTTP request and an indication that the user having the user identifier associated with the distinguished URL shared the distinguished content with the user originating the received HTTP request; and

responding to the received HTTP request with a redirect to the new URL.

24. The method of claim 22 where in the identifying involves, for each of at least a portion of the plurality of users, analyzing how the distinguished content was shared by users to whom the user shared the distinguished content.

25. One or more computer memories collectively storing an advertising segment definition data structure, comprising:

information specifying a test that can be performed against at least a portion of the nodes in a content sharing graph in which each node represents the user, and each edge from a source node to a destination node represents the sharing of the same piece of content from the user represented by the source node to the user represented by the destination node,

such that the path specified by the information contained by the data structure can be applied to each node of a content sharing graph in order to identify a set of users who belong to an advertising segment defined by the advertising segment definition data structure.

26. The computer memories of claim 25, wherein the test specified by the data structure is expressed in terms of a document-oriented database representing the sharing graph.

27. A computer-readable medium storing an advertising segment data structure for an advertising segment, comprising:

a plurality of identifiers each identifying a person who is a member of the advertising segment, each of the plurality of identifiers having been added to the advertising segment definition data structure based on determining that a test about how the selected piece of content was shared by users to whom the identified user shared the selected piece of content is satisfied,

such that the advertising segment data structure can be provided for use in directing an advertising campaign to the identified people.