Collective Expansion of Bid-Terms for Campaign Optimization
Systems and methods for building an index for matching queries and bidded terms are disclosed. The expansion of the bid-terms includes a collective expansion using graph mining techniques on a subgraph extracted from user actions on a <query, URL> bi-partite graph. The extracted subgraph is specific to an AdGroup (obtained using all the available context) and is personalized. The extracted subgraph can be tuned to various objectives such as head/torso/tail, specific vs generic etc. Multiple relevance measures of candidate query nodes are calculated with reference to multiple source nodes or context, and the final rankings are biased to commercial relevance using personalized random-walks.
1 . A method for creating an index for expanding bidded terms, the method comprising:
receiving a group of bid-terms;
accessing a query-uniform resource locator graph, the graph comprising query nodes, uniform resource locator (URL) nodes, and edges modeling transition probabilities between nodes;
extracting a local sub-graph from the query-URL graph for each bid-term among the group of bid-terms to derive a plurality of sub-graphs comprising a bid-term seed node, related URL nodes, and candidate bid-term nodes;
merging the local subgraphs to form a merged graph;
annotating the merged graph with additional information;
computing the sum of probabilities across all paths between each bid-term seed node and each candidate bid-term node;
computing a relevance score for each candidate bid-term node;
constructing a preference vector for the merged graph to bias for highly bidded source terms and relevant bidded candidates;
scoring the candidate bid-term nodes of the merged graph using the preference vector;
computing a probability of reaching a candidate node from a seed node; and
attributing each candidate node of the merged graph to a seed node having the highest probability of reaching the candidate node.
2 . The method of claim 1 , further comprising:
computing a utility for sets of URLs between each bid term seed node and each candidate bid term node; and
pruning the candidate bid term nodes based on the computed utility.
3 . The method of claim 1 , further comprising:
computing a probability for each path from a bid term seed node to each related bid term node for each local sub-graph;
pruning the local subgraphs based on the computed probability.
4 . The method of claim 1 , wherein the query-uniform resource locator graph is derived from a search log.
5 . The method of claim 1 , wherein the additional information is selected from the list consisting of number of clicks for each query node, the number of advertisers bidding on each query node, the number of clicks to a specific URL for each edge, the total number of queries linked to each URL node, the total number of clicks for each URL, and the total number of linked Queries for each URL.
6 . A method for creating an index for expanding bidded terms, the method comprising:
accessing a query-uniform resource locator graph, the graph comprising query nodes, uniform resource locator (URL) nodes, and edges modeling transition probabilities between nodes;
extracting a local sub-graph from the query-URL graph for each bid term among a group of bid terms to derive a plurality of sub-graphs comprising a bid term seed node, related URL nodes, and candidate bid term nodes;
merging the local subgraphs to form a merged graph;
personalizing the merged graph;
computing at least one relevance measure for each candidate bid term node with respect to each bid term seed node; and
ranking the candidate bid term nodes for each bid term seed node, the ranking biased according to commercial relevance.
7 . The method of claim 6 , further comprising pruning the local sub-graphs prior to merging.
8 . The method of claim 6 , wherein the query-uniform resource locator graph is derived from a search log.
9 . The method of claim 6 , wherein ranking the candidates comprises a personalized page rank of the merged graph.
10 . A system for serving advertisements related to a user query, the system comprising:
an indexing module configured to:
access a query-uniform resource locator graph, the graph comprising query nodes, uniform resource locator (URL) nodes, and edges modeling transition probabilities between nodes;
extract a local sub-graph from the query-URL graph for each bid term among a group of bid terms to derive a plurality of sub-graphs comprising a bid term seed node, related URL nodes, and candidate bid term nodes;
merge the local subgraphs to form a merged graph;
personalize the merged graph;
computing at least one relevance measure for each candidate bid term node with respect to each bid term seed node; and
rank the candidate bid term nodes for each bid term seed node, the ranking biased according to commercial relevance;
a matching module configured to:
receive a user query;
match the user query with at least one bid term node from among the ranked bid term nodes and a seed bid term node; and
select an advertisement basted on the matched bid term.
11 . The system of claim 10 , further comprising a storage module configured to store the ranking of the candidate bid term nodes.
12 . The system of claim 10 , further comprising an ad serving module configured to serve the selected advertisement.
13 . The system of claim 10 , further comprising a memory storing a search engine log for deriving the query uniform resource locator log.