Patents by Inventor Sudhir Achuthan
Sudhir Achuthan has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Publication number: 20230350959Abstract: Systems and methods are provided for improved web searching. In one implementation, suggest 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.Type: ApplicationFiled: June 27, 2023Publication date: November 2, 2023Inventors: Sean Christopher TIMM, Sudhir ACHUTHAN
-
Patent number: 11714862Abstract: 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.Type: GrantFiled: February 12, 2021Date of Patent: August 1, 2023Assignee: Yahoo Assets LLCInventors: Sean Christopher Timm, Sudhir Achuthan
-
Patent number: 11442792Abstract: 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.Type: GrantFiled: December 15, 2020Date of Patent: September 13, 2022Assignee: Yahoo Assets LLCInventors: Thu R. Kyaw, Jonathan Ji, Saad Mufti, Sudhir Achuthan, Sang Chul Song
-
Patent number: 11221890Abstract: 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.Type: GrantFiled: November 21, 2018Date of Patent: January 11, 2022Assignee: Verizon Media Inc.Inventors: Thu R. Kyaw, Jonathan Ji, Saad Mufti, Sudhir Achuthan, Sang Chul Song
-
Publication number: 20210365300Abstract: 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.Type: ApplicationFiled: November 21, 2018Publication date: November 25, 2021Inventors: Thu R. KYAW, Jonathan JI, Saad MUFTI, Sudhir ACHUTHAN, Sang Chul SONG
-
Patent number: 11080099Abstract: 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.Type: GrantFiled: November 21, 2018Date of Patent: August 3, 2021Assignee: Verizon Media Inc.Inventors: Thu R. Kyaw, Jonathan Ji, Saad Mufti, Sudhir Achuthan, Sang Chul Song
-
Publication number: 20210209182Abstract: 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.Type: ApplicationFiled: February 12, 2021Publication date: July 8, 2021Inventors: Sean Christopher TIMM, Sudhir ACHUTHAN
-
Publication number: 20210103478Abstract: 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.Type: ApplicationFiled: December 15, 2020Publication date: April 8, 2021Inventors: Thu R. KYAW, Jonathan JI, Saad MUFTI, Sudhir ACHUTHAN, Sang Chul SONG
-
Patent number: 10956518Abstract: 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.Type: GrantFiled: August 15, 2016Date of Patent: March 23, 2021Assignee: Verizon Media Inc.Inventors: Sean Christopher Timm, Sudhir Achuthan
-
Patent number: 10719538Abstract: 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.Type: GrantFiled: August 21, 2017Date of Patent: July 21, 2020Assignee: OATH INC.Inventors: Sean Christopher Timm, Sudhir Achuthan, Mikhail Nicholaos Barrett
-
Publication number: 20200159594Abstract: 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.Type: ApplicationFiled: November 21, 2018Publication date: May 21, 2020Inventors: Thu R. KYAW, Jonathan JI, Saad MUFTI, Sudhir ACHUTHAN, Sang Chui SONG
-
Patent number: 10162830Abstract: 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.Type: GrantFiled: June 22, 2016Date of Patent: December 25, 2018Assignee: Oath (Americas) Inc.Inventors: Thu R. Kyaw, Jonathan Ji, Saad Mufti, Sudhir Achuthan, Sang Chul Song
-
Publication number: 20170371892Abstract: 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.Type: ApplicationFiled: June 22, 2016Publication date: December 28, 2017Inventors: Thu R. KYAW, Jonathan JI, Saad MUFTI, Sudhir ACHUTHAN, Sang Chul SONG
-
Publication number: 20170344628Abstract: 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.Type: ApplicationFiled: August 21, 2017Publication date: November 30, 2017Inventors: Sean Christopher TIMM, Sudhir ACHUTHAN, Mikhail Nicholaos BARRETT
-
Patent number: 9767185Abstract: 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.Type: GrantFiled: October 2, 2012Date of Patent: September 19, 2017Assignee: Oath Inc.Inventors: Sean Christopher Timm, Sudhir Achuthan, Mikhail Nicholaos Barrett
-
Patent number: 9721019Abstract: 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.Type: GrantFiled: December 10, 2012Date of Patent: August 1, 2017Assignee: AOL Inc.Inventors: Thu Kyaw, Sang Chul Song, Sean Christopher Timm, Sudhir Achuthan, Mikhail Barrett, Vineet Mahajan
-
Patent number: 9542458Abstract: 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.Type: GrantFiled: January 14, 2014Date of Patent: January 10, 2017Assignee: AOL Inc.Inventors: Sang Chul Song, Sudhir Achuthan, Thu Kyaw, Sean Christopher Timm, Aaron T. Soules, Vineet Mahajan
-
Publication number: 20160350434Abstract: 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.Type: ApplicationFiled: August 15, 2016Publication date: December 1, 2016Inventors: Sean Christopher TIMM, Sudhir ACHUTHAN
-
Patent number: 9449101Abstract: 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.Type: GrantFiled: November 17, 2014Date of Patent: September 20, 2016Assignee: AOL Inc.Inventors: Sean Christopher Timm, Sudhir Achuthan
-
Publication number: 20150310097Abstract: 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.Type: ApplicationFiled: July 8, 2015Publication date: October 29, 2015Inventors: Sudhir ACHUTHAN, Vineet MAHAJAN, Sean C. TIMM, Travis A. WALKER, Sangchul SONG