| Patent application number | Description | Published |
|---|
| 20110231399 | Clustering Method and System - The present disclosure discloses a method and system for clustering. The method includes: vectorizing a plurality of readable files to obtain a plurality of file vectors corresponding to the multiple readable files; extracting a total characteristic vector based on the file vectors; and clustering the readable files based on a ranking result of a respective similarity degree between the total characteristic vector and each of the file vectors. The present disclosure also provides a method and system for clustering webpages. An application of the methods or systems described in the present disclosure reduces the number of times of comparison of similarity degrees between file vectors, and further reduces the resulting burden on system resources. This advantageously results in reduced usage of CPU and memory, reduced run time of clustering and improved performance of clustering. | 09-22-2011 |
| 20120130804 | PREDICTION OF COST AND INCOME ESTIMATES ASSOCIATED WITH A BID RANKING MODEL - Prediction of cost and income estimates associated with a bid ranking model is disclosed, including: receiving a search keyword estimate prediction request, wherein the request comprises a search keyword, a bid price associated with the search keyword, and a prediction period; determining an average click through rate associated with the search keyword associated with the prediction period for a ranking position; determining a traffic value associated with the search keyword associated with the prediction period; determining an average cost per click associated with the search keyword associated with the prediction period for the ranking position; determining a number of impressions associated with the search keyword for the ranking position; and determining a cost estimate and an income estimate associated with the search keyword associated with the prediction period. | 05-24-2012 |
| 20120173344 | ESTIMATING BID PRICES FOR KEYWORDS - Estimating bid prices for keywords is disclosed, including: receiving a request to estimate a bid price associated with a target keyword for a bidder; determining whether the bidder has previously bid on the target keyword; in the event that the bidder has not previously bid on the target keyword, determining an estimated bid price based at least in part on a plurality of historical bid prices associated with the bidder corresponding to keywords other than the target keyword and a plurality of historical bid prices associated with other bidders corresponding to the target keyword; and in the event that the bidder has previously bid on the target keyword, determining the estimated bid price based at least on revising a current bid price associated with the request; and returning the estimated bid price associated with the target keyword. | 07-05-2012 |
| Patent application number | Description | Published |
|---|
| 20100325105 | Generating ranked search results using linear and nonlinear ranking models - Generating ranked search results includes receiving a plurality of matching information items that match a search request, ranking at least some of the plurality of matching information items using a linear ranking model that linearly combines a first plurality of feature values to obtain a first set of ranked results, ranking at least some of the first set of ranked results using a nonlinear ranking model that nonlinearly combines a second plurality of feature values to obtain a second set of ranked results, and provide a search response based on the second set of ranked results. | 12-23-2010 |
| 20110016111 | Ranking search results based on word weight - Ranking search results, comprises receiving a query string; retrieving a plurality of search results that include a corresponding plurality of target strings that relate to the query string; segmenting the query string and each of the plurality of target strings; pairing segments in the query string with respective segments in the target strings to form a plurality of combinations; retrieving a plurality of weights that correspond to the plurality of combinations based on a mapping of word combinations and their respective weights, wherein a weight measures semantic correlation between words in a word combination; and determining a weighted word length based on the weights corresponding to each of the plurality of target strings; and ranking the plurality of target strings based on their respective weighted word lengths. Alternatively, ranking search results includes determining a minimum weight of each inserted word with respect to segmented words in the query string; determining a minimum weight of each deleted word with respect to segmented words in the target strings; determining a total edit distance based at least in part on the minimum weight of each inserted word and the minimum weight of each deleted word; and ranking the target strings based on the total edit distances. | 01-20-2011 |
| 20110047138 | Method and Apparatus for Identifying Synonyms and Using Synonyms to Search - A method and an apparatus for identifying synonym and utilizing such synonym to conduct search is disclosed. The disclosed method includes: obtaining arbitrary two words to be identified; determining whether a shortest edit distance between the two words less than or equal to an edit distance threshold; determining whether the two words to be identified exist in a preset knowledge database, and if an answer is yes then searching a smallest granularity type with highest weight value for each word in the knowledge database; and if the two word have the same smallest granularity type with highest weight value, then determining such two words are synonyms, or non-synonym otherwise. The disclosed techniques greatly improve accuracy of synonym identification and guarantee effect of synonym identification. | 02-24-2011 |
| 20110082860 | Search Method, Apparatus and System - The present disclosure describes a search method, a search apparatus and a search system. The method includes: a data rewriting system that obtains, from a database, one or more search term candidates that are relevant to a present search term. The data rewriting system retrieves properties of the present search term and the one or more search term candidates, where the properties describe respective matching results of the present search term and the one or more search term candidates. Based on the matching results, the data rewriting system determines whether or not the present search term needs to be rewritten, and rewrites the present search term based on the matching results to provide a rewritten present search term if it is determined that the present search term needs to be rewritten. A search engine performs a search based on the rewritten present search term. The disclosed method, apparatus and system avoid the approach of conducting a search based on fixed rules after the present search term is rewritten, thus reducing the probability of having ambiguity in the search process and improving the degree of search accuracy. | 04-07-2011 |
| 20110218852 | Matching of advertising sources and keyword sets in online commerce platforms - Providing online advertisements includes selecting, among a plurality of advertising sources provided by a seller, a selected plurality of advertising sources that meet a predefined condition; generating a plurality of keyword sets that correspond to the selected plurality of advertising sources; establishing a programming model according to a set of predefined constraints, wherein the programming model represents match of the selected plurality of advertising sources and the plurality of keyword sets; and determining a substantially optimal match between at least some of the plurality of advertising sources and the plurality of keyword sets by solving the programming model. | 09-08-2011 |
| 20120047148 | Method for Generating Search Result and System for Information Search - The present disclosure discloses a method for generating a search result and an information search system. The method for generating a search result includes: receiving, by an information search system, a search request; obtaining, by searching, a plurality of pieces of matching information that match the search request; obtaining a respective amount of user response associated with each of the plurality of pieces of matching information and further obtaining a total amount of user response associated with a respective categories to which each of the plurality of pieces of matching information belongs; and ranking the plurality of pieces of information to generate a search result based on the total amount of user response associated with the respective category to which each of the plurality of pieces of matching information belongs. By using the above technical scheme, a result of more rational ranking of matching information can be displayed to a user when the user performs a search, thus improving experience of the user. | 02-23-2012 |
| 20120130804 | PREDICTION OF COST AND INCOME ESTIMATES ASSOCIATED WITH A BID RANKING MODEL - Prediction of cost and income estimates associated with a bid ranking model is disclosed, including: receiving a search keyword estimate prediction request, wherein the request comprises a search keyword, a bid price associated with the search keyword, and a prediction period; determining an average click through rate associated with the search keyword associated with the prediction period for a ranking position; determining a traffic value associated with the search keyword associated with the prediction period; determining an average cost per click associated with the search keyword associated with the prediction period for the ranking position; determining a number of impressions associated with the search keyword for the ranking position; and determining a cost estimate and an income estimate associated with the search keyword associated with the prediction period. | 05-24-2012 |
