Patent application number | Description | Published |
20080256037 | METHOD AND SYSTEM FOR GENERATING AN ORDERED LIST - A system for generating an ordered list. The system may include a query engine and an advertisement engine. The query engine receives a query from the user and determines parameters to match with the advertisement. The advertisement engine receives the parameters and generates a list of items based on the parameters. The system may function in a precompute mode to calculate intervals for each available item to minimize the variable processing costs for each item. Further, the number of intervals a crossed item may be selected in a manner to satisfy a given space constraint. By characterizing each item by a minimum price within each interval, the system can quickly query the interval matching the desired quantity for each item and determined if the minimum price for that interval is less than the top-k prices already included in the list. | 10-16-2008 |
20080288480 | EFFICIENT ONLINE COMPUTATION OF DIVERSE QUERY RESULTS - The system includes a query engine and an advertisement engine. The query engine is configured to receive a query from the user. The advertisement engine generates advertisement results corresponding to the query. The advertisement results are selected from entries in an advertisement database, where the entries include predicate values corresponding to a domain. The advertisement engine generates a diverse advertisement result that is a subset of the database entries that match the query. The diversity result varies at least one predicate by selecting entries for the list that include a proportional representation of each available predicate value in the database that matches the query. | 11-20-2008 |
20090112846 | SYSTEM AND/OR METHOD FOR PROCESSING EVENTS - The subject matter disclosed herein relates to processing information regarding events. In one particular example, a stabbing query may be formulated in response to an event. One or more sets are associated with and/or mapped to nodes of a tree. | 04-30-2009 |
20090132556 | OFFLINE OPERATIONS FOR ONLINE APPLICATIONS - Subject matter disclosed herein may relate to enabling offline operations for online applications. | 05-21-2009 |
20090132959 | METHOD AND/OR SYSTEM FOR SCHEMA AND VIEW GENERATION - The subject matter disclosed herein relates to a method and/or system for generating schema responsive to user navigation patterns. | 05-21-2009 |
20090204703 | AUTOMATED DOCUMENT CLASSIFIER TUNING - Subject matter disclosed herein relates to document classification and/or automated document classifier tuning. | 08-13-2009 |
20090319476 | ADAPTIVE MATERIALIZED VIEW SELECTION FOR DATABASES - Techniques described herein adaptively select materialized view fragments for persistent maintenance. During an interval of time, the selected fragments are persistently maintained in the database system, while the other non-selected fragments are not persistently maintained as materialized view fragments. Over time, the composition of the set of selected fragments may change. As queries are executed in the database system over an interval of time, statistics including the frequency of access of each currently selected fragment during that interval are generated. At the start of the next interval of time, based on these statistics, some currently selected fragments may be unselected. Some currently non-selected fragments of one or more candidate materialized views may be selected based on the statistics. For the next interval, the newly unselected fragments cease to be persistently maintained as materialized view fragments, while the newly selected fragments begin to be persistently maintained as materialized view fragments. | 12-24-2009 |
20100023564 | SYNCHRONOUS REPLICATION FOR FAULT TOLERANCE - Subject matter disclosed herein relates to data management of multiple applications, and in particular, to fault tolerance for such management. | 01-28-2010 |
20100036865 | Method For Generating Score-Optimal R-Trees - A method of constructing a score-optimal R-tree to support top-k stabbing queries over a set of scored intervals generates a constraint graph from the set, and determines over each node in the constraint graph that has no other nodes pointing to it the node with the smallest left endpoint; for each of these nodes, the associated interval is added to the tree and the node is removed from the constraint graph. | 02-11-2010 |
20100082393 | DISPLAY ADVERTISING CONTRACT PRICING - Example embodiments described herein may relate to pricing contracts for a display advertising system utilized, for example, in Web-based advertising. | 04-01-2010 |
20100082401 | FORECASTING FOR ADVERTISING INVENTORY ALLOCATION - Subject matter disclosed herein relates to a system for managing online advertising, and in particular, to pricing of advertising inventory and its allocation to advertising campaigns. | 04-01-2010 |
20100082404 | SYSTEM AND METHOD FOR UTILIZING DATE CONSTRAINTS IN AN ADVERTISEMENT SERVING SYSTEM - Generally, embodiments of the present invention provide for methods, systems and computer program products for utilizing date constraints in an advertisement serving system. The method according to one embodiment of the present invention comprises receiving a request for one or more advertisements that satisfy one or more constraints. A set of advertisement contracts is generated, wherein the set of advertisement contracts comprise one or more advertisement contracts that satisfy the one or more constraints. The contractual time period for a given advertisement contract in the set of advertisement contracts is then determined. A subset of advertisement contracts is then generated, wherein the subset of advertisement contracts comprises the advertisement contracts in the set of advertisement contracts that are active on a given date. The subset of advertisement contracts is then inputted into an optimization algorithm and one or more advertisement contracts are selected by the optimization algorithm. | 04-01-2010 |
20100082412 | SYSTEM AND METHOD FOR OPTIMIZING AN ADVERTISEMENT PLAN FOR ALLOCATING ADVERTISEMENTS TO A CONTRACT IN A NETWORK-BASED ENVIRONMENT - The present invention is directed to a system and method for optimizing an advertisement plan for allocating advertisements to a contract in a network-based environment. The system and method includes determining a shadow price for an advertisement placement where the advertisement placement is associated with a user having defined characteristics. The system and method includes determining a contract price for the advertisement placement relative to a plurality of advertisement contracts for the user having the defined characteristics. The system and method includes determining an advertisement plan for allocating an advertisement to a given contract on the basis of the shadow price and the contract price. The system and method includes presenting a given advertisement associated with the given contract according to the advertisement plan on network-based output. | 04-01-2010 |
20100082424 | OFFLINE OPTIMIZATION OF ONLINE PROCESSES - Subject matter disclosed herein relates to a system for managing online resources, and in particular, to a system using an offline process to optimize the management of such online resources. | 04-01-2010 |
20100082428 | DISPLAY ADVERTISING INVENTORY ESTIMATION - Example embodiments described herein may relate to estimating inventory for a display advertising system utilized, for example, in Web-based advertising. | 04-01-2010 |
20100094881 | SYSTEM AND METHOD FOR INDEXING SUB-SPACES - The present invention is directed to systems and methods for identifying compatible advertisement contracts to satisfy an advertisement opportunity. The systems and methods include receiving a number of attribute values associated with a user accessing a network-based location. The systems and methods include sorting an index of lists for a plurality of advertisement contracts on the basis of a number of contract term values. The systems and methods include traversing the index of lists to return a set advertisement contracts compatible with the number of attribute values associated with the user. The systems and methods include selecting a given advertisement contract from the set of advertisement contracts compatible with the number of attribute values associated with the user. The systems and methods include presenting an advertisement associated with the given advertisement contract on a display viewable by the user accessing the network-based location. | 04-15-2010 |
20100106604 | Multi-Stage Bidding System for Guaranteed Advertising Contracts in a Network of Networks - This patent discloses a system to host a multi-stage competition for an online advertisement opportunity in a network of networks. The online advertisement opportunity may be received in a second network from a first network as a result of a process where a first bid from a first software agent representing a guaranteed contract may be compared with a second bid from a second software agent representing one of a nonguaranteed contract and a guaranteed contract. A third bid for the online advertisement opportunity may be received in the second network from a third software agent representing a guaranteed contract. In addition, a fourth bid for that same online advertisement opportunity may be received in the second network from a fourth software agent representing one of a nonguaranteed contract and a guaranteed contract. | 04-29-2010 |
20100106613 | Bidding System for Guaranteed Advertising Contracts in an Online Spot Market - This patent discloses a system to host a competition for an online advertisement opportunity. Notice of the online advertisement opportunity may be sent to software agents, one of which may represent a guaranteed contract. On receipt of the notice, the software agents may prepare and submit bids. An ad server may receive bids, including a first bid from a first software agent representing a guaranteed contract and a second bid from a second software agent representing a nonguaranteed contract. The ad server may screen out bids and arbitrate the remaining bids to determine a highest bidder for the online advertisement opportunity. | 04-29-2010 |
20100114689 | SYSTEM FOR DISPLAY ADVERTISING OPTIMIZATION USING CLICK OR CONVERSION PERFORMANCE - An advertisement impression distribution system includes a data processing system operable to generate an allocation plan for serving advertisement impressions. The allocation plan allocates a first portion of advertisement impressions to satisfy guaranteed demand and a second portion of advertisement impressions to satisfy non-guaranteed demand. The data processing system includes an optimizer, the optimizer to establish a relationship between the first portion of advertisement impressions and the second portion of advertisement impressions. The relationship defines a range of possible proportions of allocation of the first portion of advertisement impressions and the second portion of advertisement impressions. The optimizer generates a solution in accordance with maximizing guaranteed demand fairness, non-guaranteed demand revenue and click or conversion value, where the solution identifies a determined proportion of the first portion of advertisement impressions to serve and a determined proportion of the second portion of advertisement impressions to serve. The data processing system outputs the allocation plan including the solution to control serving of the advertisement impressions in the determined proportions. | 05-06-2010 |
20100185485 | ALLOCATION OF INTERNET ADVERTISING INVENTORY - A method and system for allocating inventory in an Internet environment is provided. A method employed by the system may include generating samples of representatives that represent impression inventory, where each sample represents a number of users to which impressions are deliverable. An order may be received. The order may include a number of impressions to book and target audience information. A cushion of impressions needed to guarantee delivery of the number of impressions ordered may be determined. The number of impressions ordered plus the cushion may be allocated from the samples. A contract including the target audience information, the number of impressions, and the cushion may be stored to a database. | 07-22-2010 |
20100262607 | System and Method for Automatic Matching of Contracts to Impression Opportunities Using Complex Predicates and an Inverted Index - A method for indexing advertising contracts for rapid retrieval and matching in order to match satisfying contracts to advertising slots. The descriptions of the advertising contracts include logical predicates indicating applicability to a particular demographic. Also, the descriptions of advertising slots contain logical predicates indicating applicability to a particular demographic, thus matches can be performed using at least matches on the basis of intersecting demographics. The disclosure contains structure and techniques for receiving a set of contracts with predicates, preparing a data structure index of the set of contracts, receiving an advertising slot with predicates, and structure and techniques for retrieving from the data structure contracts that satisfy a match to the advertising slot predicates. The disclosure includes cases were the predicates are presented in conjoint forms and in disjoint forms, and techniques are provided to consider indexing and matching in cases of IN predicates and well as NOT-IN predicates. | 10-14-2010 |
20100318413 | ALLOCATION OF INTERNET ADVERTISING INVENTORY - A method for determining a price of a contract for booking advertising space in a networked environment includes receiving, via a web server, a request to book a number of impressions from available impression inventory, where each impression corresponds to the delivery of an advertisement to a browser. The method also includes assembling user samples that represent a total amount of impression inventory, where each user sample represents a number of internet users, calculating a value associated with each piece of remaining impression inventory of the total impression inventory, and evaluating the value of all remaining impression inventory before and after allocation to a contract by maximizing and equation subject to a set of constraints. The base price for the contract corresponds to the difference between the value of the inventory before and after allocation. | 12-16-2010 |
20100318432 | ALLOCATION OF INTERNET ADVERTISING INVENTORY - A method for allocating inventory in a networked environment includes receiving a request to purchase a number of display impressions, the request including targeting parameters and a frequency constraint corresponding to a maximum number of times the advertisement can be displayed to a user. The method also includes allocating the requested number of display impressions across a set of user samples, where the number of impressions allocated to any one user sample in the set of user samples is constrained by the frequency constraint. Allocation information that defines how the impressions are allocated among the user samples is stored to a user sample database. | 12-16-2010 |
20110015999 | SYSTEM AND METHOD FOR UTILIZING A LATTICE STORAGE STRUCTURE IN AN ADVERTISEMENT SERVING SYSTEM - Embodiments of the present invention provide for methods, systems and computer program products for utilizing a lattice structure in an advertisement serving system. The method according to one embodiment of the present invention comprises storing one or more advertisement contracts in a lattice structure. A request for one or more advertisements that satisfy one or more constraints is then received and within the lattice structure, a lowest level of one or more pools of advertisement contracts satisfying the one ore more constraints is located. A set of advertisement contracts is generated, wherein the set of advertisement contracts comprise one or more advertisement contracts from lowest level of the lattice structure. The method further comprises adding to the set of advertisement contracts advertisement contracts from the pools of advertisement contracts that are parent to the pools of contracts in the lowest level of the lattice structure. | 01-20-2011 |
20110208559 | Automatic Management of Networked Publisher-Subscriber Relationships - Automatic management of networked publisher-subscriber relationships in an advertising server network. The method comprises steps for constructing a directed graph representation comprising at least one publisher node (e.g. an Internet property), at least one subscriber node (e.g. an Internet advertiser), at least one intermediary node (e.g. an Internet advertising agent), and at least one edge (e.g. an advertising target predicate) wherein any one of the edges is directly associated with at least one target predicate. The directed graph representation is used in conjunction with an inverted index for retrieving a valid node list comprising only nodes having at least one target predicate that matches at least one event predicate. The event predicate (as well as any target predicate) is any arbitrarily complex Boolean expression, and is used in producing a result node list comprising only nodes that concurrently match the event predicate with an advertising target predicate and are reachable. | 08-25-2011 |
20110208591 | Forecasting Online Advertising Inventory of Day Parting Queries - Disclosed is a system to forecast a supply of online advertising demand contracts having day parting targets. The system may receive an online advertising demand contract having a flight duration and a day parting target. The received online advertising demand contract may be processed by converting the day parting target into an hour-of-week day parting target vector. If a first day of the flight duration would generate a conflict in view of the hour-of-week day parting target vector, then the system may generate a new first day contract for the first day of the flight duration. | 08-25-2011 |
20110213659 | System and Method for Automatic Matching of Contracts in an Inverted Index to Impression Opportunities Using Complex Predicates and Confidence Threshold Values - A method for automatic matching of contracts to inventory using a fixed-length complex predicate representation. An item of inventory is described as a Boolean expression, which is converted into a multi-level, alternating AND/OR impression tree representation with leaf nodes representing conjuncts. Processing the conjuncts of the tree through a contract index results in retrieving a set of candidate contracts that match the at least some but not necessarily all impression tree leaf node predicates. Next, an AND/OR contract tree representation is constructed with each contract tree leaf node having a label representing a projection onto a discrete set of ordered symbols. Contracts with projections that cover the entire range of discrete set of ordered symbols are deemed to satisfy the item of inventory. Implementation of the contract index includes retrieval techniques to support multi-valued predicates as well as confidence threshold functions using a multi-level tree representation of multi-valued predicates. | 09-01-2011 |
20110213660 | System and Method for Automatic Matching of Contracts in an Inverted Index to Impression Opportunities Using Complex Predicates with Multi-Valued Attributes - A method for automatic matching of contracts to inventory using a fixed-length complex predicate representation. An item of inventory is described as a Boolean expression, which is converted into a multi-level, alternating AND/OR impression tree representation with leaf nodes representing conjuncts. Processing the conjuncts of the tree through a contract index results in retrieving a set of candidate contracts that match the at least some but not necessarily all impression tree leaf node predicates. Next, an AND/OR contract tree representation is constructed with each contract tree leaf node having a label representing a projection onto a discrete set of ordered symbols. Contracts with projections that cover the entire range of discrete set of ordered symbols are deemed to satisfy the item of inventory. Implementation of the contract index includes retrieval techniques to support multi-valued predicates as well as confidence threshold functions using a multi-level tree representation of multi-valued predicates. | 09-01-2011 |
20110213767 | System and Method for Automatic Matching of Contracts Using a Fixed-Length Predicate Representation - A method for automatic matching of contracts to inventory using a fixed-length complex predicate representation. An item of inventory is described as a Boolean expression, which is converted into a multi-level, alternating AND/OR impression tree representation with leaf nodes representing conjuncts. Processing the conjuncts of the tree through a contract index results in retrieving a set of candidate contracts that match the at least some but not necessarily all impression tree leaf node predicates. Next, an AND/OR contract tree representation is constructed with each contract tree leaf node having a label representing a projection onto a discrete set of ordered symbols. Contracts with projections that cover the entire range of discrete set of ordered symbols are deemed to satisfy the item of inventory. Implementation of the contract index includes retrieval techniques to support multi-valued predicates as well as confidence threshold functions using a multi-level tree representation of multi-valued predicates. | 09-01-2011 |
20110225038 | System and Method for Efficiently Evaluating Complex Boolean Expressions - An improved system and method for efficiently evaluating complex Boolean expressions is provided. Leaf nodes of Boolean expression trees for objects represented by Boolean expressions of attribute-value pairs may be assigned a positional identifier that indicates the position of a node in the Boolean expression tree. The positional identifiers of each object may be indexed by attribute-value pairs of the leaf nodes of the Boolean expression trees in an inverted index. Given an input set of attribute-value pairs, a list of positional identifiers for leaf nodes of virtual Boolean expression trees may be found in the index matching the attribute-value pairs of the input set. The list of positional identifiers of leaf nodes may be sorted in order by positional identifier for each contract. An expression evaluator may then verify whether a virtual Boolean expression tree for each contract is satisfied by the list of positional identifiers. | 09-15-2011 |
20110231248 | IMPRESSION-TREND TECHNIQUES FOR PROVIDING A DISPLAY ADVERTISING SUPPLY FORECAST - Techniques are described herein for using an impression-trend technique to provide a display advertising supply forecast. A display advertising supply forecast is an estimate of a number of impressions, which are to occur in a future time period, that have specified attribute values. For example, the specified attribute values may be descriptive of impressions with respect to which an advertiser wishes to place ads. An impression-trend technique is a forecasting technique that uses trends regarding past impressions to forecast a number of future impressions that have specified attribute values. The past impressions include attribute values that are related to the specified attribute values. | 09-22-2011 |
20110246307 | Mass-Based Approach for Serving Impressions in Guaranteed Delivery Advertising - A computer-implemented Internet advertising method for serving impression opportunities in a system for delivery of display advertising. The likelihood that a booked contract could be served by a future forecasted user visit is calculated as a probability mass, and associated with the booked contract. The relative sizes of the probability masses of a plurality of eligible contracts is used as a selector in conjunction with a selected pseudo-random number. In exemplary embodiments, a server is configured for receiving an event predicate as a result of a user visit to a web site. Based on the received event predicate, a set of eligible contracts is assembled. Each eligible contract is assigned to exactly one interval selected from a range, the size of the interval corresponding to the probability mass of the eligible contract. The generated pseudo-random number is used for selecting an interval, which operation selects an eligible advertisement for display. | 10-06-2011 |
20110251964 | Pricing Guaranteed Delivery Contracts in Online Display - A method for pricing a contract for serving advertisements in an online display advertising environment comprising receiving a subject contract, the subject contract having at a target predicate for matching to a user visit, then forecasting, using a computer-based forecasting module, a set of user visits eligible to be served to the subject contract, wherein eligibility is based on matching the target predicate to a user visit (which user visit may be associated with an event predicate). Having a set of forecasted (matching) user visits, the method proceeds to select a set of eligible historical contracts that would be eligible to be served to the forecasted user visits. Finally, having a set of eligible historical contracts that would be eligible to be served to the target predicate, a curve fitting technique yields a price for the subject contract that minimizes the error in the price relative to expected user visits. | 10-13-2011 |
20110270676 | Probabilistic Linking Approach for Serving Impressions in Guaranteed Delivery Advertising - A computer-implemented method and display advertising server network for serving impression opportunities to a frequency-capped guaranteed delivery contract in a system for delivery of display advertising to a user. The method includes steps for receiving, from a computer, an event predicate and a user ID corresponding to the user, retrieving, from an index engine, a set of eligible frequency-capped contracts, wherein an eligible contract comprises at least one target predicate matching at least a portion of the event predicate, and probabilistically selecting for serving, in a computer, the booked contract having a frequency cap specification, only when the selected frequency-capped contract can be served to the user without violating the frequency cap specification. Exemplary embodiments include generating a pseudo-random number sequence, and then selecting a particular pseudo-random number from the series of pseudo-random numbers, the selected particular pseudo-random number being based on the user ID, a visit count, a URL. | 11-03-2011 |
20120004957 | FORECASTING SUPPLY FOR ADVERTISEMENTS ACCORDING TO A NON-PARAMETRIC SUPPLY MODEL - Methods, systems, and apparatuses for generating supply forecasts for advertisement impressions are provided. Supply forecasts for future advertisement inventory are enabled to be determined that match attribute values received from a requester in a query or “contract.” Such supply forecasts may be determined based on cumulative or non-cumulative supply forecast values, and may be determined based on time series of supply forecast values for individual impressions or for blocks of impressions. | 01-05-2012 |
20120004979 | INTRASTRUCTURE FOR BUCKET TESTING IN GUARANTEED DELIVERY OF ONLINE ADVERTISING - Techniques are provided relating to conducting bucket testing in connection with guaranteed delivery online advertising associated with an online advertising marketplace. Techniques are provided in which advertising supply, demand, or both are partitioned into buckets. Operating policies are established for each of the buckets, in which the operating policies for each of the buckets differ. Following serving of advertisements in accordance with the operating policies, difference is measured in at least one outcome, between buckets. | 01-05-2012 |
20120004980 | INVENTORY MANAGEMENT AND SERVING WITH BUCKET TESTING IN GUARANTEED DELIVERY OF ONLINE ADVERTISING - Techniques are provided to facilitate bucket testing in connection with guaranteed delivery online advertising associated with an online advertising marketplace. Operating policies are established for each of the buckets, in which the operating policies for each of the buckets differ. Bucket controller programming logic is used in implementation of the operating policies. Allocation and serving of advertisements is facilitated in accordance with the operating policies. | 01-05-2012 |
20120004981 | ADVERTISEMENT AND CAMPAIGN EVALUATION WITH BUCKET TESTING IN GUARANTEED DELIVERY OF ONLINE ADVERTISING - Techniques are provided relating to conducting bucket testing, relating to advertisement performance or advertisement campaign performance, in connection with guaranteed delivery online advertising associated with an online advertising marketplace. Techniques are provided in which advertising supply, demand, or both are partitioned into buckets. Differing allocation policies are established for each of the buckets. Following serving of advertisements in accordance with the operating policies, difference is measured, between the buckets, and the difference is used to evaluate differing advertisement performance or differing advertisement campaign performance between the buckets. | 01-05-2012 |
20120084155 | PRESENTATION OF CONTENT BASED ON UTILITY - Methods and systems for presenting content such as articles based on utility are provided. In one embodiment, a plurality of articles are determined, each article in the plurality of articles including article content and a corresponding preview icon, the preview icon defining a link to the corresponding article content when presented. For each article in the plurality of articles, a user experience utility value is determined. And for each article in the plurality of articles, an economic utility value is also determined. A ranked order of the articles is determined based upon each article's user experience utility value and economic utility value. And a portion of the preview icons of the articles are presented on a graphical display page in a priority orientation based on the ranked order of the articles. | 04-05-2012 |
20120158495 | INVENTORY ALLOCATION IN ADVERTISING SYSTEMS - A network based advertisement system includes a supply forecasting system configured to select, from a campaign log database, data that defines a plurality of contracts. Each contract specifies requirements that include contract target audience information and a number of impressions. For each contract, the supply forecasting system identifies one or more opportunity samples with characteristics that match contract target audience information of the contract. Each opportunity sample is associated with a weight that corresponds to a number of opportunities with similar characteristics. An optimizer associates the opportunity samples with the contract and then determines whether the opportunity samples are associated with other contracts. The optimizer then limits the number of opportunities associated with the samples that are allocatable to the contract based at least in part on a function of requirements of other contracts associated with the one or more samples. | 06-21-2012 |
20120166259 | Adjusting Demand Parameters To Reduce Allocation Errors in Display Advertising - A system and method for adjusting demand parameters to produce an optimized allocation plan for delivering a plurality of impressions to a plurality of contracts for display advertising. The method commences upon receiving a first eligibility graph, the first eligibility graph comprising a plurality of impressions, a plurality of contracts and at least one first demand parameter. For reducing errors in sampling that affect the eligibility graph, demand parameters contained within the first eligibility graph are adjusted, resulting in an adjusted first eligibility graph. Once the adjusted first eligibility graph is available, a network solver is used for solving the adjusted first eligibility graph to produce an adjusted allocation plan, which adjusted allocation plan is used for displaying at least one of the plurality of impressions. | 06-28-2012 |
20140019232 | IMPRESSION-TREND TECHNIQUES FOR PROVIDING A DISPLAY ADVERTISING SUPPLY FORECAST - Techniques are described herein for using an impression-trend technique to provide a display advertising supply forecast. A display advertising supply forecast is an estimate of a number of impressions, which are to occur in a future time period, that have specified attribute values. For example, the specified attribute values may be descriptive of impressions with respect to which an advertiser wishes to place ads. An impression-trend technique is a forecasting technique that uses trends regarding past impressions to forecast a number of future impressions that have specified attribute values. The past impressions include attribute values that are related to the specified attribute values. | 01-16-2014 |
20140089124 | Dynamic Product Content Generation - Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for building and serving dynamic product advertisements. A request is received for content including request data. Product data is accessed representing multiple product records, each associated with a different product. Multiple matching rules are applied to each of the product records in order to identify a subset of product records satisfying the matching rules. For each of the product records satisfying the matching rules, multiple scores are generated, each score representing the relevance of the product to the request based on the request data. The scores are aggregated. One or more of the product records are selected based at least on the aggregate scores. A dynamic product content item is served in response to the request featuring the products associated with the one or more selected product records. | 03-27-2014 |
20150032843 | RESOURCE LOCATOR REMARKETING - Methods, systems, and apparatus for resource locator remarketing are presented. In one aspect, a method includes receiving visitation data from a publisher, the visitation data specifying a device identifier and a resource locator specifying a resource that was provided to a user device; identifying a content feed that includes regular expressions, each regular expression specifying matching character strings and a set of content items that are eligible to be provided to user devices corresponding to visitation data including a resource locator matching one of the regular expressions; identifying, a first matching regular expression that matches the resource locator specified by the visitation data; selecting a content item from the content items that correspond to the first matching regular expression; and providing data that causes presentation of the selected content item to the user device. | 01-29-2015 |
20150032849 | RESOURCE LOCATOR REMARKETING - Methods, systems, and apparatus for resource locator remarketing are presented. In one aspect, a method includes receiving visitation data from a publisher, the visitation data specifying a device identifier and a resource locator specifying a resource that was provided to a user device; identifying a content feed that includes regular expressions, each regular expression specifying matching character strings and a set of content items that are eligible to be provided to user devices corresponding to visitation data including a resource locator matching one of the regular expressions; identifying, a first matching regular expression that matches the resource locator specified by the visitation data; selecting a content item from the content items that correspond to the first matching regular expression; and providing data that causes presentation of the selected content item to the user device. | 01-29-2015 |