Patent application number | Description | Published |
20090119289 | Method and System for Autocompletion Using Ranked Results - A set of ordered predicted completion strings are presented to a user as the user enters text in a text entry box (e.g., a browser or a toolbar). The predicted completion strings can be in the form of URLs or query strings. The ordering may be based on any number of factors (e.g., a query's frequency of submission from a community of users). URLs can be ranked based on an importance value of the URL. Privacy is taken into account in a number of ways, such as using a previously submitted query only when more than a certain number of unique requesters have made the query. The sets of ordered predicted completion strings is obtained by matching a fingerprint value of the user's entry string to a fingerprint to table map which contains the set of ordered predicted completion strings. | 05-07-2009 |
20090282081 | Method for Detecting Link Spam in Hyperlinked Databases - Methods for facilitating the identification of link spamming in a linked database include calculating a spam likelihood value for nodes in a directed graph of linked nodes are disclosed. The spam likelihood value is computed from an importance of the node and a derivative value of the importance function with respect to a coupling factor. The likelihood that the node's importance is inflated by link spam is estimated by calculating the ratio of the magnitude of the derivative value for the node to the rank for the node. Alternatively, the spam likelihood may be computed directly from a component of the principal eigenvector of A evaluated at two values of the parameter c. The normalized derivative value can also be used to provide an order of importance in a list of nodes. | 11-12-2009 |
20110047120 | Anticipated Query Generation and Processing in a Search Engine - A search system monitors the input of a search query by a user. Before the user finishes entering the search query, the search system identifies and sends a portion of the query as a partial query to the search engine. Based on the partial query, the search engine creates a set of predicted queries. This process may take into account prior queries submitted by a community of users, and may take into account a user profile. The predicted queries are be sent back to the user for possible selection. The search system may also cache search results corresponding to one or more of the predicted queries in anticipation of the user selecting one of the predicted queries. The search engine may also return at least a portion of the search results corresponding to one or more of the predicted queries. | 02-24-2011 |
20110258183 | Autocompletion of Partial Search Query with Return of Predicted Search Results - A set of ordered predicted completion strings are presented to a user as the user enters text in a text entry box (e.g., a browser or a toolbar). The predicted completion strings can be in the form of URLs or query strings. The ordering may be based on any number of factors (e.g., a query's frequency of submission from a community of users). URLs can be ranked based on an importance value of the URL. Privacy is taken into account in a number of ways, such as using a previously submitted query only when more than a certain number of unique requestors have made the query. The sets of ordered predicted completion strings is obtained by matching a fingerprint value of the user's entry string to a fingerprint to table map which contains the set of ordered predicted completion strings. | 10-20-2011 |
20110270890 | Method for Detecting Link Spam in Hyperlinked Databases - A computer-implemented method identifies nodes that are beneficiaries of node importance inflating links in a directed graph of linked nodes. The directed graph of linked nodes corresponds to a linked database, and the nodes correspond to documents within the linked database. The method is performed by a computer system including one or more processors and memory storing one or more programs, the one or more processors executing the one or more programs to perform the method. The method includes computing, for each of at least a subset of the nodes in the directed graph, a respective quantity corresponding to a mathematical derivative of a node importance function, and performing a remedial action on a respective node in the directed graph in accordance with the respective computed quantity computed for the respective node. | 11-03-2011 |
Patent application number | Description | Published |
20090157491 | Monetization of Online Content - Methods, computer program products and systems are described for computer implemented online-content management. Multiple online content items authored by multiple authors for online publication are received at one or more first computers. For each online content item, a reputation score is determined for the author corresponding to the online content item. The reputation score is based at least in part on one or more reviews of the online content item provided by one or more reviewers other than the author. An online content item from the multiple online content items is published for display on one or more second computers, which includes displaying an advertisement in conjunction with displaying the online content item. A share of revenue for the author of the online content item for displaying the advertisement is determined based at least in part on the reputation score of the author. | 06-18-2009 |
20090157667 | Reputation of an Author of Online Content - Methods, computer program products and systems are described for online-content management. Multiple online content items authored by multiple authors are received at one or more first computers for online publication. For each online content item, a reputation score is determined for the author of the online content item. The reputation score is based at least in part on one or more reviews of the online content item provided by one or more reviewers other than the author. In response to a query for online content received from a second computer, a set of search results is generated that includes an online content item from the multiple online content items. A ranking of the online content item in the set is determined based at least in part on the reputation score of the author. | 06-18-2009 |
20100169297 | Variable Personalization of Search Results in a Search Engine - A search engine provides personalized rankings of search results. A user interest profile identifies topics of interest to a user. Each topic is associated with one or more sites, and a boost value, which can be used to augment an information retrieval score of any document from the site. Search results from any search are provided to the user, with a variable control of the ranking of the results. The results can be ranked by their unboosted information retrieval score, thus reflecting no personalization, or by their fully or partially boosted information retrieval scores. This allows the user to selectively control how their interests affect the ranking of the documents. | 07-01-2010 |
20100293057 | Targeted advertisements based on user profiles and page profile - Targeted advertisements are provided to an advertisement consumer based on a user profile, a page profile, or a combination thereof. In embodiment where a user of a search engine is an advertisement consumer, the user utilizes a search engine to obtain search results relevant to a search query. A user profile of the user's interests is used to select advertisements for inclusion with search results. The user profile is evaluated by an advertisement server which determines which advertiser(s) offers a highest price for the user profile. Advertisements from these advertisers are then selected. In another embodiment, where the user is accessing a page on a third party website, the page may include a request for advertisements. A page profile is evaluated by an advertisement server that determines which advertiser(s) offers a highest price for the page profile. Advertisements from these advertisers are then selected, and provided to the user, where they are included in the retrieved page. | 11-18-2010 |
20120089598 | Generating Website Profiles Based on Queries from Websites and User Activities on the Search Results - In a method of profiling a website, an information server receives multiple search queries from a website submitted by different users. Different search results responsive to the search queries are provided to the requesting users. The information server monitors activities of the users on the search results and generates a profile for the website using the search queries and the user activities. When the information server receives a same search query from two different websites, it identifies a plurality of information items associated with the search query. The information server uses profiles of the two websites to customize the information items into two different orders and serves the information items to the two websites in the two different orders. | 04-12-2012 |
20120221568 | Variable Personalization of Search Results in a Search Engine - A search engine provides personalized rankings of search results. A user interest profile identifies topics of interest to a user. Each topic is associated with one or more sites, and a boost value, which can be used to augment an information retrieval score of any document from the site. Search results from any search are provided to the user, with a variable control of the ranking of the results. The results can be ranked by their unboosted information retrieval score, thus reflecting no personalization, or by their fully or partially boosted information retrieval scores. This allows the user to selectively control how their interests affect the ranking of the documents. | 08-30-2012 |
20130103683 | Variable Personalization of Search Results in a Search Engine - A search engine provides personalized rankings of search results. A user interest profile identifies topics of interest to a user. Each topic is associated with one or more sites, and a boost value, which can be used to augment an information retrieval score of any document from the site. Search results from any search are provided to the user, with a variable control of the ranking of the results. The results can be ranked by their unboosted information retrieval score, thus reflecting no personalization, or by their fully or partially boosted information retrieval scores. This allows the user to selectively control how their interests affect the ranking of the documents. | 04-25-2013 |
20140129542 | System and Method for Personalized Snippet Generation - A method of producing search results is disclosed. The method comprises, at a computerized search engine system distinct from a client system: receiving a search request associated with a user from the client system, the search request having one or more search terms; obtaining a user profile corresponding to the user, where the user profile is generated based in part on the user's prior computing activities, comprising one or more of browsing, searching, and messaging; obtaining search results for the search request; generating a personalized snippet for at least one of the search results in accordance with the obtained user profile, the snippet comprising a text portion of the search result chosen based on at least one or more search terms and one or more terms of the obtained user profile; and transmitting the search results and personalized snippet to the client system for display. | 05-08-2014 |