Methods and apparatus for targeting communications using social network metrics

• US 9,807,047 B2
• Filed: 08/12/2016
• Issued: 10/31/2017
• Est. Priority Date: 04/07/2004
• Status: Active Grant

• Current Assignee: Microsoft Technology Licensing LLC (Microsoft Corporation)
• Original Assignee: LinkedIn Corporation (Microsoft Corporation)
• Inventors: Lawler, Brian, Loh, Elliot, Martino, Paul J., Pincus, Mark
• Primary Examiner(s): Khajuria, Shripal
• Application Number:
  US15/235,367
• Publication Number:
  US 20160352670A1
• Time in Patent Office: 445 Days
• Field of Search: 709207
• CPC Class Codes: G06F 16/24578 using ranking
• CPC Class Codes: G06F 16/285 Clustering or classification
• CPC Class Codes: G06F 16/9535 Search customisation based on user profiles and personalisation
• CPC Class Codes: G06F 3/0481 based on specific properties of the displayed interaction object or a metaphor-based environment, e.g. interaction with desktop elements like windows or icons, or assisted by a cursor's changing behaviour or appearance
• CPC Class Codes: G06Q 10/10 Office automation; Time management
• CPC Class Codes: G06Q 20/145 Payments according to the detected use or quantity
• CPC Class Codes: H04L 12/1813 for computer conferences, e.g. chat rooms instant messaging H04L51/04; protocols for multimedia communication H04L65/1101; arrangements for multi-party communication H04L65/403; telephonic conference arrangements H04M3/56; television conference systems H04N7/15
• CPC Class Codes: H04L 51/046 Interoperability with other network applications or services
• CPC Class Codes: H04L 51/212 using filtering or selective blocking
• CPC Class Codes: H04L 51/226 Delivery according to priorities
• CPC Class Codes: H04L 51/52 for supporting social networking services
• CPC Class Codes: H04L 65/403 Arrangements for multi-party communication, e.g. for conferences data switching systems for conference H04L12/18; arrangements for connecting several subscribers to a common circuit, i.e. affording conference facilities H04M3/56; television conferencing systems H04N7/15

Abstract

A method for a computer system includes receiving a first user communication, determining a first group of users, determining a target number of users, determining whether the first group of users includes the target number of users, and if not, providing the communication to the first group of users, determining a hierarchal mapping of groups of users in response to user memberships, determining a second group of users from the hierarchal mapping, determining a plurality of social network relationship factors for the second group of users with respect to the first user, and providing the communication to at least a subset of users in the second group of users in response to the first plurality of social network relationship factors.

Claims

1. A method for automated prioritization of electronic communications transmitted over a network, the method comprising:

receiving, on a server using an interface communicatively coupled to the network, an electronic communication directed to a first user of a social network from a second user of the social network, the social network including affinity groups configured within the social network;

determining, using one or more processors within the server, a user network of the first user within the social network, the user network of the first user including users and affinity groups that are within a predetermined social distance from the first user;

determining if the second user is within the user network of the first user; and

prioritizing presentation of the electronic communication, relative to a plurality of other electronic communications for the first user, based at least in part on the determining if the second user is within the user network of the first user.

2. The method of claim 1, wherein prioritizing presentation of the electronic communication further includes:

enabling the presentation of the electronic communication to the first user when the second user is within the user network of the first user; and

blocking the presentation of the electronic communication to the first user when the second user is not within the user network of the first user.

3. The method of claim 1, further comprising:

constraining information searches requested by the first user to information from users within the user network of the first user.

4. The method of claim 1, further comprising:

imputing relationships of users within each affinity group to the respective affinity group for calculating distances between affinity groups and for calculating distances between users and affinity groups.

5. The method of claim 4, wherein the second user is within the user network of the first user further when:

a social distance between the first user and the second user is less than or equal to the predetermined social distance;

or

a social distance between affinity groups of the first user and affinity groups of the second user is less than or equal to the predetermined social distance.

6. The method of claim 4, further comprising:

determining a taxonomy for related affinity groups based on common user membership overlap.

7. The method of claim 1, further comprising:

identifying implied affinity group s for the first user, wherein an implied affinity group includes users that share a common expressed interest, wherein the implied affinity groups for the first user are included within the user network of the first user;

identifying implied affinity group s for the second user; and

wherein determining if the second user is within the user network of the first user includes the implied affinity groups.

8. The method of claim 1, further comprising:

determining a trust-network metric associated with the second user, wherein prioritizing presentation of the electronic communication includes weighting the trust-network metric associated with the second user in comparison to trust-network metrics associated with the plurality of other electronic communications for the first user.

