System and method for employing social networks for information discovery

• US 7,472,110 B2
• Filed: 01/29/2003
• Issued: 12/30/2008
• Est. Priority Date: 01/29/2003
• Status: Expired due to Fees

• Current Assignee: Microsoft Technology Licensing LLC (Microsoft Corporation)
• Original Assignee: Microsoft Corporation
• Inventors: Achlioptas, Dimitris
• Primary Examiner(s): Wong; Don
• Assistant Examiner(s): Brown; Sheree N
• Application Number:
  US10/353,623
• Publication Number:
  US 20040148275A1
• Time in Patent Office: 2,162 Days
• Field of Search: 707 1- 3, 707/9, 705/26, 705/27, 705/7
• 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 search system comprising:

a storage component that stores attributes relating to one or more individuals;

a search engine that receives a user query, the search engine performing a social network-based search of the storage component to determine a referral path from a source node of the query to a destination node, the referral path comprising at least three nodes, wherein each node represents one or more individuals; and

a privacy component that selectively exposes to the source node of the query portions of the referral path between an intermediate node and the destination node based upon one or more exposure limitations set by one or more of the individuals at the intermediate node, wherein the intermediate node is located between the source node and destination node on the referral path, the referral path between an intermediate node and the destination node is not exposed to the source node unless selectively exposed by the intermediate node.

2. The system of claim 1, wherein the system is implemented across a distributed computing environment.

3. The system of claim 1, wherein the storage component is propagated with individual profiles.

4. The system of claim 3, wherein an individual profile includes data directly input by an individual represented by the individual profile.

5. The system of claim 1, wherein the attributes are obtained via data scavenging.

6. The system of claim 4, wherein the attributes comprise corroboration information indentifying one or more individuals that will verify for the source node the accuracy of information within another individual'"'"'s profile.

7. The system of claim 1, further comprising indices for the attributes that facilitate searching.

8. The system of claim 1, wherein the attributes are obtained from individual profiles.

9. The system of claim 8, wherein the individual profiles respectively comprise buddy list information.

10. The system of claim 8, wherein the attributes are represented as a directed graph comprising nodes and arcs, the arcs indicating relationships between the nodes.

11. The system of claim 1, wherein a first node of the referral path is viewable by a requesting user and remaining nodes of the referral path are hidden from the requesting user.

12. The system of claim 1, wherein the storage component stores buddy lists that comprise lists of users having direct personal relationships with respective users.

13. The system of claim 1, wherein the storage component utilizes encryption.

14. The system of claim 1, wherein the user query comprises a query distance, the query distance being a number of arcs from a user requesting the query through which the query extends.

15. A system for utilizing a social network comprising:

a private storage component that maintains information relating to a social network, the social network represented via at least one directed graph that functionally represents relationships between individuals and/or entities within the social network, the at least one directed graph comprising a source vertex, a destination vertex, and at least one intermediate vertex, wherein the at least one intermediate vertex is between the source vertex and the destination vertex along at least one path of the at least one directed graph from the source vertex to the destination vertex; and

a search engine that receives a query for requested information, and searches the private storage component for the requested information, the search engine selectively exposing at least a portion of the at least one directed graph downstream from the at least one intermediate vertex as part of a query result based upon one or more exposure limitations set by one or more of the individuals represented by the at least one intermediate vertex of the at least directed graph, the portion of the at least one directed graph downstream from the at least one intermediate vertex is hidden from the source vertex unless selectively exposed by the intermediate vertex.

16. The system of claim 15, wherein the information comprises buddy lists information, personal information and corroboration information.

17. The system of claim 16, wherein the buddy lists information comprises a first set of users that have given access permission to be contacted for information by a respective user and a second set of users that have been given access permission to contact the respective user for information.

18. The system of claim 16, wherein the corroboration information indicates which users of the first set of users are searchable by the second set of users.

19. The system of claim 18, wherein the corroboration information further indicates which users will perform corroboration of truthfulness another user'"'"'s information.

20. The system of claim 16, wherein the buddy lists information comprises a list of users, one or more users from the buddy list are respectively assigned a familiarity value, wherein the familiarity value indicates a degree of familiarity between whom created the buddy list and a user from the buddy list.

21. The system of claim 20, wherein the private storage component represents the buddy lists information, the personal information and corroboration information as a directed graph wherein users are represented via vertices, and relationships between users are represented via respective arcs connecting the vertices, the arcs having respective familiarity values assigned thereto.

22. The system of claim 20, wherein the familiarity value for respective arcs between a first user and a second user are a minimum of a first familiarity value assigned by the first user and a second familiarity value assigned by the second user.

23. The system of claim 15, wherein the query result comprises a referral path.

24. The system of claim 15, wherein the query result comprises an encoded subgraph of a referral path.

25. A search system comprising:

means for storing attributes relating to a plurality of at least one of individuals and entities, and intra-relationships between the respective individuals and/or entities;

means for searching the attributes for requested information and selectively providing a referral path towards the requested information, the referral path comprising a subset containing at least three of the plurality of at least one of individuals and entities arranged in linking manner corresponding to intra-relationships between the individuals and/or entities; and

means for selectively shielding downstream individuals and entities of the referral path based upon one or more exposure limitations set by one or more of the at least one of individuals and entities located between the at least one of individuals or entities requesting the information and the at least one of individuals and entities having the requested information in the referral path, the referral path between the at least one of individuals or entities requesting the information and the at least one of individuals and entities having the requested information is hidden from the at least one of individuals or entities requesting the information unless selectively exposed by an intermediate node.