OPTIMIZATION OF SOCIAL DISTRIBUTION NETWORKS

• US 20090228296A1
• Filed: 03/04/2009
• Published: 09/10/2009
• Est. Priority Date: 03/04/2008
• Status: Abandoned Application

• Current Assignee: Collarity Incorporated
• Original Assignee: Collarity Incorporated
• Inventors: Ismalon, Emil
• Application Number:
  US12/397,510
• Publication Number:
  US 20090228296A1
• Time in Patent Office: Days
• US Class Current: 705/319
• CPC Class Codes: G06Q 30/02 Marketing; Price estimation or determination; Fundraising
• CPC Class Codes: G06Q 50/01 Social networking
• CPC Class Codes: H04L 67/535 Tracking the activity of the user network monitoring arrangements H04L43/00; recording of computer activity G06F11/34

Abstract

A computer-implemented method is provided, which includes labeling an object with one or more object terms that characterize the object. A social graph is constructed that represents an online social network, the social graph having vertices that represent respective members of the social network, and links that represent social connections between respective pairs of the members. Each of the links is tagged with one or more link terms that represent common interests between two of the members whose vertices are connected by the link. Responsively to a comparison of the object terms and the link terms with which the links have been tagged, respective distribution ranks are calculated for a plurality of the members. A message is sent to one of the members of the social network suggesting that the member distribute the object to a subset of the members responsively at least in part to the distribution ranks.

Claims

1. A computer-implemented method comprising:

labeling, by a computer, an object with one or more object terms that characterize the object;

constructing, by the computer, a social graph that represents an online social network, the social graph having vertices that represent respective members of the social network, and links that represent social connections between respective pairs of the members;

tagging, by the computer, each of the links with one or more link terms that represent common interests between two of the members whose vertices are connected by the link;

responsively to a comparison of the object terms and the link terms with which the links have been tagged, calculating, by the computer, respective distribution ranks for a plurality of the members; and

sending, by the computer, a message to one of the members of the social network suggesting that the member distribute the object to a subset of the members responsively at least in part to the distribution ranks.

2. The method according to claim 1, wherein calculating the respective distribution ranks comprises:

constructing, for the object, a distribution graph that comprises a subgraph of the social graph including only those vertices and links of the social graph tagged with at least one of the social terms corresponding to at least one of the object terms; and

using the distribution graph to calculate the respective distribution ranks.

3. The method according to claim 1, wherein tagging comprises finding the common interests for each of the links responsively to previous distribution of one or more previous objects between the two of the members.

4. The method according to claim 1, wherein tagging comprises finding the common interests for each of the links responsively to a comparison of respective profiles of the two of the members.

5. The method according to claim 1, wherein tagging comprises tagging each of the links with the link terms and one or more terms related to at least one of the link terms.

6. The method according to claim 1, wherein the links comprise respective edges.

7. The method according to claim 1, wherein the links comprise respective semantic graphs.

8. The method according to claim 1, wherein the object comprises an application.

9. Apparatus comprising:

an interface; and

a processor, which is configured to label an object with one or more object terms that characterize the object;

construct a social graph that represents an online social network, the social graph having vertices that represent respective members of the social network, and links that represent social connections between respective pairs of the members;

tag each of the links with one or more link terms that represent common interests between two of the members whose vertices are connected by the link;

responsively to a comparison of the object terms and the link terms with which the links have been tagged, calculate respective distribution ranks for a plurality of the members; and

send, via the interface, a message to one of the members of the social network suggesting that the member distribute the object to a subset of the members responsively at least in part to the distribution ranks.

10. The apparatus according to claim 9, wherein the processor is configured to calculate the respective distribution ranks by constructing, for the object, a distribution graph that comprises a subgraph of the social graph including only those vertices and links of the social graph tagged with at least one of the social terms corresponding to at least one of the object terms;

and using the distribution graph to calculate the respective distribution ranks.

11. The apparatus according to claim 9, wherein the processor is configured to find the common interests for each of the links responsively to previous distribution of one or more previous objects between the two of the members.

12. The apparatus according to claim 9, wherein the processor is configured to find the common interests for each of the links responsively to a comparison of respective profiles of the two of the members.

13. The apparatus according to claim 9, wherein the processor is configured to tag each of the links with the link terms and one or more terms related to at least one of the link terms.

14. The apparatus according to claim 9, wherein the object comprises an application.

15. A computer software comprising a tangible computer-readable medium in which program instructions are stored, which instructions, when read by a computer, cause the computer to label an object with one or more object terms that characterize the object;

construct a social graph that represents an online social network, the social graph having vertices that represent respective members of the social network, and links that represent social connections between respective pairs of the members;

tag each of the links with one or more link terms that represent common interests between two of the members whose vertices are connected by the link;

responsively to a comparison of the object terms and the link terms with which the links have been tagged, calculate respective distribution ranks for a plurality of the members; and

send a message to one of the members of the social network suggesting that the member distribute the object to a subset of the members responsively at least in part to the distribution ranks.

16. The product according to claim 15, wherein the instructions cause the computer to calculate the respective distribution ranks by constructing, for the object, a distribution graph that comprises a subgraph of the social graph including only those vertices and links of the social graph tagged with at least one of the social terms corresponding to at least one of the object terms;

and using the distribution graph to calculate the respective distribution ranks.

17. The product according to claim 15, wherein the instructions cause the computer to find the common interests for each of the links responsively to previous distribution of one or more previous objects between the two of the members.

18. The product according to claim 15, wherein the instructions cause the computer to find the common interests for each of the links responsively to a comparison of respective profiles of the two of the members.

19. The product according to claim 15, wherein the object comprises an application.

20. Apparatus comprising:

means for labeling an object with one or more object terms that characterize the object;

means for constructing a social graph that represents an online social network, the social graph having vertices that represent respective members of the social network, and links that represent social connections between respective pairs of the members;

means for tagging each of the links with one or more link terms that represent common interests between two of the members whose vertices are connected by the link;

means for calculating, responsively to a comparison of the object terms and the link terms with which the links have been tagged, respective distribution ranks for a plurality of the members; and

means for sending a message to one of the members of the social network suggesting that the member distribute the object to a subset of the members responsively at least in part to the distribution ranks.