Advertiser and user association
First Claim
Patent Images
1. A computer-implemented method comprising:
- receiving, at a computer system, a request to identify interests for users of a social network;
accessing, by the computer system, a graph that includes i) nodes that represent at least a portion of the users of the social network and ii) edges that connect the nodes and that represent relationships among the portion of the users of the social network;
assigning labels to at least some of the nodes of the graph based, at least in part, on content that is associated with the portion of the users on the social network, wherein the labels correspond to topics of user interest;
determining, for the at least some of the nodes, label values for the assigned labels based, at least in part, on content that is associated with users that correspond to the at least some of the nodes, wherein the label values determined for the at least some of the nodes and the assigned labels indicate degrees to which the users represented by the at least some of the nodes are interested in the topics that correspond to the assigned labels, wherein a first label value for a first label and a second level value for a second label are determined for a first node and a second label value for the second label is determined for a second node, the first node and the second node having an indirect connection between each other that comprises a portion of the edges and one or more other nodes;
iteratively propagating, for at least a threshold number of iterations, the label values in the graph based on the nodes and the edges of the graph, the iterative propagation causing at least a portion of the second label value for the second node to be propagated from the second node to the first node through the indirect connection between the first and second nodes, wherein propagation of the at least a portion of the second label value for the second node causes the first label value for the first node to decrease or the second label value for the first node to increase, or both;
and providing, by the computer system, the determined label values for the nodes that result from the iterative propagation.
2 Assignments
0 Petitions
Accused Products
Abstract
The subject matter of this specification can be embodied in, among other things, a method that includes generating content-based keywords based on content generated by users of a social network. The method includes labeling nodes comprising user nodes, which are representations of the users, with advertising labels comprising content-based keywords that coincide with advertiser-selected keywords that are based on one or more terms specified by an advertiser. The method also includes outputting, for each node, weights for the advertising labels based on weights of advertising labels associated with neighboring nodes, which are related to the node by a relationship.
154 Citations
20 Claims
-
1. A computer-implemented method comprising:
-
receiving, at a computer system, a request to identify interests for users of a social network; accessing, by the computer system, a graph that includes i) nodes that represent at least a portion of the users of the social network and ii) edges that connect the nodes and that represent relationships among the portion of the users of the social network; assigning labels to at least some of the nodes of the graph based, at least in part, on content that is associated with the portion of the users on the social network, wherein the labels correspond to topics of user interest; determining, for the at least some of the nodes, label values for the assigned labels based, at least in part, on content that is associated with users that correspond to the at least some of the nodes, wherein the label values determined for the at least some of the nodes and the assigned labels indicate degrees to which the users represented by the at least some of the nodes are interested in the topics that correspond to the assigned labels, wherein a first label value for a first label and a second level value for a second label are determined for a first node and a second label value for the second label is determined for a second node, the first node and the second node having an indirect connection between each other that comprises a portion of the edges and one or more other nodes; iteratively propagating, for at least a threshold number of iterations, the label values in the graph based on the nodes and the edges of the graph, the iterative propagation causing at least a portion of the second label value for the second node to be propagated from the second node to the first node through the indirect connection between the first and second nodes, wherein propagation of the at least a portion of the second label value for the second node causes the first label value for the first node to decrease or the second label value for the first node to increase, or both; and providing, by the computer system, the determined label values for the nodes that result from the iterative propagation. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17)
-
-
18. A system comprising:
-
a computer system comprising a processor and memory; an interface of the computer system to receive a request to identify interests for users of a social network; a classifying module of the computer system to access a graph that includes i) nodes that represent at least a portion of the users of the social network and ii) edges that connect the nodes and that represent relationships among the portion of the users of the social network; a label generator of the computer system to assign labels to at least some of the nodes of the graph based, at least in part, on content that is associated with the portion of the users on the social network, wherein the labels correspond to topics of user interest; and a label value modifier module of the computer system to; determine, for the at least some of the nodes, label values for the assigned labels based, at least in part, on content that is associated with users that correspond to the at least some of the nodes, wherein the label values determined for the at least some of the nodes and the assigned labels indicate degrees to which the users represented by the at least some of the nodes are interested in the topics that correspond to the assigned labels, wherein a first label value for a first label and a second label value for a second label are determined for a first node and the second label value for a second label is determined for a second node, the first node and the second node having an indirect connection between each other that comprises a portion of the edges and one or more other nodes; and iteratively propagate, for at least a threshold number of iterations, the label values in the graph based on the nodes and the edges of the graph, the iterative propagation causing at least a portion of the second label value for the second node to be propagated from the second node to the first node through the indirect connection between the first and second nodes, wherein propagation of the at least a portion of the second label value for the second node causes the first label value for the first node to decrease or the second label value for the first node to increase, or both. - View Dependent Claims (19)
-
-
20. A computer program product embodied in a computer readable storage device including instructions that, when executed, cause a one or more computer processors to perform operations comprising:
-
receiving a request to identify interests for users of a social network;
accessing a graph that includes i) nodes that represent at least a portion of the users of the social network and ii) edges that connect the nodes and that represent relationships among the portion of the users of the social network;
assigning labels to at least some of the nodes of the graph based, at least in part, on content that is associated with the portion of the users on the social network, wherein the labels correspond to topics of user interest;determining, for the at least some of the nodes, label values for the assigned labels based, at least in part, on content that is associated with users that correspond-to the at least some of the nodes, wherein the label values determined for the at least some of the nodes and the assigned labels indicate degrees to which the users represented by the at least some of the nodes are interested in the topics that correspond to the assigned labels, wherein a first label value for a first label and a second label value for a second label are determined for a first node and a second label value for the second label is determined for a second node, the first node and the second node having an indirect connection between each other that comprises a portion of the edges and one or more other nodes; iteratively propagating, for at least a threshold number of iterations, the label values in the graph based on the nodes and the edges of the graph, the iterative propagation causing at least a portion of the second label value for the second node to be propagated from the second node to the first node through the indirect connection between the first and second nodes, wherein propagation of the at least a portion of the second label value for the second node causes the first label value for the first node to decrease or the second label value for the first node to increase, or both; and providing the label values for the nodes resulting from the iterative propagation.
-
Specification