System for building a data structure representing a network of users and advertisers
First Claim
1. A method for building a data structure representing a network of users and advertisers, the method comprising:
- identifying a historical dataset comprising a plurality of query items wherein each query item is associated with a set of advertisement items;
linking each query item in the plurality of query items to each advertisement item in the set of advertisement items associated with the query item to generate a plurality of query-advertisement link items;
determining a weight for each query-advertisement link item;
storing each query-advertisement link item and the weight calculated for each query-advertisement link item in a data structure if the query-advertisement link item satisfies a condition.
3 Assignments
0 Petitions
Accused Products
Abstract
A system is described for building a data structure representing a network of advertisers and users. The system may include a memory and a processor. The memory may be operatively connected to the processor and may store a historical dataset comprising of a plurality of query items and advertisement items, a plurality of query-advertisement link items, a weight, a data structure and a condition. The processor may identify the historical dataset, and link the query items to the advertisement items to generate query-advertisement link items. The processor may determine the weight of each query-advertisement link item and may store the query-advertisement link items and the weight in the data structure if the query-advertisement link item satisfies the condition.
-
Citations
20 Claims
-
1. A method for building a data structure representing a network of users and advertisers, the method comprising:
-
identifying a historical dataset comprising a plurality of query items wherein each query item is associated with a set of advertisement items; linking each query item in the plurality of query items to each advertisement item in the set of advertisement items associated with the query item to generate a plurality of query-advertisement link items; determining a weight for each query-advertisement link item; storing each query-advertisement link item and the weight calculated for each query-advertisement link item in a data structure if the query-advertisement link item satisfies a condition. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9)
-
-
10. A method of constructing a bipartite graph out of click log data, comprising:
-
identifying a set of unique queries in the click log data; creating a set of query nodes in a bipartite graph wherein each node comprises a query in the set of unique queries; identifying a set of unique ads in the click log data; creating a set of ad nodes in the bipartite graph wherein each ad node comprises an ad in the set of unique ads; identifying a set of clicks in the click log data wherein each click comprises a query and an ad; building an edge from each query node in the set of query nodes to each ad node in the set of ad nodes if the set of clicks contains a click comprising the query node and the ad node; and storing the query nodes in the bipartite graph, the ad nodes in the bipartite graph, and each built edge in a data structure. - View Dependent Claims (11, 12, 13, 14)
-
-
15. A system for building a data structure representing a network of users and advertisers, comprising:
-
a memory to store a historical dataset comprising a plurality of query items wherein each query item is associated with a set of advertisement items, a plurality of query-advertisement link items, a weight, a data structure, and a condition; and a processor operatively connected to the memory, the processor operative to identify the historical dataset, link each query item in the plurality of query items to each advertisement item in the set of advertisement items associated with the query item to generate a plurality of query-advertisement link items, determine the weight of each query-advertisement link item and store each query-advertisement link item and the weight in the data structure if the query-advertisement link item satisfies the condition. - View Dependent Claims (16, 17, 18, 19, 20)
-
Specification