System and method of optimizing social networks and user levels based on prior network interactions

• US 7,698,380 B1
• Filed: 12/14/2006
• Issued: 04/13/2010
• Est. Priority Date: 12/14/2006
• Status: Active Grant

• Current Assignee: Qurio Holdings Incorporated
• Original Assignee: Qurio Holdings Incorporated
• Inventors: Amidon, Christopher, Issa, Alfredo, Walsh, Richard
• Primary Examiner(s): Maung, Zarni
• Application Number:
  US11/638,922
• Time in Patent Office: 1,216 Days
• Field of Search: 709/217, 709/218, 709223-229
• US Class Current: 709/218
• CPC Class Codes: G06Q 10/04 Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem" market predictions or forecasting for commercial activities G06Q30/0202
• CPC Class Codes: H04L 12/185 with management of multicast group membership
• CPC Class Codes: H04L 51/04 Real-time or near real-time messaging, e.g. instant messaging [IM]

Abstract

An optimization server with associated databases for use in social networks utilizes previous interactions and other factors and parameters to optimize a user'"'"'s level in a social network. The optimization server may be configured to proactively and/or reactively optimize a user'"'"'s level in a social network by selecting previous social network instances, merging data from the selected instances into a single social network data representation, determining the shortest path between originating and recipient nodes in the network, and assigning a default level for the recipient node based on the shortest path. Additional optimization parameters may be applied to increase or decrease the recipient node'"'"'s default network level (within certain optionally established limits for change). Various parameters that may be utilized to optimize the social network may include, but are not limited to, user parameters, content classification, user classification, distribution history, existing FOAF definitions, and other external data.

Claims

1. A method for determining access rights of a node in a social network having a plurality of nodes, comprising:

for each of a plurality of first distributions of content among the plurality of nodes, generating a content path record identifying a nodal path of the content from an originating node through a plurality of recipient nodes;

storing each content path record in a memory;

receiving a request for a level indicator associated with one of the plurality of nodes during a second distribution of content;

identifying an originating node of the second distribution of content;

retrieving at least one content path record wherein;

the originating node of the second distribution of content is the same originating node as the originating node identified in the at least one content path record; and

the one of the plurality of nodes is the same as one recipient node of the plurality of recipient nodes identified in the at least one content path record;

calculating a number of recipient nodes in the nodal path identified in the at least one content path record between the originating node identified in the at least one content path record and the one of the plurality of recipient nodes identified in the at least one content path record;

determining the level indicator based on the number of recipient nodes in the nodal path; and

sending the level indicator in response to the request.

2. The method of claim 1 wherein retrieving the at least one content path record comprises retrieving a plurality of content path records wherein for each of the plurality of content path records:

the originating node of the second distribution of content is the same originating node as the originating node identified in the content path record; and

the one of the plurality of nodes is the same as one recipient node of the plurality of recipient nodes identified in the content path record,

wherein calculating the number of recipient nodes in the nodal path identified in the at least one content path record between the originating node identified in the at least one content path record and the one of the plurality of nodes further comprises calculating the number of recipient nodes in the nodal path identified in the content path record between the originating node identified in the at least one content path record and the one of the plurality of nodes for each of the plurality of content path records, and wherein determining the level indicator based on the number of recipient nodes in the nodal path comprises determining the level indicator based on a lowest number of recipient nodes calculated for the plurality of content path records.

3. The method of claim 1 further comprising receiving the level indicator, and providing access to one of a plurality of different versions of content based on the level indicator.

4. The method of claim 1 further comprising receiving the level indicator, selecting one of a plurality of different versions of content based on the level indicator, and sending the one of the plurality of different versions of content to the one of the plurality of nodes.

5. The method of claim 1 wherein the request for the level indicator is received from the one of the plurality of nodes.

6. The method of claim 1 wherein the request for the level indicator is received from a node immediately preceding the one of the plurality of nodes in the nodal path of the second distribution of content.

7. The method of claim 1 further comprising determining if the level indicator is greater than a maximum level indicator, and if so, setting the level indicator to the maximum level indicator.

8. A computer for determining access rights of a node in a social network having a plurality of nodes, the computer adapted to:

for each of a plurality of first distributions of content among the plurality of nodes, generate a content path record identifying a nodal path of the content from an originating node through a plurality of recipient nodes;

store each content path record in a memory;

receive a request for a level indicator associated with one of the plurality of nodes during a second distribution of content;

