System and method for employing social networks for information discovery

• US 20060041543A1
• Filed: 10/24/2005
• Published: 02/23/2006
• Est. Priority Date: 01/29/2003
• Status: Active Grant

• Current Assignee: Microsoft Technology Licensing LLC (Microsoft Corporation)
• Original Assignee: Microsoft Corporation
• Inventors: Achlioptas, Dimitris
• Granted Patent: US 8,335,798 B2
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G06F 16/9535 Search customisation based on user profiles and personalisation
• CPC Class Codes: G06F 16/9536 Search customisation based on social or collaborative filtering
• CPC Class Codes: Y10S 707/99933 Query processing, i.e. searching

Abstract

Systems and methods are provided that enable searches of social networks by acting as a “compass” that assists users in navigating the social network. Individual user participation is not required in response to queries from other users. The systems and methods offer navigational assistance or information as opposed to a traditional search which returns requested information, thus currently acceptable social mechanisms for arbitrating trust can be exploited. As a result, users do not make their personal information publicly searchable, while at the same time, they are protected from potential misrepresentations of facts.

Claims

1. A computer-implemented system for utilizing a social network comprising:

a coordinator component that receives a plurality of buddy lists and personal information corresponding to a social network, the coordinator component generates a plurality of directed subgraphs based on the buddy lists and the personal information, the directed subgraphs being subsets of a directed graph that functionally represents relationships between individuals and/or entities within the social network; and

a subgraph encrypter that encrypts the plurality of directed subgraphs.

2. The system of claim 1, the directed graph comprising a plurality of nodes, each node representing an individual or entity with the social network, the plurality of directed subgraphs having a subgraph limit wherein the subgraph limit is predefined number of nodes from a user of which the subgraph extends.

3. The system of claim 2, the subgraph limit being 3 degrees wherein a degree equals one path between two adjacent nodes.

4. The system of claim 2, the encrypted subgraphs respectively having a base user and being at least partially hidden from the base user.

5. The system of claim 4, the encrypted subgraphs being returnable to a number of users and being respectively searchable for a referral path by a base user.

6. A computer implemented method that utilizes a social network represented by a database storing a collection of information about individuals and/or entities and intra-relationships there between, the method comprising:

generating a query for requested information;

parsing the query to obtain query parameters;

performing a search of a directed graph for the requested information, the directed graph being a functional representation of at least a portion of the social network; and

locating the requested information and returning navigation information toward the requested information.

7. The method of claim 6, the query generated with a familiarity limit.

8. The method of claim 6, the query generated by a first user.

9. The method of claim 8, the search is performed via a breadth first search from a vertex representing the first user.

10. The method of claim 6, the search is performed according to the query distance and the familiarity limit.

11. The method of claim 6, further comprising obtaining the requested information via the navigation information.

12. The method of claim 11, further comprising obtaining corroboration of the requested information via a user on a referral path.

13. A computer implemented method that utilizes a social network represented by a database storing a collection of information about individuals and/or entities and intra-relationships there between, the method comprising:

receiving information for users of the social network, the information comprising attribute and relationship information; and

generating a directed graph of the social network by representing the individuals and/or entities as nodes and the relationship information as arcs interconnecting the nodes.

14. The method of claim 13, the relationship information received including buddy lists.

15. The method of claim 13, further comprising entering the information by the users employing predefined categories and default attributes.

16. The method of claim 13, further comprising assigning the arcs familiarities, the familiarities being a portion of the relationship information.

17. The method of claim 13, the arcs having a directionality according to the relationship information received.

18. The method of claim 13, the information received further comprising corroboration information, the corroboration information being assigned to the nodes.

19. The method of claim 13, further comprising:

generating a query for requested information;

searching the directed graph for the requested information; and

returning a referral path towards the requested information.

20. The method of claim 13 further comprising distributing the directed graph to a third party.