9. The method claim 1, wherein prioritizing presentation of the electronic communication includes storing the electronic communication in a folder associated with an affinity group connection between the first user and the second user.

10. A system comprising:

a network interface;

a memory device; and

a processor communicatively coupled to the memory device, wherein the processor, the memory device, and the network interface cooperate such that the system performs operations comprising;

receiving, on the network interface, an electronic communication directed to a first user of a social network from a second user of the social network, the social network including affinity groups configured within the social network;

determining, by the processor, a user network of the first user within the social network, the user network of the first user including users and affinity groups that are within a predetermined social distance from the first user;

determining if the second user is within the user network of the first user; and

prioritizing presentation of the electronic communication, relative to a plurality of other electronic communications for the first user, based at least in part on the determining if the second user is within the user network of the first user.

11. The system of claim 10, wherein prioritizing presentation of the electronic communication further includes:

enabling the presentation of the electronic communication to the first user when the second user is within the user network of the first user; and

blocking the presentation of the electronic communication to the first user when the second user is not within the user network of the first user.

12. The system of claim 10, wherein the operations further comprise:

constraining information searches requested by the first user to information from users within the user network of the first user.

13. The system of claim 10, wherein the operations further comprise:

imputing relationships of users within each affinity group to the respective affinity group for calculating distances between affinity groups and for calculating distances between users and affinity groups.

14. The system of claim 13, wherein the second user is within the user network of the first user further when:

a social distance between the first user and the second user is less than or equal to the predetermined social distance;

or

a social distance between affinity groups of the first user and affinity groups of the second user is less than or equal to the predetermined social distance.

15. The system of claim 13, wherein the operations further comprise:

determining a taxonomy for related affinity groups based on common user membership overlap.

16. The system of claim 10, wherein the operations further comprise:

identifying implied affinity groups for the first user, wherein an implied affinity group includes users that share a common expressed interest, wherein the implied affinity groups for the first user are included within the user network of the first user;

identifying implied affinity groups for the second user; and

wherein determining if the second user is within the user network of the first user includes the implied affinity groups.

17. The system of claim 10, wherein the operations further comprise:

determining a trust-network metric associated with the second user, wherein prioritizing presentation of the electronic communication includes weighting the trust-network metric associated with the second user in comparison to trust-network metrics associated with the plurality of other electronic communications for the first user.

18. A non-transitory computer-readable medium including instructions for automated prioritization of electronic communications transmitted over a network that, when executed on a computing device including one or more processors, cause the computing device to perform operations comprising:

receiving, on a server using an interface communicatively coupled to the network, an electronic communication directed to a first user of a social network from a second user of the social network, the social network including affinity groups configured within the social network;

determining, using one or more processors within the server, a user network of the first user within the social network, the user network of the first user including users and affinity groups that are within a predetermined social distance from the first user;

determining if the second user is within the user network of the first user; and

prioritizing presentation of the electronic communication, relative to a plurality of other electronic communications for the first user, based at least in part on the determining if the second user is within the user network of the first user.

19. The computer-readable medium of claim 18, wherein prioritizing presentation of the electronic communication further includes:

enabling the presentation of the electronic communication to the first user when the second user is within the user network of the first user; and

blocking the presentation of the electronic communication to the first user when the second user is not within the user network of the first user.

20. The computer-readable medium of claim 18, wherein the operations further comprise:

constraining information searches requested by the first user to information from users within the user network of the first user.

21. The computer-readable medium of claim 18, wherein the operations further comprise:

imputing relationships of users within each affinity group to the respective affinity group for calculating distances between affinity groups and for calculating distances between users and affinity groups.

22. The computer-readable medium of claim 21, wherein the second user is within the user network of the first user further when:

a social distance between the first user and the second user is less than or equal to the predetermined social distance;

or

a social distance between affinity groups of the first user and affinity groups of the second user is less than or equal to the predetermined social distance.

23. The computer-readable medium of claim 21, wherein the operations further comprise:

determining a taxonomy for related affinity groups based on common user membership overlap.

24. The computer-readable medium of claim 18, wherein the operations further comprise:

identifying implied affinity groups for the first user, wherein an implied affinity group includes users that share a common expressed interest, wherein the implied affinity groups for the first user are included within the user network of the first user;

identifying implied affinity groups for the second user; and

wherein determining if the second user is within the user network of the first user includes the implied affinity groups.

25. The computer-readable medium of claim 18, wherein the operations further comprise:

determining a trust-network metric associated with the second user, wherein prioritizing presentation of the electronic communication includes weighting the trust-network metric associated with the second user in comparison to trust-network metrics associated with the plurality of other electronic communications for the first user.