IP Library Granted Patent US 10,469,354
Granted Patent B2
US 10,469,354 · App. 15/379,609 · Granted Nov 5, 2019

Pre- and post-sharing insights for shared content

Inventors: William Jayang Sun (Berkeley, CA); Anca Simona Bateman (Walnut Creek, CA); Stacy Bloodworth (San Francisco, CA); Jiu-Ting Huang (Menlo Park, CA)
Assignee: Microsoft Technology Licensing, LLC
H04L43/16G06F16/285G06F16/951G06F16/9535G06F16/9566G06Q30/0201G06Q50/01H04L43/045H04L51/24H04L51/32H04L67/22H04L67/26H04L67/306H04W4/21H04L67/02H04L67/20
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 10,469,354
App. No.
15/379,609
Granted
Nov 5, 2019
Kind
B2
Abstract

This disclosure provides a system, method, and machine-readable memory for determining various pre-sharing insights and post-sharing insights. The system is configured to receive a request to share content with a first plurality of users represented as nodes in a graph associated with a first user. The system is also configured to determine a second plurality of users selected from the first plurality of users by traversing one or more nodes of the graph. The system further classifies the content to determine a plurality of topics for the content. The system then determines a third plurality of users selected from the second plurality of users by comparing the plurality of topics with user profile attribute values associated with each user of the second plurality of users. The system then communicates a notification to the first user that includes an identification of the third plurality of users.

Claims (46)

1. A system comprising:

a machine-readable memory storing computer-executable instructions; and

one or more hardware processors in communication with the machine-readable memory that, having executed the computer-executable instructions, configure the system to:

receive, from a first user, a request to share content with a first plurality of users represented as nodes in a social graph associated with the first user;

determine a content identifier for the content using at least one characteristic of the content, the content identifier being unique to the content;

determine a second plurality of users selected from the first plurality of users by traversing a plurality of nodes of the social graph;

classify the content to determine a plurality of topics for the content;

determine a third plurality of users selected from the second plurality of users by comparing one or more topics selected from the plurality of topics with one or more user profile attribute values associated with each user of the second plurality of users; and

communicate a notification to the first user that includes an identification of the third plurality of users.

2. The system of claim 1 , wherein the one or more hardware processors further configure the system to:

access a database to determine whether one or more users selected from the second plurality of users have previously shared the content based on the content identifier associated with the content; and

in response to a determination that one or more users selected from the second plurality of users have previously shared the content, communicate a notification to the first user that includes an identification of the one or more users.

3. The system of claim 1 , wherein the determination of the content identifier is dependent on whether the content is retrieved using a Uniform Resource Location (URL) or provided by the first user.

4. The system of claim 1 , wherein each topic of the plurality of topics corresponds to at least one user profile attribute value.

5. The system of claim 1 , wherein the second plurality of users are determined based on an upper bound representing a number of degrees of connections that are to be traversed in identifying nodes associated with the second plurality of users.

6. The system of claim 1 , wherein each user of the third plurality of users is associated with a corresponding user profile having a predetermined threshold number of user profile attribute values that match one or more topics of the plurality of topics determined for the content.

7. The system of claim 6 , wherein the third plurality of users are further selected from the second plurality of users by determining at least one user profile attribute value that is common to each user profile associated with each user of the third plurality of users.

8. A method comprising:

receiving, from a first user, a request to share content with a first plurality of users represented as nodes in a social graph associated with the first user;

determining a content identifier for the content using at least one characteristic of the content, the content identifier being unique to the content;

determining a second plurality of users selected from the first plurality of users by traversing a plurality of nodes of the social graph;

classifying the content to determine a plurality of topics for the content;

determining a third plurality of users selected from the second plurality of users by comparing one or more topics selected from the plurality of topics with one or more user profile attribute values associated with each user of the second plurality of users; and

communicating a notification to the first user that includes an identification of the third plurality of users.

9. The method of claim 8 , further comprising:

accessing a database to determine whether one or more users selected from the second plurality of users have previously shared the content based on the content identifier associated with the content; and

in response to a determination that one or more users selected from the second plurality of users have previously shared the content, communicating a notification to the first user that includes an identification of the one or more users.

10. The method of claim 8 , wherein the determination of the content identifier is dependent on whether the content is retrieved using a Uniform Resource Location (URL) or provided by the first user.

11. The method of claim 8 , wherein each topic of the plurality of topics corresponds to at least one user profile attribute value.

12. The method of claim 8 , wherein the second plurality of users are determined based on an upper bound representing a number of degrees of connections that are to be traversed in identifying nodes associated with the second plurality of users.

13. The method of claim 8 , wherein each user of the third plurality of users is associated with a corresponding user profile having a predetermined threshold number of user profile attribute values that match one or more topics of the plurality of topics determined for the content.

14. The method of claim 13 , wherein the third plurality of users are further selected from the second plurality of users by determining at least one user profile attribute value that is common to each user profile associated with each user of the third plurality of users.

15. A machine-readable memory storing computer-executable instructions that, when executed by one or more hardware processors, cause a system to perform a plurality of operations, the plurality of operations comprising:

receiving, from a first user, a request to share content with a first plurality of users represented as nodes in a social graph associated with the first user;

determining a content identifier for the content using at least one characteristic of the content, the content identifier being unique to the content;

determining a second plurality of users selected from the first plurality of users by traversing a plurality of nodes of the social graph;

classifying the content to determine a plurality of topics for the content;

determining a third plurality of users selected from the second plurality of users by comparing one or more topics selected from the plurality of topics with one or more user profile attribute values associated with each user of the second plurality of users; and

communicating a notification to the first user that includes an identification of the third plurality of users.

16. The machine-readable memory of claim 15 , wherein the plurality of operations further comprise:

accessing a database to determine whether one or more users selected from the second plurality of users have previously shared the content based on the content identifier associated with the content; and

in response to a determination that one or more users selected from the second plurality of users have previously shared the content, communicating a notification to the first user that includes an identification of the one or more users.

17. The machine-readable memory of claim 15 , wherein the determination of the content identifier is dependent on whether the content is retrieved using a Uniform Resource Location (URL) or provided by the first user.

18. The machine-readable memory of claim 15 , wherein each topic of the plurality of topics corresponds to at least one user profile attribute value.

19. The machine-readable memory of claim 15 , wherein the second plurality of users are determined based on an upper bound representing a number of degrees of connections that are to be traversed in identifying nodes associated with the second plurality of users.

20. The machine-readable memory of claim 15 , wherein each user of the third plurality of users is associated with a corresponding user profile having a predetermined threshold number of user profile attribute values that match one or more topics of the plurality of topics determined for the content.

Assignments (2)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Nov 1, 2017
From: LINKEDIN CORPORATION
To: MICROSOFT TECHNOLOGY LICENSING, LLC
Reel/Frame 044746/0001 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Dec 15, 2016
From: SUN, WILLIAM JAYANG; BATEMAN, ANCA SIMONA; BLOODWORTH, STACY; HUANG, JIU-TING
To: LINKEDIN CORPORATION
Reel/Frame 040740/0238 →
Continuity (2)
Provisional Application 62414965 · Oct 31, 2016
Related Publication 20180124159A1 · May 3, 2018
Cited By (2)
US 12,488,400 US 12,603,857