Patent application number | Description | Published |
20110184802 | AUCTION FORMAT SELECTION USING HISTORICAL DATA - An auction format may be selected pursuant to analyzing and identifying certain statistical patterns in historical data. For example, the choice of auction format may be based on whether bids and quality exhibit correlation, which can be identified in the historical data. By identifying the statistical patterns in the data, one can choose an auction format that can achieve generation of higher revenue. Such techniques allow an auctioneer, such as a search engine, to generate higher revenue than using a fixed auction format. For example, in the context of sponsored search auction, if the value of a click and the probability of a click are positively correlated, the auctioneer generates higher revenue by ranking the advertisers by bids rather than by bids multiplied by quality. | 07-28-2011 |
20110307517 | RELAXATION FOR STRUCTURED QUERIES - A structured query may specify attribute values for attributes. An estimate of the number of items that will match the structured query if it is applied to a structured database is determined. If the estimated number of items is below a threshold, the structured query may be relaxed to form new candidate structured queries. The number of candidate queries may be determined based on a desired running time. Each of the candidate structured queries may be determined by changing one or more attribute values of the attributes of the structured query. Estimates of the number of items each of the candidate structured queries will match is determined, and the candidate structured query that has the highest matching estimation is used to query the database. The matching results may be output. | 12-15-2011 |
20120226661 | INDEXING FOR LIMITED SEARCH SERVER AVAILABILITY - Documents are replicated among servers comprising a search engine based on the value of each document by approximating its value as one of the top search results for one or more exemplary queries. Documents are allocated among servers comprising a search engine by calculating a relevance value for each document and then distributing the documents evenly to the servers. A subset of servers are selected from among a plurality of servers comprising a search engine using term-based, server-specific histograms reflecting the number of instances of the term in each document allocated to each server, and then selecting servers to service a query based on the documents on those servers. | 09-06-2012 |
20120271806 | GENERATING DOMAIN-BASED TRAINING DATA FOR TAIL QUERIES - Training data is provided for tail queries based on a phenomena in search engine user behavior—referred to herein as “domain trust”—as an indication of user preferences for individual URLs in search results returned by a search engine for tail queries. Also disclosed are methods for generating training data in a search engine by forming a collection of query+URL pairs, identifying domains in the collection, and labeling each domain. Other implementations are directed ranking search results generated by a search engine by measuring domain trust for each domain corresponding to each URL from among a plurality of URLs and then ranking each URL by its measured domain trust. | 10-25-2012 |
20130159291 | RANKING SEARCH RESULTS USING WEIGHTED TOPOLOGIES - Identifiers of items generated in response to a query are each ranked in a way that considers the other identified items. Topologies are generated that correspond to features of the identified items. Each topology may be a Markov chain that includes a node for each identified item and directed edges between the nodes. Each directed edge between a node pair has an associated transition probability that represents the likelihood that a hypothetical user would change their preference from a first node in the pair to the second node in the pair when considering the feature associated with the topology. The topologies are weighted according to the relative importance of the features that correspond to the topologies. The weighted topologies are used to generate a stationary distribution of the identified items, and the identified items are ranked using the stationary distribution. | 06-20-2013 |
20140258303 | REFORMULATING QUERY TERMS IN STRUCTURED SEARCH - Search history data such as browse trails are collected over time. The browse trails, including associated queries and domains, are processed to identify free tokens of the queries that are also modifiers. Attribute value pairs of a structured data source that correspond to the modifiers are determined based on the search history data and a frequency of the attribute value pairs in the structured data source. When a subsequent query is received, modifiers in the query are identified and replaced with the determined combinations of attribute value pairs that correspond to the modifiers in a structured query that is generated from the received query. The structured query is used to identify items and/or services in the structured data source that are responsive to the received query. | 09-11-2014 |
20150154507 | CLASSIFICATION SYSTEM - Multi-class classification by training a machine learning system based on training inputs each of which includes features and at least one class label. Each training input is assigned a membership value that can indicate if an entity having the features of the training input is a member of the class corresponding to the class label that is also included in the training input. To determine if an entity having test features is a member of several test classes, test inputs can be constructed where each input includes the test features and a class label corresponding to one of the test classes. The test inputs are processed by the trained machine learning system, which produces as outputs test membership values that represent the likelihood that the entity having the features in the test input belong to the test class corresponding to the test class label also included in the test input. | 06-04-2015 |
Patent application number | Description | Published |
20100153388 | METHODS AND APPARATUS FOR RESULT DIVERSIFICATION - Methods, apparatus, and systems directed to receiving search queries, retrieving documents, computing the number of categories to present for a given query, computing the number of results to show in each category, computing an ordering of categories, and for all the result pages beyond the first page employing user interface elements that optionally allow the user to quickly zoom in on a specific category and get more results belonging to that category. | 06-17-2010 |
20100250333 | OPTIMIZING CASHBACK RATES - A method, system, and medium are provided for determining optimal sales rebate rates. Historical data, including sales data, price data, and rebate data are received, along with ongoing current data from current rebate transactions. Changes across the spectrum of data are determined and calculations are used to obtain an optimal sales rebate rate for one of more products or services utilizing statistical models, including but not limited to, a linear rebate rate model and a logarithmic-linear rebate rate model for one or more products or services. A mathematical analysis determines the appropriate model to use to obtain the optimal sales rebate rate. The optimal sales rebate rate may be applied to computing or non-computing environments, in whole or as a combination of both computing and non-computing environments. | 09-30-2010 |
20100287060 | PROVIDING TIME-SENSITIVE INFORMATION FOR PURCHASE DETERMINATIONS - A method, system, and medium are provided that are directed to providing a user with time-sensitive information that is usable to determine when to purchase a product. In accordance with embodiments of the technology, exemplary steps include using historical product information to generate time-sensitive information. Moreover, in response to receiving from a user a request to receive information describing a given product, time-sensitive information is caused to be presented. For example, time-sensitive information might be usable by the user to determine when to purchase the given product and an alternative product. | 11-11-2010 |
20120059739 | PROVIDING TIME-SENSITIVE INFORMATION FOR PURCHASE DETERMINATIONS - A method, system, and medium are provided that are directed to providing a user with time-sensitive information that is usable to determine when to purchase a product. In accordance with embodiments of the technology, exemplary steps include using historical product information to generate time-sensitive information. Moreover, in response to receiving from a user a request to receive information describing a given product, time-sensitive information is caused to be presented. For example, time-sensitive information might be usable by the user to determine when to purchase the given product and an alternative product. | 03-08-2012 |
20120066094 | PROVIDING TIME-SENSITIVE INFORMATION FOR PURCHASE DETERMINATIONS - A method, system, and medium are provided that are directed to providing a user with time-sensitive information that is usable to determine when to purchase a product. In accordance with embodiments of the technology, exemplary steps include using historical product information to generate time-sensitive information. Moreover, in response to receiving from a user a request to receive information describing a given product, time-sensitive information is caused to be presented. For example, time-sensitive information might be usable by the user to determine when to purchase the given product and an alternative product. | 03-15-2012 |
20120089588 | SEARCH RESULT DIVERSIFICATION - Methods, apparatus, and systems directed to receiving search queries, retrieving documents, computing the number of categories to present for a given query, computing the number of results to show in each category, computing an ordering of categories, and for all the result pages beyond the first page employing user interface elements that optionally allow the user to quickly zoom in on a specific category and get more results belonging to that category. | 04-12-2012 |