Identification of target audience for content delivery in social networks by quantifying semantic relations and crowdsourcing
First Claim
1. A method, in a data processing system, for content delivery, the method comprising:
- identifying a candidate user of a social networking service, wherein the candidate user has an associated profile including a plurality of user-stated concepts of interest;
determining a probability that the candidate user is interested in an item of content based on a semantic similarity of the plurality of user-stated concepts of interest and a plurality of concept tags associated with the item of content using a weighted semantic graph, wherein the weighted semantic graph comprises nodes representing concepts and edges representing relationships between concepts of connected nodes and wherein each edge is weighted with a semantic similarity value, wherein determining the probability that the candidate user is interested in the item of content comprises;
responsive to determining the plurality of user-stated concepts of interest and the plurality of concept tags do not intersect, determining a path from a given user-stated concept of interest and a given concept tag in the weighted semantic graph; and
determining a weight of the path from the given user-stated concept of interest and the given concept tag; and
responsive to the probability exceeding a probability threshold, delivering the item of content to a client data processing system of the candidate user.
1 Assignment
0 Petitions
Accused Products
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.
-
Citations
20 Claims
-
1. A method, in a data processing system, for content delivery, the method comprising:
-
identifying a candidate user of a social networking service, wherein the candidate user has an associated profile including a plurality of user-stated concepts of interest; determining a probability that the candidate user is interested in an item of content based on a semantic similarity of the plurality of user-stated concepts of interest and a plurality of concept tags associated with the item of content using a weighted semantic graph, wherein the weighted semantic graph comprises nodes representing concepts and edges representing relationships between concepts of connected nodes and wherein each edge is weighted with a semantic similarity value, wherein determining the probability that the candidate user is interested in the item of content comprises; responsive to determining the plurality of user-stated concepts of interest and the plurality of concept tags do not intersect, determining a path from a given user-stated concept of interest and a given concept tag in the weighted semantic graph; and determining a weight of the path from the given user-stated concept of interest and the given concept tag; and responsive to the probability exceeding a probability threshold, delivering the item of content to a client data processing system of the candidate user. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9)
-
-
10. A computer program product comprising a computer readable storage medium having a computer readable program stored therein, wherein the computer readable program, when executed on a computing device, causes the computing device to:
-
identify a candidate user of a social networking service, wherein the candidate user has an associated profile including a plurality of user-stated concepts of interest; determine a probability that the candidate user is interested in an item of content based on a semantic similarity of the plurality of user-stated concepts of interest and a plurality of concept tags associated with the item of content using a weighted semantic graph, wherein the weighted semantic graph comprises nodes representing concepts and edges representing relationships between concepts of connected nodes and wherein each edge is weighted with a semantic similarity value, wherein determining the probability that the candidate user is interested in the item of content comprises; responsive to determining the plurality of user-stated concepts of interest and the plurality of concept tags do not intersect, determining a path from a given user-stated concept of interest and a given concept tag in the weighted semantic graph; and determining a weight of the path from the given user-stated concept of interest and the given concept tag; and responsive to the probability exceeding a probability threshold, deliver the item of content to a client data processing system of the candidate user. - View Dependent Claims (11, 12, 13, 14, 15, 16, 17, 18)
-
-
19. An apparatus comprising:
-
a processor; and a memory coupled to the processor, wherein the memory comprises instructions which, when executed by the processor, cause the processor to; identify a candidate user of a social networking service, wherein the candidate user has an associated profile including a plurality of user-stated concepts of interest; determine a probability that the candidate user is interested in an item of content based on a semantic similarity of the plurality of user-stated concepts of interest and a plurality of concept tags associated with the item of content using a weighted semantic graph, wherein the weighted semantic graph comprises nodes representing concepts and edges representing relationships between concepts of connected nodes and wherein each edge is weighted with a semantic similarity value, wherein determining the probability that the candidate user is interested in the item of content comprises; responsive to determining the plurality of user-stated concepts of interest and the plurality of concept tags do not intersect, determining a path from a given user-stated concept of interest and a given concept tag in the weighted semantic graph; and determining a weight of the path from the given user-stated concept of interest and the given concept tag; and responsive to the probability exceeding a probability threshold, deliver the item of content to a client data processing system of the candidate user. - View Dependent Claims (20)
-
Specification