Method and system for providing notifications
A computer-based method is provided for selectively providing notifications based on social relevance to a user. The notification is first parsed to determine a sender, a proposed recipient, and at least one topic addressed in the notification. The parsed notification is then evaluated against a social graph of the proposed recipient. A relevance score is assessed based on linkages traversed in the social graph to a predetermined degree of separation from the proposed recipient. The score is increased for linkages that match or relate to the at least one topic. The notification is released to the proposed recipient if the relevance score exceeds a predetermined threshold.
1. A computer-implemented method comprising:
receiving, by a social relevancy engine from a notification provider, a notification to be delivered to a plurality of users;
parsing the notification to determine a sender of the notification and a topic addressed in the notification;
computing a score indicating a relevance of the topic to a second user that is connected to the sender;
determining that the score is less than a first threshold value; and
in response, filtering the second user from a set of users to receive the notification.
2. The computer-implemented method of claim 1 , further comprising:
preventing delivery of the notification to the filtered second user.
3. The computer-implemented method of claim 1 , wherein the score is based on one or more of a degree of separation between the sender and the second user on a social graph, a directionality of linkage between the sender and the second user on the social graph, or a recency of the linkage between the sender and the second user on the social graph.
4. The computer-implemented method of claim 3 , wherein:
the social graph comprises a plurality of nodes comprising a plurality of user nodes and a plurality of topic nodes;
the plurality of users are represented as respective nodes among the plurality of user nodes; and
the topic node is one of the plurality of topic nodes.
5. The computer-implemented method of claim 1 , further comprising:
computing a score indicating a relevance of the topic to a third user that is not connected to the sender;
determining that the score is more than a second threshold value; and
in response, permitting delivery of the notification to the third user.
6. The computer-implemented method of claim 1 , wherein the notification comprises one or more of an email, a text message, or an instant message.
7. The computer-implemented method of claim 1 , further comprising:
obtaining, by the social relevancy engine, social graph data representing connections in a social graph between the plurality of users;
determining that a first user does not have at least a threshold number of connections in the social graph to other users included in the plurality of users receiving the notification; and
in response, filtering the first user from the set of users to receive the notification.
8. The computer-implemented method of claim 7 , wherein determining that the first user does not have at least the threshold number of connections in the social graph to the other users receiving the notification comprises:
computing a score indicative of a number of connections between the first user and the other users receiving the notification; and
determining that the score is less than the threshold number of connections.
9. A system comprising:
at least one programmable processor; and
a machine-readable medium storing instructions that, when executed by the at least one programmable processor, cause the at least one programmable processor to perform operations comprising:
receiving, by a social relevancy engine from a notification provider, a notification to be delivered to a plurality of users;
parsing the notification to determine a sender of the notification and a topic addressed in the notification;
computing a score indicating a relevance of the topic to a second user that is connected to the sender;
determining that the score is less than a first threshold value; and
in response, filtering the second user from a set of users to receive the notification.
10. The system of claim 9 , the operations further comprise:
preventing delivery of the notification to the filtered second user.
11. The system of claim 9 , wherein the score is based on one or more of a degree of separation between the sender and the second user on a social graph, a directionality of linkage between the sender and the second user on the social graph, or a recency of the linkage between the sender and the second user on the social graph.
12. The system of claim 11 , wherein:
the social graph comprises a plurality of nodes comprising a plurality of user nodes and a plurality of topic nodes;
the plurality of users are represented as respective nodes among the plurality of user nodes; and
the topic node is one of the plurality of topic nodes.
13. The system of claim 9 , the operations further comprise:
computing a score indicating a relevance of the topic to a third user that is not connected to the sender;
determining that the score is more than a second threshold value; and
in response, permitting delivery of the notification to the third user.
14. The system of claim 9 , wherein the notification comprises one or more of an email, a text message, or an instant message.
15. The system of claim 9 , the operations further comprise:
obtaining, by the social relevancy engine, social graph data representing connections in a social graph between the plurality of users;
determining that a first user does not have at least a threshold number of connections in the social graph to other users included in the plurality of users receiving the notification; and
in response, filtering the first user from the set of users to receive the notification.
16. The system of claim 15 , wherein determining that the first user does not have at least the threshold number of connections in the social graph to the other users receiving the notification comprises:
computing a score indicative of a number of connections between the first user and the other users receiving the notification; and
determining that the score is less than the threshold number of connections.
17. A non-transitory computer program product storing instructions that, when executed by at least one programmable processor, cause the at least one programmable processor to perform operations comprising:
receiving, by a social relevancy engine from a notification provider, a notification to be delivered to a plurality of users;
parsing the notification to determine a sender of the notification and a topic addressed in the notification;
computing a score indicating a relevance of the topic to a second user that is connected to the sender;
determining that the score is less than a first threshold value; and
in response, filtering the second user from a set of users to receive the notification.
18. The non-transitory computer program product of claim 17 , the operations further comprise:
obtaining, by the social relevancy engine, social graph data representing connections in a social graph between the plurality of users;
determining that a first user does not have at least a threshold number of connections in the social graph to other users included in the plurality of users receiving the notification; and
in response, filtering the first user from the set of users to receive the notification.
19. The non-transitory computer program product of claim 18 , wherein determining that the first user does not have at least the threshold number of connections in the social graph to the other users receiving the notification comprises:
computing a score indicative of a number of connections between the first user and the other users receiving the notification; and
determining that the score is less than the threshold number of connections.
20. The non-transitory computer program product of claim 17 , the operations further comprise:
preventing delivery of the notification to the filtered second user.