identify an originating node of the second distribution of content;

retrieve at least one content path record wherein;

the originating node of the second distribution of content is the same originating node as the originating node identified in the at least one content path record; and

the one of the plurality of nodes is the same as one recipient node of the plurality of recipient nodes identified in the at least one content path record;

calculate a number of recipient nodes in the nodal path identified in the at least one content path record between the originating node and the one of the plurality of recipient nodes identified in the at least one content path record;

determine the level indicator based on the number of recipient nodes in the nodal path; and

send the level indicator in response to the request.

9. The computer of claim 8 wherein to retrieve the at least one content path record the computer is further adapted to retrieve a plurality of content path records wherein for each of the plurality of content path records:

the originating node of the second distribution of content is the same originating node as the originating node identified in the content path record; and

the one of the plurality of nodes is the same as one recipient node of the plurality of recipient nodes identified in the content path record,

wherein to calculate the number of recipient nodes in the nodal path identified in the at least one content path record between the originating node identified in the at least one content path record and the one of the plurality of nodes the computer is further adapted to calculate the number of recipient nodes in the nodal path identified in the content path record between the originating node identified in the at least one content path record and the one of the plurality of nodes for each of the plurality of content path records, and wherein to determine the level indicator based on the number of recipient nodes in the nodal path the computer is further adapted to determine the level indicator based on a lowest number of recipient nodes calculated for the plurality of content path records.

10. The computer of claim 8 wherein the request for the level indicator is received from the one of the plurality of nodes.

11. The computer of claim 8 wherein the request for the level indicator is received from a node immediately preceding the one of the plurality of nodes in the nodal path of the second distribution of content.

12. The computer method of claim 8 wherein the computer is further adapted to determine if the level indicator is greater than a maximum level indicator, and if so, setting the level indicator to the maximum level indicator.

13. A computer program product comprising a computer usable storage medium having a computer readable program code embodied therein, the computer readable program code adapted to be executed on a processor implementing a method for determining access rights of a node in a social network having a plurality of nodes, comprising:

for each of a plurality of first distributions of content among the plurality of nodes, generating a content path record identifying a nodal path of the content from an originating node through a plurality of recipient nodes;

storing each content path record in a memory;

receiving a request for a level indicator associated with one of the plurality of nodes during a second distribution of content;

identifying an originating node of the second distribution of content;

retrieving at least one content path record wherein;

the originating node of the second distribution of content is the same originating node as the originating node identified in the at least one content path record; and

the one of the plurality of nodes is the same as one recipient node of the plurality of recipient nodes identified in the at least one content path record;

calculating a number of recipient nodes in the nodal path identified in the at least one content path record between the originating node identified in the at least one content path record and the one of the plurality of recipient nodes identified in the at least one content path record;

determining the level indicator based on the number of recipient nodes in the nodal path; and

sending the level indicator in response to the request.

14. The computer program product of claim 13 wherein retrieving the at least one content path record comprises retrieving a plurality of content path records wherein for each of the plurality of content path records:

the originating node of the second distribution of content is the same originating node as the originating node identified in the content path record; and

the one of the plurality of nodes is the same as one recipient node of the plurality of recipient nodes identified in the content path record,

wherein calculating the number of recipient nodes in the nodal path identified in the at least one content path record between the originating node identified in the at least one content path record and the one of the plurality of nodes further comprises calculating the number of recipient nodes in the nodal path identified in the content path record between the originating node identified in the at least one content path record and the one of the plurality of nodes for each of the plurality of content path records, and wherein determining the level indicator based on the number of recipient nodes in the nodal path comprises determining the level indicator based on a lowest number of recipient nodes calculated for the plurality of content path records.

15. The computer program product of claim 13 further comprising receiving the level indicator, and providing access to one of a plurality of different versions of content based on the level indicator.

16. The computer program product of claim 13 further comprising receiving the level indicator, selecting one of a plurality of different versions of content based on the level indicator, and sending the one of the plurality of different versions of content to the one of the plurality of nodes.

17. The computer program product of claim 13 wherein the request for the level indicator is received from the one of the plurality of nodes.

18. The computer program product of claim 13 wherein the request for the level indicator is received from a node immediately preceding the one of the plurality of nodes in the nodal path of the second distribution of content.

19. The computer program product of claim 13 further comprising determining if the level indicator is greater than a maximum level indicator, and if so, setting the level indicator to the maximum level indicator.