Abstract: Method, system, and programs for hybrid information query. A request is first received from a user associated with a hybrid query. The hybrid query is expressed in accordance with an input in terms of one of a user, a feature, and a document, and a desired hybrid query result in terms of one of a user, a feature, and a document. A mapping is then determined between the input and the desired hybrid query result. A hybrid model is established based on hybrid information collected and associated with one or more users. The mapping is performed based on the hybrid model to obtain the desired hybrid query result based on the input. Eventually, the desired hybrid query result is provided as a response to the hybrid query.

Abstract: In one embodiment, access a set of recency ranking data comprising one or more recency search queries and one or more recency search results, each of the recency search queries being recency-sensitive with respect to a particular time period and being associated with a query timestamp representing the time at which the recency search query is received at a search engine, each of the recency search results being generated by the search engine for one of the recency search queries and comprising one or more recency network resources. Construct a plurality of recency features from the set of recency ranking data. Train a first ranking model via machine learning using at least the recency features.

Abstract: An information retrieval system is described herein that monitors a microblog data stream that includes microblog posts to discover and index fresh resources for searching by a search engine. The information retrieval system also uses data from the microblog data stream as well as data obtained from a microblog subscription system to compute novel and effective features for ranking fresh resources which would otherwise have impoverished representations. An embodiment of the present invention advantageously enables a search engine to produce a fresher set of resources and to rank such resources for both relevancy and freshness in a more accurate manner.

Abstract: Methods, systems, and computer programs are presented for providing internet content, such as related news articles. One method includes an operation for defining a plurality of candidates based on a seed. For each candidate, scores are calculated for relevance, novelty, connection clarity, and transition smoothness. The score for connection clarity is based on a relevance score of the intersection between the words in the seed and the words in each of the candidates. Further, the score for transition smoothness measures the interest in reading each candidate when transitioning from the seed to the candidate. For each candidate, a relatedness score is calculated based on the calculated scores for relevance, novelty, connection clarity, and transition smoothness. In addition, at least one of the candidates is selected based on their relatedness scores for presentation to the user.

Abstract: The system and method of the present invention allows for the determination of the relevance of a content item to a query through the use of a machine learned relevance function that incorporate query differentiation. A method for selecting a relevance function to determine a relevance of a query-content item pair comprises generating a training set comprising one or more content item-query pairs. Content item-query pairs in the training set are collectively used to determine the relevance function by minimizing a loss function according to a relevance score adjustment function that accounts for query differentiation. The monotocity of relevance score adjustment function allows the trained relevance function to be directly applied to new queries.

Abstract: A server determines a plurality of immediate candidate items for a first web page to recommend to a user. For each particular immediate candidate item of the plurality of immediate candidate items, the server determines a separate sequence of two or more subsequent possible candidate items for subsequent web pages to recommend to the user in the event that the user selects the particular immediate candidate item. Further, the server selects a particular immediate candidate item from the plurality of immediate candidate items for the first web page to recommend to the user. The first web page that recommends the plurality of immediate candidate items is generated and sent over the Internet to the user.

Abstract: Performing an on-line recommendation includes: analyzing real-time data from various sources; determining, from the analysis, events in which a user may be interested; extracting the determined events; storing the extracted events in a data store; and performing a recommendation function. The recommendation function includes: ranking the extracted events to determine the events in which the user is most likely to be interested; and performing location-based filtering, retaining those extracted events that are within a geo-location range proximate to the user, thus generating optimal events.

Abstract: Embodiments are directed towards generating market-specific ranking models by leveraging target market specific pairwise preference data. The pairwise preference data includes market-specific training examples, while a ranking model from another market captures the common characteristics of the resulting ranking model. In one embodiment, the ranking model is trained by applying a Tree Based Ranking Function Adaptation (TRADA) algorithm to multi-grade labeled training data, such as editorially generated training data. Then, contradictions between the TRADA generated ranking model and target-market specific pairwise preference data are identified. For each identified contradiction, new training data is generated to correct the contradiction. Then, in one embodiment, an algorithm such as TRADA is applied to the existing ranking model and the new training data to generate a new ranking model.

Abstract: Methods, systems, and computer programs are presented for providing internet content, such as related news articles. One method includes an operation for defining a plurality of candidates based on a seed. For each candidate, scores are calculated for relevance, novelty, connection clarity, and transition smoothness. The score for connection clarity is based on a relevance score of the intersection between the words in the seed and the words in each of the candidates. Further, the score for transition smoothness measures the interest in reading each candidate when transitioning from the seed to the candidate. For each candidate, a relatedness score is calculated based on the calculated scores for relevance, novelty, connection clarity, and transition smoothness. In addition, at least one of the candidates is selected based on their relatedness scores for presentation to the user.

