Abstract: Structured data sets including one or more attributes are identified, each structured data set associated with, for example, a particular user. Values corresponding the at least one of the one or more attributes in each structured data set are identified. A condition established by a content provider, for instance, an advertiser, is compared to the identified values to determine if the condition is satisfied. When the condition is satisfied, one or more content items are identified to the users associated with the structured data sets containing identified values satisfying the condition.

Abstract: Open profile data in a user profile, e.g., free-form fields in a user profile, are processed to identify interests and preferences of the user. The interests and preferences are utilized to identify categories associated with the user profile, and content items, e.g., advertisements, can be identified based on the categories.

Abstract: Advertiser repository information (e.g., a list of HTML pages) may be used to automatically generate a page-ad and associated ad information for each page using a subset of features of the page. Subsequently, a page-ad index for all pages from different advertisers may be created. After creating a page-ad index, if a client issues a query (e.g., from a search engine), candidate page-ads may be selected using the page-ads index. If necessary (e.g., if there are more candidate page-ads than requested ads), the candidate page-ads may be entered into an arbitration (e.g., auction). Then, the arbitration may determine a set of one or more winning page-ads to be served for rendering.

Abstract: A custodian profile, e.g., a user profile, associated with a first content item, e.g., an associated web page in a social network, can be identified as a first content item. The first content item can be utilized to identify one or more second content items, e.g., advertisements, that are displayed when the first content item is presented, e.g., viewed by another user of the social network.

Abstract: Methods and apparatus, including systems and computer program products, to provide clustering of users in which users are each represented as a set of elements representing items, e.g., items selected by users using a system. In one aspect, a program operates to obtain a respective interest set for each of multiple users, each interest set representing items in which the respective user expressed interest; for each of the users, to determine k hash values of the respective interest set, wherein the i-th hash value is a minimum value under a corresponding i-th hash function; and to assign each of the multiple users to each of the respective k clusters established for the respective user, the i-th cluster being represented by the i-th hash value. The assignment of each of the users to k clusters is done without regard to the assignment of any of the other users to k clusters.

Abstract: A system and method for transferring annotations associated with a media file. An annotation associated with a media file is indexed to a first instance of that media file. By comparing features of the two instances, a mapping is created between the first instance of the media file and a second instance of the media file. The annotation can be indexed to the second instance using the mapping between the first and second instances. The annotation can be processed (displayed, stored, or modified) based on the index to the second instance.

Abstract: Click logs and query logs are processed to identify statistical search patterns. A search session is compared to the statistical search patterns. Content items responsive to a query of the search session are identified, and a ranking of the content items is adjusted based on the comparison.

Abstract: Methods and apparatus, including systems and computer program products, to provide clustering of users in which users are each represented as a set of elements representing items, e.g., items selected by users using a system. In one aspect, a program operates to obtain a respective interest set for each of multiple users, each interest set representing items in which the respective user expressed interest; for each of the users, to determine k hash values of the respective interest set, wherein the i-th hash value is a minimum value under a corresponding i-th hash function; and to assign each of the multiple users to each of the respective k clusters established for the respective user, the i-th cluster being represented by the i-th hash value. The assignment of each of the users to k clusters is done without regard to the assignment of any of the other users to k clusters.

Abstract: A first content entity and one or more associated second content entities are presented to one or more arbiters. Arbiter determinations relating to the association of at least one of the second content entities with the first content entity are received. A determination as to whether the at least one of the second content entities is to be disassociated from the first content entity based on the arbiter determinations can be made.

Abstract: A system and method for transferring annotations associated with a media file. An annotation associated with a media file is indexed to a first instance of that media file. By comparing features of the two instances, a mapping is created between the first instance of the media file and a second instance of the media file. The annotation can be indexed to the second instance using the mapping between the first and second instances. The annotation can be processed (displayed, stored, or modified) based on the index to the second instance.

Abstract: Systems, methods, and apparatus, including computer program products, for collaborative filtering are provided. A method is provided. The method includes clustering a plurality of entities with respect to one or more latent variables in a probability distribution model of a relationship between a set of entities and a set of items, the probability distribution model comprising a probability distribution of the set of items with respect to the latent variables. The method also includes, as new items are added to the set of items, updating the probability distribution of the set of the items with respect to the latent variables, and generating an updated relationship score for an entity with respect to the set of items based on the entity's fractional membership in the clustering with respect to the latent variables and based on the updated probability distribution of the set of the items with respect to the latent variables.

