Aol Inc.

Oath Inc.

Yahoo Assets LLC

Verizon Media Inc.

Oath (americas) Inc.

Sudhir Achuthan

Sean Christopher Timm

Thu R Kyaw

Sang Chul Song

Vineet Mahajan

Saad Mufti

Jonathan Ji

Mikhail Nicholaos Barrett

Travis Adam Walker

Aaron T Soules

Sangchul Song

Sangchui Song

Systems and methods are provided for improved web searching. In one implementation, suggested search queries am provided based on previous search queries and click data. A weighted bi-partite graph or index may be used to identify related search queries based on overlapping clicked URLs. According to a method, query-click log data of a search engine is processed to generate sets of suggested search queries, data corresponding to each suggested search query, and a set of clicked URLs related to each suggested search query. Additionally, or independently, methods may be provided for contextually correcting spelling errors within sets of suggested search queries using a contextual algorithm, and/or identifying and discarding sets of suggested search queries and URLs that lead to restricted material, such as restricted content and related URLs.

Systems and methods for improved web searching

Methods, systems, and computer-readable media are disclosed for dynamic partitioning in distributed computing environments. One method includes: receiving a first data set and a second data set; mapping the first data set into a first set of key-value pairs; mapping the second data set into a second set of key-value pairs; estimating, using a sketch, a frequency count for each key based on the first set of key-value pairs and the second set of key-value pairs; determining whether the estimated frequency count for each key is greater than or equal to a predetermined threshold; and partitioning the key when the estimated frequency count for the key is greater than or equal to the predetermined threshold.

Systems and methods for dynamic partitioning in distributed environments

Systems and methods are provided for improved web searching. In one implementation, suggested search queries are provided based on previous search queries and click data. A weighted bi-partite graph or index may be used to identify related search queries based on overlapping clicked URLs. According to a method, query-click log data of a search engine is processed to generate sets of suggested search queries, data corresponding to each suggested search query, and a set of clicked URLs related to each suggested search query. Additionally, or independently, methods may be provided for contextually correcting spelling errors within sets of suggested search queries using e contextual algorithm, and/or identifying and discarding sets of suggested search queries and URLs that lead to restricted material, such as restricted content and related URLs.

Methods and systems are provided for determining whether a search query with an observed number of occurrences in a set of search queries is a local search query. In accordance with one implementation, a method is provided that comprises determining an expected number of occurrences of a search query and comparing the expected number of occurrences to a threshold. Further, the method includes determining whether the search query is a local search query based, at least in part, on the comparison.

Methods and systems for identifying local search queries

Computer-implemented systems and methods are provided for presenting content recommendations. In one implementation, a method is provided for providing content recommendations to a plurality of users. The method may include generating a first plurality of content recommendations for a first user using a first plurality of methods, each of the first plurality of methods having a weight associated therewith. The method may further include selecting a second plurality of content recommendations from the first plurality of content recommendations based on the weights associated with the first plurality of methods. The method may further include providing the second plurality of content recommendations to the first user. The method may further include updating the weights associated with the first plurality of methods based on engagement by the first user with the second plurality of content recommendations.

Systems and methods for providing personalized recommendations for electronic content

Systems and methods are provided for processing and displaying user-generated content. User-generated content is received from a user over a network. A conversation related to the received user-generated content is identified. A score associated with the identified conversation is calculated based on one or more parameters related to the user or the conversation. The user-generated content is provided for display in relation to the conversation, based on the calculated score associated with the conversation.

Systems and methods for processing and displaying user-generated content

Systems and methods are provided for improved web searching. In one implementation, suggested search queries are provided based on previous search queries and click data. A weighted bi-partite graph or index may be used to identify related search queries based on overlapping clicked URLs. According to a method, query-click log data of a search engine is processed to generate sets of suggested search queries, data corresponding to each suggested search query, and a set of clicked URLs related to each suggested search query. Additionally, or independently, methods may be provided for contextually correcting spelling errors within sets of suggested search queries using a contextual algorithm, and/or identifying and discarding sets of suggested search queries and URLs that lead to restricted material, such as restricted content and related URLs.

Computerized systems and methods are disclosed for analyzing search query relationships and managing electronic content. In accordance with one implementation, log data pertaining to a plurality of queries may be received over an electronic network. A click graph may be generated representing one or more relationships between the queries. Further, temporal similarities may be identified between the queries, for example, by looking at peaks in frequency of queries over time. A pair of search queries may be evaluated based on the generated click graph and the identified temporal similarities to determine whether the queries in the pair are related.

Growing community of inventors

Vienna, VA, United States of America

Sudhir Achuthan