Patent application number | Description | Published |
20090132334 | System and Method for Estimating an Amount of Traffic Associated with a Digital Advertisement - Systems and methods for estimating an amount of traffic associated with a digital ad are disclosed. Generally, a forecasting module identifies a set of candidate webpages on which a digital ad may be displayed and estimates a click through rate associated with the digital ad and a webpage of the set of candidate webpages. The forecasting module determines a ranking score associated with the digital ad based on the determined click through rate and a bid price associated with the digital ad. The forecasting module then examines historical data, such as search logs, to determine an estimate of traffic associated with the digital ad with respect to the webpage in response to determining the ranking score of the digital ad exceeds a ranking score associated with another digital ad that was previously displayed on the webpage. | 05-21-2009 |
20090254512 | AD MATCHING BY AUGMENTING A SEARCH QUERY WITH KNOWLEDGE OBTAINED THROUGH SEARCH ENGINE RESULTS - A method is provided to match an advertisement to a search query comprising: receiving search results produced by a search engine in response to a search query; producing an ad query that includes, unigram features, classification features with respect to an external classification system, and phrase features; producing a plurality of representations of corresponding advertisements in terms of the same types of features; and selecting one or more advertisements based upon a measure of similarity of ad query features to advertisements represented in terms of the same features. | 10-08-2009 |
20110099059 | INDEX-BASED TECHNIQUE FRIENDLY CTR PREDICTION AND ADVERTISEMENT SELECTION - Methods and systems are provided for click through rate prediction and advertisement selection in online advertising. Methods are provided in which output information from a feature-based machine learning model is utilized. The output information includes predicted click through rate information. The output information is used to form a matrix. The matrix is modeled using a latent variable model. Machine learning techniques can be used in determining values for unfilled cells of one or more model matrices. The latent variable model can be used in determining predicted click through rate information, and in advertisement selection in connection with serving opportunities. | 04-28-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 |
20110264640 | Using External Sources for Sponsored Search AD Selection - A system and a system are provided for using external sources (e.g., landing pages) for sponsored search ad selection. In one example, the system identifies one or more regions of an external source. The one or more regions are relevant to a query. The external source includes a source that includes relevant data that is usable for augmenting an ad selection process. The system extracts one or more features from the one or more regions. The system determines which of the one or more features are relevant for item indexing. The system then augments an item selection process by using the one or more features that are relevant for item indexing. | 10-27-2011 |
20130124509 | PUBLISH-SUBSCRIBE BASED METHODS AND APPARATUSES FOR ASSOCIATING DATA FILES - Various methods and apparatuses are provided which may be implemented using one or more computing devices within a networked computing environment to employ publish-subscribe techniques to associate subscriber encoded data files with a set of publisher encoded data files. | 05-16-2013 |
20140136590 | NETWORK-INDEPENDENT PROGRAMMING MODEL FOR ONLINE PROCESSING IN DISTRIBUTED SYSTEMS - Systems and methods include a distributed system that uses a declarative language to separate application logic from the network technology used to communicate. For example, in a system with a plurality of processing nodes, each processing node may include at least one processor, a networking layer for communicating with other processing nodes, and a memory storing instructions that, when executed by the at least one processor, cause the processing node to perform operations. The operations may include receiving a processing plan using the networking layer and analyzing the processing plan to determine a service to perform and a number of inputs anticipated for the service. The operations may also include performing the determined service. The processing plan defines a processing tree comprising a subset of the plurality of processing nodes, the processing tree having unidirectional communication from the root to a final level of the tree. | 05-15-2014 |