INFORMATION PROPAGATION VIA WEIGHTED SEMANTIC AND SOCIAL GRAPHS

• US 20160179965A1
• Filed: 12/19/2014
• Published: 06/23/2016
• Est. Priority Date: 12/19/2014
• Status: Active Grant

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Lu, Cindy H., Tran, Thai Q., Bhatia, Nimesh, Hashemian, Seyyed Vahid
• Granted Patent: US 10,146,875 B2
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G06F 16/9535 Search customisation based on user profiles and personalisation

Abstract

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.

Claims

1. A method of propagating information in a computer network, comprising:

detecting an online action performed by a user on a content presented on a computer, the content annotated with an identifier;

searching a semantic graph stored on a memory device for a semantic node representing the identifier;

searching the semantic graph 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;

determining one or more other users represented in a social graph that have interest in one or more topics represented by the identifier and the one or more other identifiers, the social graph stored on the memory device and comprising a network of social nodes representing users; and

propagating the online action on the content to the one or more other users.

2. The method of claim 1, wherein the determining one or more other users represented in a social graph that have interest in one or more topics represented by the identifier and the one or more other identifiers comprises:

locating a social node that represents the user in the social graph;

searching the social graph for one or more social nodes that meet a social relationship threshold based on weighted distances between the social node and one or more other social nodes; and

selecting the one or more other users from the one or more other social nodes that have interest in one or more topics represented by the identifier and the one or more other identifiers.

3. The method of claim 2, wherein the social relationship threshold is configurable.

4. The method of claim 2, wherein edges connecting the social nodes of the social graph are weighted and the weighted distances between the social node and the one or more other social nodes are computed based on weights of the edges that connect the social node and the one or more other social nodes.

5. The method of claim 1, wherein the semantic similarity threshold is configurable.

6. The method of claim 1, wherein edges connecting the 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 one or more other semantic nodes.

7. The method of claim 1, 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 a content presented on a computer, the content annotated with an identifier;

searching a semantic graph stored on a memory device for a semantic node representing the identifier;

searching the semantic graph 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;

determining one or more other users represented in a social graph that have interest in one or more topics represented by the identifier and the one or more other identifiers, the social graph stored on the memory device and comprising a network of social nodes representing users; and

propagating the online action on the content to the one or more other users.

10. The computer readable storage medium of claim 9, wherein the determining one or more other users represented in a social graph that have interest in one or more topics represented by the identifier and the one or more other identifiers comprises:

locating a social node that represents the user in the social graph;

searching the social graph for one or more social nodes that meet a social relationship threshold based on weighted distances between the social node and one or more other social nodes; and

selecting the one or more other users from the one or more other social nodes that have interest in one or more topics represented by the identifier and the one or more other identifiers.

11. The computer readable storage medium of claim 10, wherein the social relationship threshold is configurable.

12. The computer readable storage medium of claim 10, wherein edges connecting the social nodes of the social graph are weighted and the weighted distances between the social node and the one or more other social nodes are computed based on weights of the edges that connect the social node and the one or more other social nodes.

13. The computer readable storage medium of claim 9, wherein the semantic similarity threshold is configurable.

14. The computer readable storage medium of claim 9, wherein edges connecting the 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 one or more other semantic nodes.

15. The computer readable storage medium of claim 9, 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:

one or more semantic graphs stored on one or more memory devices, the one or more semantic graphs comprising respective one or more networks of semantic nodes;

a social graph stored on one or more of the memory devices, the social graph comprising a network of social nodes representing users;

a processor operable to detect an online action performed by a user on a content presented on a user interface, the content annotated with an identifier,

the processor further operable to search the one or more semantic graphs for a semantic node representing the identifier,

the processor further operable to search the semantic graph 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,

the processor further operable to determine one or more other users represented in the social graph that have interest in one or more topics represented by the identifier and the one or more other identifiers,

the processor further operable to propagate the online action on the content to the one or more other users.

18. The system of claim 17, wherein the processor is further operable to determine one or more other users represented in the social graph that have interest in one or more topics represented by the identifier and the one or more other identifiers by locating a social node that represents the user in the social graph, searching the social graph for one or more social nodes that meet a social relationship threshold based on weighted distances between the social node and one or more other social nodes, and selecting the one or more other users from the one or more other social nodes that have interest in one or more topics represented by the identifier and the one or more other identifiers.

19. The system of claim 18, wherein the processor is further operable to define weights associated with edges connecting the social nodes of the social graph, weights associated with edges connecting the semantic nodes of the one or more semantic graphs, the semantic similarity threshold, or the social relationship threshold, or combinations thereof.

20. The system of claim 18, wherein the weighted distances between the social node and the one or more other social nodes are computed based on weights of the edges that connect the social node and the one or more other social nodes.