Abstract: Particular embodiments extract a plurality of users, a plurality of establishments, and a plurality of items from dining information provided by at least one of the plurality of users, each of the plurality of establishments sells food or beverage; construct a user-establishment matrix, a user-item matrix, and an establishment-item matrix using the plurality of users, the plurality of establishments, and the plurality of items; generate a user latent representation for the plurality of users, an establishment latent representation for the plurality of establishments, and an item latent representation for the plurality of items; and compute one or more correlations using the user latent representation, the establishment latent representation, or the item latent representation, wherein each of the one or more correlations is between two users, two establishments, two items, one user and one establishment, one of user and one item, or one establishment and one item.

Abstract: Method, system, and programs for providing adaptive application searching are disclosed. An application search request relevant to a user is received. First information associated with the user and second information associated with a plurality of applications is obtained. At least one application of the plurality of applications is identified as of interest based on the application search request, the first information, and the second information. The at least one application is provided in response to the application search request.

Abstract: In one embodiment, access one or more query chains, wherein each one of the query chains comprises two or more search queries, {q1, . . . , qn}, which are recency-sensitive, are related to the same subject matter, and are issued to a search engine sequentially, and actual click-through information associated with each one of the query chains; and smooth each one of the query chains using the actual click-through information associated with the query chain. To smooth one of the query chains comprises, for each one of search queries, qj, in the query chain, where 2?j?n, if one of the network resources identified for qj has actually been clicked in connection with qj by the corresponding one network user, then presume that the one network resource has been clicked in connection with one or more search queries, qk, in the query chain, where 1?k<j.

Abstract: The system and method of the present invention allows for the determination of the relevance of a content item to a query through the use of a machine learned relevance function that incorporate query differentiation. A method for selecting a relevance function to determine a relevance of a query-content item pair comprises generating a training set comprising one or more content item-query pairs. Content item-query pairs in the training set are collectively used to determine the relevance function by minimizing a loss function according to a relevance score adjustment function that accounts for query differentiation. The monotocity of relevance score adjustment function allows the trained relevance function to be directly applied to new queries.

Abstract: In one embodiment, access one or more query-resource pairs, wherein for each one of the query-resource pairs comprising one of one or more search queries and one of one or more network resources, the one search query is recency-sensitive with respect to a particular time period, and the one network resource is identified for the one search query, and a resource-view count and a resource-click count associated with each one of the query-resource pairs; and construct one or more first click features using the resource-view counts and the resource-click counts associated with the query-resource pairs. To construct one of the first click features in connection with one of the query-resource pairs comprises determine a only-resource-click count associated with the one query-resource pair; and calculate a ratio between the only-resource-click count and the resource-view count associated with the one query-resource pair as the one first click feature.

Abstract: The system and method of the present invention allows for the determination of the relevance of a content item to a query through the use of a machine learned relevance function that incorporate query differentiation. A method for selecting a relevance function to determine a relevance of a query-content item pair comprises generating a training set comprising one or more content item-query pairs. Content item-query pairs in the training set are collectively used to determine the relevance function by minimizing a loss function according to a relevance score adjustment function that accounts for query differentiation. The monotocity of relevance score adjustment function allows the trained relevance function to be directly applied to new queries.

Abstract: Embodiments are directed towards generating market-specific ranking models by leveraging target market specific pairwise preference data. The pairwise preference data includes market-specific training examples, while a ranking model from another market captures the common characteristics of the resulting ranking model. In one embodiment, the ranking model is trained by applying a Tree Based Ranking Function Adaptation (TRADA) algorithm to multi-grade labeled training data, such as editorially generated training data. Then, contradictions between the TRADA generated ranking model and target-market specific pairwise preference data are identified. For each identified contradiction, new training data is generated to correct the contradiction. Then, in one embodiment, an algorithm such as TRADA is applied to the existing ranking model and the new training data to generate a new ranking model.

Abstract: Particular embodiments extract a plurality of users, a plurality of establishments, and a plurality of items from dining information provided by at least one of the plurality of users, each of the plurality of establishments sells food or beverage; construct a user-establishment matrix, a user-item matrix, and an establishment-item matrix using the plurality of users, the plurality of establishments, and the plurality of items; generate a user latent representation for the plurality of users, an establishment latent representation for the plurality of establishments, and an item latent representation for the plurality of items; and compute one or more correlations using the user latent representation, the establishment latent representation, or the item latent representation, wherein each of the one or more correlations is between two users, two establishments, two items, one user and one establishment, one of user and one item, or one establishment and one item.

Abstract: The present invention discloses a method for processing the video telephone calling based on the mobile communication network.

Abstract: Example methods, apparatuses, or articles of manufacture are disclosed that may be implemented using one or more computing devices to provide or otherwise support micro-blog message filtering.

Abstract: One particular embodiment clusters a plurality of documents using one or more clustering algorithms to obtain one or more first sets of clusters, wherein: each first set of clusters results from clustering the documents using one of the clustering algorithms; and with respect to each first set of clusters, each of the documents belongs to one of the clusters from the first set of clusters; accesses a search query; identifies a search result in response to the search query, wherein the search result comprises two or more of the documents; and clusters the search result to obtain a second set of clusters, wherein each document of the search result belongs to one of the clusters from the second set of clusters.