Leveraging Information in a Social Network for Inferential Targeting of Advertisements

• US 20100257023A1
• Filed: 04/07/2009
• Published: 10/07/2010
• Est. Priority Date: 04/07/2009
• Status: Abandoned Application

• Current Assignee: Meta Platforms, Inc. (f/k/a Facebook, Inc.)
• Original Assignee: Meta Platforms, Inc. (f/k/a Facebook, Inc.)
• Inventors: Kendall, Timothy, Zhou, Ding
• Application Number:
  US12/419,958
• Publication Number:
  US 20100257023A1
• Time in Patent Office: Days
• US Class Current: 705/10
• CPC Class Codes: G06Q 30/02 Marketing; Price estimation or determination; Fundraising
• CPC Class Codes: G06Q 30/0207 Discounts or incentives, e.g. coupons or rebates
• CPC Class Codes: G06Q 30/0247 Calculate past, present or future revenues
• CPC Class Codes: G06Q 30/0254 based on statistics
• CPC Class Codes: G06Q 50/01 Social networking
• CPC Class Codes: H04L 67/306 User profiles

Abstract

A social network targets advertisements to its members using inferential ad targeting. An inferential ad enables advertisers to reach members that do not meet targeting criteria for lack of information. A member'"'"'s connections in the social network that satisfy the targeting criteria are leveraged to infer a targeted interest. An inferential ad is selected from a candidate set to be presented to the member. Varying complexities of targeting criteria, secondary inferential targeting criteria, and scopes of inference provide flexibility for inferential ad targeting in a social network.

Claims

1. A computer-implemented method for targeting advertisements to members of a social network, the method comprising:

receiving a request for an ad to be provided to a member of the social network;

accessing one or more ads, each ad comprising targeting criteria;

for each of the accessed ads, applying the targeting criteria of the ad to profile information for the member in the social network to determine whether the ad is a candidate for targeting to the member;

responsive to determining that the member'"'"'s profile lacks information for evaluating the targeting criteria, applying the targeting criteria of the ad to profile information for one or more other members of the social network to whom the member is connected, to determine whether the ad is a candidate for targeting to the member;

selecting an ad from the candidate ads determined for the member; and

sending the selected ad to an electronic device associated with the member.

2. The computer-implemented method of claim 1, wherein the request for an ad is a request for a web page containing an ad.

3. The computer-implemented method of claim 1, wherein targeting criteria comprises a first criteria to be applied to the member'"'"'s profile and a second criteria to be applied to the profiles of the other members connected to the member.

4. The computer-implemented method of claim 3, wherein the first criteria is different than the second criteria.

5. The computer-implemented method of claim 3, wherein the second criteria is a function of affinities between the member and the other members connected to the member.

6. The computer-implemented method of claim 3, wherein the second criteria evaluates a plurality of other members connected to the member and applies a predetermined threshold to the evaluations to determine whether the ad is a candidate for targeting to the member.

7. The computer-implemented method of claim 3, wherein the second criteria is applied to a subset of the profiles of the other members connected to the member, the subset determined based on a test.

8. The computer-implemented method of claim 1, wherein the targeting criteria is a function of a static property in the member'"'"'s profile.

9. The computer-implemented method of claim 1, wherein the targeting criteria is a function of a dynamic property in the member'"'"'s profile.

10. The computer-implemented method of claim 1, wherein the targeting criteria is applied to direct connections of the member.

11. The computer-implemented method of claim 1, wherein the targeting criteria is applied to direct and indirect connections of the member.

12. The computer-implemented method of claim 1, wherein selecting an ad for the member is a function of potential revenue, the selected ad maximizing the potential revenue.

13. The computer-implemented method of claim 1, wherein selecting an ad for the member comprises:

for each identified ad of the candidate set of ads;

computing an expected click-through rate (ECTR) weighted by the affinity for the connection, and

computing an expected value for each identified ad; and

selecting the identified ad with the highest expected value.

14. The computer-implemented method of claim 1, wherein selecting an ad for the member comprises:

for each identified ad of the candidate set of ads, each ad having identified connections'"'"' profiles that list the particular interest, ranking the ad by the member'"'"'s affinity for the connections; and

selecting the identified ad with the highest affinity.

15. The computer-implemented method of claim 1, wherein selecting an ad for the member comprises:

for each identified ad of the candidate set of ads, computing an expected click-through rate (ECTR) weighted by the affinity for the connection;

narrowing the candidate set of ads to the identified ads with computed ECTRs that exceed a predetermined threshold;

selecting the identified ad with the highest ECTR.

16. The computer-implemented method of claim 15, further comprising queuing the narrowed candidate set of ads for subsequent presentation.

17. The computer-implemented method of claim 1, wherein selecting an ad for the member comprises:

for each identified ad of the candidate set of ads, computing an expected click-through rate (ECTR) weighted by the affinity for the connection;

