Online social network management system and method for simulating users to build various faces of relation

• US 8,239,499 B2
• Filed: 03/15/2006
• Issued: 08/07/2012
• Est. Priority Date: 03/15/2005
• Status: Active Grant

• Current Assignee: NHN Corporation
• Original Assignee: NHN Corporation
• Inventors: Kwon, Oh Sung
• Primary Examiner(s): Moore, Ian N
• Assistant Examiner(s): ALEXANDER, JENEE LAUREN
• Application Number:
  US11/817,568
• Publication Number:
  US 20080288612A1
• Time in Patent Office: 2,337 Days
• Field of Search: 709220-222, 709/223, 709/217, 707100-1041, 715700-759
• US Class Current: 709/220
• CPC Class Codes: G06Q 10/00 Administration; Management

Abstract

A system and method of managing a social network are disclosed. The method includes the step of recording the IDs and corresponding personal information of users who have subscribed to a service via a network, in a user DB; the step of recording corresponding relationships between the users and relationship indices R, reflecting the degrees of trustworthiness of the users having the corresponding relationships, in a relationship information DB; and the path search step of evaluating one or more paths based on the relationship indices R of respective links constituting the paths and providing evaluation results to a first user so that the first user can select an optimal path from among the paths existing between the first user and a second user on the social network constructed with the users used as nodes and the corresponding relationships of the users used as the links.

Claims

1. A computer-implemented method of managing a social network, the method comprising:

receiving a request from a first user to establish a connection with a second user via a network;

calculating, in response to the request, costs of one or more paths based on a relationship index with the second user for searching for an optimal path, wherein the cost of each of the one or more paths is calculated by assigning a weight value to each of the one or more paths in an inverse proportion to the relationship index between the first user and the second user; and

selectively providing one or more paths according to the calculation for the optimal connection between the first user and the second user, wherein the optimal path comprises a path using an intermediate user of the social network, and the path is generated associated with an incentive granted to the intermediate user by subtracting the calculated costs from the first user, the second user, or both of the first user and the second user, wherein the selectively providing further comprises establishing at least one path according to the calculated costs of the one or more paths via one or more intermediate users.

2. The method of claim 1, wherein the relationship index is determined based upon a respective direct connection path and indirect connection paths between the first user and the second user.

3. The method of claim 1, further comprising:

updating the relationship index and the weight value based on an optimal path associated with an successful connection established with the provided one or more paths.

4. The method of claim 1, further comprising:

charging a cost for the connection, wherein the cost is determined based on the selected path and each connection of the selected path.

5. The method of claim 4, further comprising:

displaying cost information for each of the provided paths for selecting the optimum path between the first user and the second user.

6. The method of claim 5, wherein the cost information is proportional to the relationship index between the first user and the second user.

7. The method of claim 1, further comprising:

searching, in response to the request by the first user, for the second user based on a searching condition provided by the second user.

8. The method of claim 1, further comprising:

searching for the second user based on predetermined searching criteria.

9. The method of claim 1, further comprising:

requesting at least one intermediate user to function as a bridge for establishing the connection between the first user and the second user.

10. The method of claim 1, wherein information shared between the first user and the second user is limited based on the relationship index.

11. A non-transitory computer-readable recording medium comprising a computer executable program, which when executed, performs the method of claim 1.

12. The method of claim 1, further comprising:

generating a first relationship index for the connection between the first user and the second user based on the selected path; and

storing the first relationship index.

13. The method of claim 1, further comprising:

providing the one or more intermediate users with a credit in response to the selection via the one or more intermediate users for the connection between the first user and the second user.

14. The method of claim 1, further comprising:

assigning a cost to the weight value to each connection of the one or more paths, and comparing the assigned cost of each connection of the one or more paths, wherein the cost is determined by a sum of the weight value of each connection path selected by the first user.

15. The method of claim 1, further comprising:

generating a user interface for providing an option items corresponding to the one or more paths associated with the searched optimal path, the option items comprising request phrases, demands on a counter-part user, and the incentive granted to the intermediate user, the incentive being part of the calculated costs required for the optimal path.

16. A system for managing a social network, the system comprising:

a database to store a relationship index, an identification and a personal information of a subscriber to a service via a network, the relationship index being determined according to a level of trustworthiness between the subscribers; and

a search server configured to calculate costs of one or more paths between the subscribers and selectively to provide an optimal connection, wherein the cost of each of the one or more paths is calculated by assigning a weight to each connection path of the one or more paths in an inverse proportion to the relationship index between the subscribers, wherein the optimal connection comprises at least one path using at least one intermediate subscriber, and the at least one path is generated associated with an incentive granted to the intermediate subscriber by subtracting the calculated cost from one or more of the subscribers, wherein the at least one path is generated according to the calculated costs of the one or more paths via the at least one intermediate subscriber.

17. The system of claim 16, further comprising:

a user interface is configured to provide an option items corresponding to the one or more paths associated with the searched optimal path, the option items comprising request phrases, demands on a counter-part subscriber, and the incentive granted to the intermediate subscriber, the incentive being part of the calculated costs required for the optimal connection.