Patent application number | Description | Published |
20090043597 | System and method for matching objects using a cluster-dependent multi-armed bandit - An improved system and method for matching objects using a cluster-dependent multi-armed bandit is provided. The matching may be performed by using a multi-armed bandit where the arms of the bandit may be dependent. In an embodiment, a set of objects segmented into a plurality of clusters of dependent objects may be received, and then a two step policy may be employed by a multi-armed bandit by first running over clusters of arms to select a cluster, and then secondly picking a particular arm inside the selected cluster. The multi-armed bandit may exploit dependencies among the arms to efficiently support exploration of a large number of arms. Various embodiments may include policies for discounted rewards and policies for undiscounted reward. These policies may consider each cluster in isolation during processing, and consequently may dramatically reduce the size of a large state space for finding a solution. | 02-12-2009 |
20090164425 | System and method for crawl ordering by search impact - An improved system and method for crawl ordering of a web crawler by impact upon search results of a search engine is provided. Content-independent features of uncrawled web pages may be obtained, and the impact of uncrawled web pages may be estimated for queries of a workload using the content-independent features. The impact of uncrawled web pages may be estimated for queries by computing an expected impact score for uncrawled web pages that match needy queries. Query sketches may be created for a subset of the queries by computing an expected impact score for crawled web pages and uncrawled web pages matching the queries. Web pages may then be selected to fetch using a combined query-based estimate and query-independent estimate of the impact of fetching the web pages on search query results. | 06-25-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 |
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 |
20110054999 | SYSTEM AND METHOD FOR PREDICTING USER NAVIGATION WITHIN SPONSORED SEARCH ADVERTISEMENTS - An improved system and method for predicting user navigation within sponsored search advertisements is provided. A list of sponsored advertisements for display on a web page of search results may be received. A click prediction classifier may be applied to predict a click probability of each sponsored advertisement and a dwell time prediction classifier may be applied to predict a dwell time probability on web pages of a website of each sponsored advertisement. A probability of user navigation may be predicted for each sponsored advertisement using a probability of a click on each sponsored advertisement and a probability of a dwell time on web pages of a website of each sponsored advertisement. The list of the sponsored advertisements may be ranked in part by the probability of user navigation and served to a web browser executing on a client device for display on a web page of search results. | 03-03-2011 |
20110218991 | SYSTEM AND METHOD FOR AUTOMATIC DETECTION OF NEEDY QUERIES - The present invention relates to methods, systems, and computer readable media comprising instructions for identifying needy queries for which additional responsive content is needed. The method of the present invention comprises receiving a query comprising one or more terms and retrieving one or more content items identified as responsive to the query, the one or more content items ranked according to one or more ranking techniques. A score is generated for the one or more ranked content items identified as responsive to the query. A determination is thereafter made as to whether the query is needy based upon a comparison of the one or more scores associated with the one or more content items identified as responsive to the query and a needy query score threshold. | 09-08-2011 |
20110258054 | Automatic Generation of Bid Phrases for Online Advertising - Automatic generation of bid phrases for online advertising comprising storing a computer code representation of a landing page for use with a language model and a translation model (with a parallel corpus) to produce a set of candidate bid phrases that probabilistically correspond to the landing page, and/or to web search phrases. Operations include extracting a set of raw candidate bid phrases from a landing page, generating a set of translated candidate bid phrases using a parallel corpus in conjunction with the raw candidate bid phrases. In order to score and/or reduce the number of candidate bid phrases, a translation table is used to capture the probability that a bid phrase from the raw bid phrases is generated from a bid phrase from the set of translated candidate bid phrases. Scoring and ranking operations reduce the translated candidate bid phrases to just those most relevant to the landing page inputs. | 10-20-2011 |