Identification of relationships in an environment

• US 20050165715A1
• Filed: 12/31/2003
• Published: 07/28/2005
• Est. Priority Date: 02/20/2002
• Status: Active Grant

• Current Assignee: Microsoft Corporation
• Original Assignee: Microsoft Corporation
• Inventors: Cheng, Lili, Farnham, Shelly D., Portnoy, William L.
• Granted Patent: US 7,496,582 B2
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G06Q 10/10 Office automation; Time management

Abstract

A method identifies components associated with a first end point in an environment, such as a social environment. The method further identifies components associated with a second end point in the environment. A determination is made regarding whether any of the identified components are associated with both the first end point and the second end point. The method then displays relationships between the first end point, the second end point, and any components associated with both the first end point and the second end point.

Claims

1. A method comprising:

identifying components associated with a first end point in an environment;

identifying components associated with a second end point in the environment;

determining whether any of the identified components are associated with both the first end point and the second end point;

identifying relationships between the first end point, the second end point, and any components associated with both the first end point and the second end point.

2. A method as recited in claim 1 wherein the environment is a social environment.

3. A method as recited in claim 1 further comprising receiving a request to identify relationships between the first end point and the second end point.

4. A method as recited in claim 1 wherein determining whether any of the identified components are associated with both the first end point and the second end point includes determining a path strength for each path between the first end point and the second end point.

5. A method as recited in claim 1 wherein determining whether any of the identified components are associated with both the first end point and the second end point includes:

determining a path strength for each path between the first end point and the second end point; and

ranking the paths between the first end point and the second end point based on path strength.

6. A method as recited in claim 5 further comprising ignoring paths having a path strength below a predetermined threshold.

7. A method as recited in claim 5 wherein identifying relationships includes identifying only the top ranked paths between the first end point and the second end point.

8. A method as recited in claim 1 further comprising displaying relationships between the first end point, the second end point, and any components associated with both the first end point and the second end point.

9. A method as recited in claim 8 wherein displaying relationships includes displaying information regarding at least one component.

10. A method as recited in claim 8 wherein displaying relationships includes displaying information regarding at least one link between components.

11. A method as recited in claim 8 wherein displaying relationships includes displaying a social context associated with the first end point and displaying a social context associated with the second end point.

12. A method as recited in claim 8 wherein displaying relationships includes:

displaying the first end point;

displaying the second end point; and

displaying at least one common component associated with the first end point and the second end point.

13. A method as recited in claim 1 further comprising:

displaying a common component associated with the first end point and the second end point;

displaying at least one link between the common component and the first end point; and

displaying at least one link between the common component and the second end point.

14. A method as recited in claim 1 further comprising:

displaying the first end point;

displaying the second end point;

displaying components associated with the first end point; and

displaying components associated with the second end point.

15. One or more computer-readable memories containing a computer program that is executable by a processor to perform the method recited in claim 1.

16. A method comprising:

displaying a first end point;

displaying components associated with the first end point;

displaying a second end point;

displaying components associated with the second end point;

displaying a common component associated with the first end point and the second end point;

displaying a link between the common component and the first end point; and

displaying a link between the common component and the second end point.

17. A method as recited in claim 16 further comprising:

determining a path strength associated with the common component; and

preventing the display of the common component if the path strength is below a threshold.

18. A method as recited in claim 16 further comprising:

displaying a second common component associated with the first end point and the second end point;

displaying a link between the second common component and the first end point; and

displaying a link between the second common component and the second end point.

19. A method as recited in claim 16 further comprising displaying a second link between the common component and the first end point.

20. A method as recited in claim 19 further comprising:

determining a strongest link between the common component and the first end point; and

highlighting the strongest link between the common component and the first end point.

21. A method as recited in claim 16 further comprising:

displaying a second link between the common component and the first endpoint; and

displaying a second link between the common component and the second end point.

22. One or more computer-readable memories containing a computer program that is executable by a processor to perform the method recited in claim 16.

23. One or more computer-readable media having stored thereon a computer program that, when executed by one or more processors, causes the one or more processors to:

display a first end point in a social network;

display a second end point in a social network;

identify a common component associated with the first end point and the second end point;

display the common component associated with the first end point and the second end point;

display a link between the common component and the first end point; and

display a link between the common component and the second end point.

24. One or more computer-readable media as recited in claim 23 wherein the one or more processors further determine a path strength associated with the common component and prevent display of the common component if the path strength is below a threshold.

25. One or more computer-readable media as recited in claim 23 wherein the one or more processors further display a second link between the common component and the first end point.

26. One or more computer-readable media as recited in claim 23 wherein the one or more processors further display a second link between the common component and the first end point and display a second link between the common component and the second end point.

27. One or more computer-readable media as recited in claim 23 wherein the one or more processors further identify a second common component associated with the first end point and the second end point.

28. One or more computer-readable media as recited in claim 23 wherein the one or more processors further display the second common component associated with the first end point and the second end point.