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 |
20090248627 | SYSTEM AND METHOD FOR QUERY SUBSTITUTION FOR SPONSORED SEARCH - A system and method are disclosed for rewriting queries. The queries may be rewritten into a bid phrase for identifying search results and/or advertisements. The bid phrase may be a keyword that is purchased for sponsored searching. A mapping between potential queries and bid phrases may be generated. The mapping may be referenced upon receiving a search query for identifying a query rewrite with a bid phrase for that search query. The mapping may be generated in preprocessing. | 10-01-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 |
20090282014 | Systems and Methods for Predicting a Degree of Relevance Between Digital Ads and a Search Query - Systems and methods for predicting a degree of relevance between a set of candidate digital ads and a search query are disclosed. Generally, an ad provider receives a digital ad request associated with a search query. The ad provider identifies a set of candidate digital ads that may be served in response to the digital ad request. A relevance module extracts a set of features from the set of candidate digital ads and the search query associated with the digital ad request, and determines a degree of relevance between the set of candidate digital ads and the search query based on a prediction model and the extracted set of features. If the relevance module determines the set of candidate digital ads is relevant to the search query, the ad provider may serve one or more digital ads from the set of candidate digital ads in response to the received digital ad request. | 11-12-2009 |
20090282015 | Systems and Methods for Predicting a Degree of Relevance Between Digital Ads and Webpage Content - Systems and methods for predicting a degree of relevance between a set of candidate digital ads and webpage content are disclosed. Generally, an ad provider receives a digital ad request associated with webpage content. The ad provider identifies a set of candidate digital ads that may be served in response to the digital ad request. A relevance module extracts a set of features from the set of candidate digital ads and the webpage content, and determines a degree of relevance between the set of candidate digital ads and the webpage content based on a prediction model and the extracted set of features. If the relevance module determines the set of candidate digital ads is relevant to the webpage content, the ad provider may serve one or more digital ads from the set of candidate digital ads in response to the received digital ad request. | 11-12-2009 |
20090282016 | Systems and Methods for Building a Prediction Model to Predict a Degree of Relevance Between Digital Ads and a Search Query or Webpage Content - Systems and methods for building a prediction model to predict a degree of relevance between digital ads and a search query or webpage content are disclosed. Generally, an indication of relevance is received between a plurality of digital ads and one of a webpage content or a search query. A set of features is extracted from the plurality of digital ads and one of the webpage content or the search query. A prediction model is then built to predict a degree of relevance between the set of candidate digital ads and one of a second webpage content or a second search query, where the prediction model is built based at least one the received indication of relevance and the extracted set of features. | 11-12-2009 |
20100010895 | PREDICTION OF A DEGREE OF RELEVANCE BETWEEN QUERY REWRITES AND A SEARCH QUERY - A predictor for determining a degree of relevance between a query rewrite and a search query is provided. The predictor may receive a search query from a user via a terminal and identify a set of candidate query rewrites associated with the search query. The predictor may then extract a set of features from advertisements associated with the query rewrites and the search query and determine a degree of relevance between the advertisements and the search query based on a prediction model. The predictor may then determine the degree of relevance between the rewrites and the search query based on the determined degree of relevance between the advertisements and the search query. | 01-14-2010 |
20100077209 | GENERATING HARD INSTANCES OF CAPTCHAS - Methods and systems are described for enhancing the difficulty of captchas and enlarging a core of available captchas that are hard for an automated or robotic user to crack. | 03-25-2010 |
20100077210 | CAPTCHA IMAGE GENERATION - Methods and systems are described for generating captchas and enlarging a core of available captchas that are hard for an automated or robotic user to crack. | 03-25-2010 |
20100106704 | CROSS-LINGUAL QUERY CLASSIFICATION - The subject matter disclosed herein relates to cross-lingual query classification. | 04-29-2010 |
20100161378 | System and Method for Retargeting Advertisements Based on Previously Captured Relevance Data - Methods for selecting one or more advertisements based on previously captured relevance data to serve to a client system requesting a primary webpage is provided. The client displays a referring webpage having a hyperlink to the primary webpage. Upon selection of the hyperlink, the client sends a request to a content server storing the primary webpage. The content server classifies the primary webpage for content and retrieves persistent relevance information, possibly including a referrer of the primary webpage comprising a URL address of the referring webpage, a listing of other recently visited webpages, a listing of any bid phrases from previously displayed advertisements, and a listing of recent click data. The content server sends the primary webpage to the client, which includes an advertisement server request. The transaction between the content server and the advertisement server includes persistence relevance information to select advertisements to serve to the client. | 06-24-2010 |
20100161605 | CONTEXT TRANSFER IN SEARCH ADVERTISING - A computer-implemented method is disclosed for determining a type of landing page to which to transfer web searchers that enter a particular query, the method comprising: classifying a landing page as one of a plurality of landing page classes with a trained classifier of a computer based on textual content of the landing page; determining, by the computer, characteristics of one or more query to be associated with the landing page; and choosing, with the computer, whether to retain or to change classification of the landing page to be associated with the one or more query based on relative average conversion rates of advertisements on a plurality of manually-classified landing pages when associated with the characteristics of the one or more query. | 06-24-2010 |
20100205213 | NON-EXACT CACHE MATCHING - The subject matter disclosed herein relates to returning cached object results based at least in part on a non-exact comparison with a query key. | 08-12-2010 |
20100217648 | METHOD AND SYSTEM FOR QUANTIFYING USER INTERACTIONS WITH WEB ADVERTISEMENTS - Methods and systems are provided that may be used to determine a probability of whether a visitor to a web document is likely to click on a web advertisement. An exemplary method may include detecting one or more features in a web document. One or more expert statistical models to which the web document belongs may be determined and associated weightings may be determined based, at least in part, on the one or more features detected. A click-through-rate probability for a web advertisement to be placed on the web document may be estimated based on the one or more expert statistical models. | 08-26-2010 |
20100293184 | IDENTIFICATION OF RELATED BID PHRASES AND CATEGORIES USING CO-BIDDING INFORMATION - The present invention provides a method and system for determining related bid terms. The method and system includes accessing a term database to determine a plurality of term pairs, the term pairs being paired terms bidded together in a term bidding operating environment. In the method and system, for each of the plurality of term pairs, the method and system includes determining similarity values for each of the term pairs. The method and system further includes generating a similarity matrix using the determined similarity values. And, the method and system includes generating an output result based on a co-bidded relationship between at least one of the terms and advertising information. | 11-18-2010 |
20110093331 | Term Weighting for Contextual Advertising - A contextual advertising system selects online advertisements for display on a network location. The system may transform page content of a page received in a platform over a network into a textual representation. In addition, the system may transform received site content of a site into a site signature. The site includes the page. The system then may correct the textual representation utilizing the site signature to produce modified textual representation. The system may utilize the modified textual representation to select an online advertisement. Considering a page in the context of the entire website to which it belongs leads to better understanding and interpretation of the page topic(s) and thus yields more accurate ad matching. | 04-21-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 |
20120036122 | CONTEXTUAL INDEXING OF SEARCH RESULTS - Briefly, embodiments of a method or a system of contextual indexing of search results is disclosed. | 02-09-2012 |
20120047014 | METHOD AND SYSTEM FOR USING EMAIL RECEIPTS FOR TARGETED ADVERTISING - Techniques for performing user classification based on email are provided. Emails stored in an email store may be analyzed to classify users. Information included in the stored emails may be extracted, and users may be classified into categories according to the extracted information. The extracted information may be analyzed in a manner so as to protect the personal information of the users according to any applicable privacy standards. Any number of types of emails may be analyzed to classify users in any number of ways. For instance, a plurality of commercial emails stored in the email store may be determined The commercial emails may be counted as conversions for an advertising campaign. The commercial emails may be parsed to extract commercial information. The commercial information may be parsed to generate user classification data. The user classification data may be used in various ways, including for targeting users with advertisements. | 02-23-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 |
20120166291 | BID GENERATION FOR SPONSORED SEARCH - A system and method of generating bid values for sponsored search includes steps or acts of: receiving a bid phrase for an advertisement for an item, wherein the bid phrase specifies a search query for which the advertisement should be displayed; receiving first information at a first input/output interface, the first information related to a bidding behavior of the advertiser; receiving second information at a second input/output interface, the second information relating to a history of bids by other advertisers for the bid phrase; and generating a bid value for the bid phrase submitted for the advertisement for the search query, based on the information received. | 06-28-2012 |
20120166453 | SYSTEM AND METHOD FOR SOCIAL FILTERING OF COMMENTS - A request is received, over a network from a requesting user to sort a plurality of comments relating to online content by a social status of a respective one of a plurality of commenters associated with each of the plurality of comments. The social status of the each of the plurality of commenters is determined using a computing device. The plurality of comments are sorted, using the computing device, by the social status of the respective one of the plurality of commenters associated with each of the plurality of comments. A representation of the sorted comments is transmitted, over the network, to the requesting user. The social status of commenters can reflect, in various embodiments, the status of commenters as favorite commenters of the requesting user, as members of the requesting user's social network, or as a top rated commenters in an online community. | 06-28-2012 |
20120173520 | SYSTEM AND METHOD FOR PROVIDING CONTEXTUAL ACTIONS ON A SEARCH RESULTS PAGE - The present invention provides a method and system for providing targeted applications within a search engine results page. The method and system includes receiving a search query from a user and interpreting the search query. The method and system then first maps the interpreted query to one or more action templates, wherein mapping the interpreted query to one or more action templates comprises selecting one or more actions associated with the interpreted query. The method and system then maps the selected one or more actions associated with the interpreted query to a plurality of applications and selecting one or more applications associated with the one or more actions. Finally, the method and system displays the one or more applications within a search results page. | 07-05-2012 |
20120173533 | MINING GLOBAL EMAIL FOLDERS FOR IDENTIFYING AUTO-FOLDER TAGS - Embodiments are directed towards identifying auto-folder tags for messages by using a combinational optimization approach of bi-clustering folder names and features of messages based on relationship strengths. The combinational optimization approach of bi-clustering, generally, groups a plurality of folder names and a plurality of features into one or more metafolders to optimize a cost. The cost is based on an aggregate of cut relationship strengths, where a cut results when a relationship folder name and feature are grouped in separate metafolders. Furthermore, the plurality of folder names and the plurality of features are obtained by monitoring actions of a plurality of users, where the folder names are user generated folder names and features are from a plurality of messages. The metafolders may be used to tag new user messages with an auto-folder tag. | 07-05-2012 |
20130042311 | MULTI-STEP CAPTCHA WITH SERIAL TIME-CONSUMING DECRYPTION OF PUZZLES - A system and method for implementing a multi-step challenge and response test includes steps or acts of: using an input/output subsystem for presenting a series of challenges to a user that require said user to correctly solve each challenge before a next challenge is revealed to the user; receiving the user's response to each challenge; and submitting a last response in the series of challenges to a server for validation. The method further includes: using a processor device configured to perform for each challenge in the series of challenges: internally validating the response by comparing the user's response to a correct response; and using the user's response, decrypting the next challenge to reveal the next challenge; wherein the next challenge remains obfuscated until a previous challenge is correctly solved. | 02-14-2013 |