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.

Abstract: A mechanism is provided in a data processing system for content delivery. The mechanism identifies a candidate user of a social networking service. The candidate user has an associated profile including at least one concept of interest. The mechanism determines a probability that the candidate user is interested in an item of content based on a semantic similarity of the at least one concept of interest and at least one concept tag associated with the item of content using a weighted semantic graph. Responsive to the probability exceeding a probability threshold, the mechanism delivers the item of content to the candidate user. Responsive to receiving feedback comprising at least one action taken by the candidate user with respect to the item of content, the mechanism adjusts weights in the weighted semantic graph.

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.

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.

Abstract: A mechanism is provided in a data processing system for content delivery. The mechanism identifies a candidate user of a social networking service. The candidate user has an associated profile including at least one concept of interest. The mechanism determines a probability that the candidate user is interested in an item of content based on a semantic similarity of the at least one concept of interest and at least one concept tag associated with the item of content using a weighted semantic graph. Responsive to the probability exceeding a probability threshold, the mechanism delivers the item of content to the candidate user. Responsive to receiving feedback comprising at least one action taken by the candidate user with respect to the item of content, the mechanism adjusts weights in the weighted semantic graph.

Abstract: A mechanism is provided in a data processing system for content delivery. The mechanism identifies a candidate user of a social networking service. The candidate user has an associated profile including at least one concept of interest. The mechanism determines a probability that the candidate user is interested in an item of content based on a semantic similarity of the at least one concept of interest and at least one concept tag associated with the item of content using a weighted semantic graph. Responsive to the probability exceeding a probability threshold, the mechanism delivers the item of content to the candidate user. Responsive to receiving feedback comprising at least one action taken by the candidate user with respect to the item of content, the mechanism adjusts weights in the weighted semantic graph.

Abstract: A mechanism is provided in a data processing system for content delivery. The mechanism identifies a candidate user of a social networking service. The candidate user has an associated profile including at least one concept of interest. The mechanism determines a probability that the candidate user is interested in an item of content based on a semantic similarity of the at least one concept of interest and at least one concept tag associated with the item of content using a weighted semantic graph. Responsive to the probability exceeding a probability threshold, the mechanism delivers the item of content to the candidate user. Responsive to receiving feedback comprising at least one action taken by the candidate user with respect to the item of content, the mechanism adjusts weights in the weighted semantic graph.

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.