Propagating information in a computer network, in one aspect, may include detecting an online action performed by a user on a content presented on a computer. The content may be annotated with an identifier. A semantic graph may be searched for a semantic node representing the identifier. The semantic graph may be searched for one or more other semantic nodes representing one or more other identifiers that meet a semantic similarity threshold based on weighted distances between the semantic node and the one or more other semantic nodes. One or more other users represented in a social graph may be determined that have interest in one or more topics represented by the identifier and the one or more other identifiers. The online action on the content may be propagated to the one or more other users.
Legal claims defining the scope of protection, as filed with the USPTO.
1. A computer-implemented method of propagating information in a computer network, comprising: detecting an online action performed by a user on content presented on a computer; searching a semantic graph stored on a memory device for a semantic node representing the content; searching the semantic graph for at least one other semantic node representing second content that meets a semantic similarity threshold based on weighted distances between the semantic node and the at least one other semantic node; searching, in a social graph stored on the memory device and comprising a network of social nodes representing users, starting with a social node u representing the user, for at least one second social node whose distance from the social node u meets a social relationship threshold; for each of the at least one second social node, determining whether an interest of the at least one second social node intersects with the content and the second content, and responsive to determining that the interest of the at least one second social node intersects with the content and the second content, propagating the online action to the at least one second user's user interface, wherein the method is executed automatically by a social network server, wherein the propagating of the detected online action is contained to target the at least one second social node whose interest intersects with the content and the second content.
2. The method of claim 1 , wherein the social relationship threshold is configurable.
3. The method of claim 1 , wherein edges connecting the social nodes of the social graph are weighted and the distance between the social node u and the at least one second social node is computed based on weights of the edges that connect the social node u and the at least one second social node.
4. The method of claim 1 , wherein the semantic similarity threshold is configurable.
5. The method of claim 1 , wherein edges connecting semantic nodes of the semantic graph are weighted and the weighted distances are computed based on weights of the edges that connect the semantic node and the at least one other semantic node.
6. The method of claim 1 , wherein the content is annotated with an identifier.
7. The method of claim 6 , wherein the identifier comprises a uniform resource identifier.
8. The method of claim 1 , wherein the content comprises social media content.
9. A computer readable storage medium storing a program of instructions executable by a machine to perform a method of propagating information in a computer network, comprising: detecting an online action performed by a user on content presented on a computer; searching a semantic graph stored on a memory device for a semantic node representing the content; searching the semantic graph for at least one other semantic node representing second content that meets a semantic similarity threshold based on weighted distances between the semantic node and the at least one other semantic node; searching, in a social graph stored on the memory device and comprising a network of social nodes representing users, starting with a social node u representing the user, for at least one second social node whose distance from the social node u meets a social relationship threshold; for each of the at least one second social node, determining whether an interest of the at least one second social node intersects with the content and the second content, and responsive to determining that the interest of the at least one second social node intersects with the content and the second content, propagating the online action to the at least one second user's user interface, wherein the method is executed automatically by a social network server, wherein the propagating of the detected online action is contained to target the at least one second social node whose interest intersects with the content and the second content.
10. The computer readable storage medium of claim 9 , wherein the social relationship threshold is configurable.
11. The computer readable storage medium of claim 9 , wherein edges connecting the social nodes of the social graph are weighted and the distance between the social node u and the at least one second social node is computed based on weights of the edges that connect the social node u and the at least one second social node.
12. The computer readable storage medium of claim 9 , wherein the semantic similarity threshold is configurable.
13. The computer readable storage medium of claim 9 , wherein edges connecting semantic nodes of the semantic graph are weighted and the weighted distances are computed based on weights of the edges that connect the semantic node and the at least one other semantic node.
14. The computer readable storage medium of claim 9 , wherein the content is annotated with an identifier.
15. The computer readable storage medium of claim 14 , wherein the identifier comprises a uniform resource identifier.
16. The computer readable storage medium of claim 9 , wherein the content comprises social media content.
17. A system of propagating information in a computer network, comprising: at least one hardware processor; at least one memory device coupled with the hardware processor; the at least one hardware processor operable to at least: detect an online action performed by a user on content presented on a computer; search a semantic graph stored on the at least one memory device for a semantic node representing the content; search the semantic graph for at least one other semantic node representing second content that meets a semantic similarity threshold based on weighted distances between the semantic node and the at least one other semantic node; search, in a social graph stored on the at least one memory device and comprising a network of social nodes representing users, starting with a social node u representing the user, for at least one second social node whose distance from the social node u meets a social relationship threshold; for each of the at least one second social node, determine whether an interest of the at least one second social node intersects with the content and the second content, and responsive to determining that the interest of the at least one second social node intersects with the content and the second content, propagate the online action to the at least one second user's user interface, propagating the detected online action contained to target the at least one second social node whose interest intersects with the content and the second content.
18. The system of claim 17 , wherein the social relationship threshold is configurable.
19. The system of claim 17 , wherein edges connecting the social nodes of the social graph are weighted and the distance between the social node u and the at least one second social node is computed based on weights of the edges that connect the social node u and the at least one second social node.
20. The system of claim 17 , wherein the semantic similarity threshold is configurable.
Cooperative Patent Classification codes for this invention. Click any code to explore related patents in that topic.
September 14, 2018
March 16, 2021
Browse 5M+ US patents with plain-English claim translations and AI-generated analysis.