narrowing the candidate set of ads to the identified ads with computed ECTRs that exceed a predetermined threshold;

computing an expected value for each identified ad in the narrowed candidate set of ads; and

selecting the identified ad with the highest expected value.

18. The computer-implemented method of claim 17, further comprising queuing the narrowed candidate set of ads for subsequent presentation.

19. The computer-implemented method of claim 1, wherein selecting an ad for the member is a function of affinities between the member and the other members connected to the member, the selected ad having the highest affinity.

20. The computer-implemented method of claim 1, further comprising:

receiving feedback from the member corresponding to the selected ad;

recalculating the member'"'"'s affinities for the identified connections listing the particular interest;

storing the recalculated affinities in the member'"'"'s profile.

21. A computer-implemented method for targeting advertisements to members of a social network, the method comprising:

receiving a request for an ad to be provided to a member of the social network;

accessing one or more ads, each ad comprising targeting criteria;

for each of the accessed ads, a step for applying the targeting criteria of the ad to profile information for the member in the social network to determine whether the ad is a candidate for targeting to the member;

responsive to determining that the member'"'"'s profile lacks information for evaluating the targeting criteria, a step for applying the targeting criteria of the ad to profile information for one or more other members of the social network to whom the member is connected, to determine whether the ad is a candidate for targeting to the member;

a step for selecting an ad from the candidate ads determined for the member; and

sending the selected ad to an electronic device associated with the member.

22. A computer-implemented method for targeting advertisements, the method comprising:

maintaining a plurality of user accounts and a set of connections among the user accounts, wherein one or more of the user accounts includes one or more connections to other user accounts;

receiving a request for an ad to be provided to a user associated with one of the user accounts;

identifying one or more candidate ads to provide to the user, each candidate ad associated with targeting criteria;

for each of the candidate ads, applying the targeting criteria associated with the candidate ad to one or more of the user accounts that have connections to the user account associated with the user;

selecting at least one ad from the candidate ads based at least in part on the applying the targeting criteria associated with the candidate ad to one or more of the user accounts that have connections to the user account associated with the user; and

sending the selected ad to an electronic device associated with the user.

23. The method of claim 22, further comprising:

for each of the candidate ads, applying the targeting criteria associated with the candidate ad to the user account associated with the user;

wherein the selecting at least one ad from the candidate ads is also based on the applying the targeting criteria associated with the candidate ad to the user account associated with the user.

24. The method of claim 22, wherein one or more of the user accounts store static information about a user associated with the user account, and applying the targeting criteria to a user account comprises comparing the targeting criteria against the static information stored in the user account.

25. The method of claim 22, wherein one or more of the user accounts are associated with dynamic information about a user associated with the user account, and applying the targeting criteria to a user account comprises comparing the targeting criteria against the dynamic information associated with the user account.

26. A computerized system for targeting advertisements to members of a social network, the system comprising:

a member profile store containing profiles of members of the social network;

an ad store containing a plurality of ads, each ad comprising targeting criteria;

a communications server for communicating with member devices requesting advertisements; and

an ad server, communicatively coupled to the communications server, the member profile store, and the ad store, for targeting advertisements to the members of the social network using an inferential targeting method, the ad server comprising;

a module for receiving a request for an ad to be provided to a member of the social network;

a module for applying the targeting criteria of one or more of the ads to profile information for the member in the social network to determine whether the ad is a candidate for targeting to the member;

a module for applying, responsive to determining that the member'"'"'s profile lacks information for evaluating the targeting criteria, the targeting criteria of the ad to profile information for one or more other members of the social network to whom the member is connected, to determine whether the ad is a candidate for targeting to the member; and

a module for selecting an ad from the candidate ads determined for the member

27. The system of claim 26, wherein the targeting criteria comprises a first criteria to be applied to the member'"'"'s profile and a second criteria to be applied to the profiles of the other members connected to the member.

28. The system of claim 27, wherein the second criteria is a function of affinities between the member and the other members connected to the member.

29. The system of claim 27, wherein the second criteria evaluates a plurality of other members connected to the member and applies a predetermined threshold to the evaluations to determine whether the ad is a candidate for targeting to the member.

30. The system of claim 27, wherein the second criteria applies to a subset of the profiles of the other members connected to the member, the subset determined based on a test.

31. The system of claim 26, wherein the inferential targeting method selects an ad for the member as a function of potential revenue, the selected ad maximizing the potential revenue.

32. The system of claim 26, wherein the inferential targeting method selects an ad for the member as a function of affinities between the member and the other members connected to the member, the selected ad having the highest affinity.

33. The system of claim 26, wherein the communications server is further adapted to receive feedback from the member corresponding to the selected ad, and the ad server is further adapted to recalculate the member'"'"'s affinities for the identified connections listing the particular interest and store the recalculated affinities in the member'"'"'s profile in the member profile store.