Abstract: Methods, systems and apparatus, including computer program products, for providing a diversity of recommendations. According to one method, results are identified so as to increase the likelihood that at least one result will be of interest to a user. Following the identification of a first result, second and later results are identified based on an assumption that the previously identified results are not of interest to the user. The identification of diverse results can be based on formulas that approximate the probability or provide a likelihood score of a user selecting a given result, where a measured similarity between a given object and previously identified results tends to decrease the calculated probability approximation or likelihood score for that object.

Abstract: Systems and techniques for converting numeric queries into substantially equivalent textual queries are described. In general, the systems and techniques discussed use search query logs to accurately select a most probably mapping for a numeric-to-text conversion. This mapping can occur when a system (e.g., a server-side search system) receives a series of numeric inputs (e.g., from a cell phone keypad) that may correspond to more than one word. For example, a search server may receive input 22737, which corresponds to both the words ACRES and CASES, as part of a query. The server uses current entries in query logs to create mappings for words from the numeric input. If recent queries indicate that the term ACRES is currently more popular than the term CASES, the mapping may match the entry 22737 to the text ACRES.

Abstract: Systems and techniques for converting numeric queries into substantially equivalent textual queries are described. In general, the systems and techniques discussed use search query logs to accurately select a most probably mapping for a numeric-to-text conversion. This mapping can occur when a system (e.g., a server-side search system) receives a series of numeric inputs (e.g., from a cell phone keypad) that may correspond to more than one word. For example, a search server may receive input 22737, which corresponds to both the words ACRES and CASES, as part of a query. The server uses current entries in query logs to create mappings for words from the numeric input. If recent queries indicate that the term ACRES is currently more popular than the term CASES, the mapping may match the entry 22737 to the text ACRES.

Abstract: Methods and apparatus, including systems and computer program products, to provide clustering of users in which users are each represented as a set of elements representing items, e.g., items selected by users using a system. In one aspect, a program operates to obtain a respective interest set for each of multiple users, each interest set representing items in which the respective user expressed interest; for each of the users, to determine k hash values of the respective interest set, wherein the i-th hash value is a minimum value under a corresponding i-th hash function; and to assign each of the multiple users to each of the respective k clusters established for the respective user, the i-th cluster being represented by the i-th hash value. The assignment of each of the users to k clusters is done without regard to the assignment of any of the other users to k clusters.

Abstract: The present disclosure includes a system and method for embedding advertisements associated with names. In some implementations, a method includes receiving a request for an advertisement to embed in a Web page identifying one or more search results. The search results are based, at least in part, on a name of an individual. One or more advertisements associated with the name of the individual are identified.

Abstract: Open profile data in a user profile, e.g., free-form fields in a user profile, are processed to identify interests and preferences of the user. The interests and preferences are utilized to identify categories associated with the user profile, and content items, e.g., advertisements, can be identified based on the categories.

Abstract: Methods and apparatus, including systems and computer program products, to provide clustering of users in which users are each represented as a set of elements representing items, e.g., items selected by users using a system. In one aspect, a program operates to obtain a respective interest set for each of multiple users, each interest set representing items in which the respective user expressed interest; for each of the users, to determine k hash values of the respective interest set, wherein the i-th hash value is a minimum value under a corresponding i-th hash function; and to assign each of the multiple users to each of the respective k clusters established for the respective user, the i-th cluster being represented by the i-th hash value. The assignment of each of the users to k clusters is done without regard to the assignment of any of the other users to k clusters.

Abstract: Open profile data in a user profile, e.g., free-form fields in a user profile, are processed to identify interests and preferences of the user. The interests and preferences are utilized to identify categories associated with the user profile, and content items, e.g., advertisements, can be identified based on the categories.

Abstract: Click logs and query logs are processed to identify statistical search patterns. A search session is compared to the statistical search patterns. Content items responsive to a query of the search session are identified, and a ranking of the content items is adjusted based on the comparison.