Patents by Inventor Kumar Chellapilla
Kumar Chellapilla 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).
-
Patent number: 11216841Abstract: A real-time messaging platform allows advertiser accounts to pay to insert candidate messages into the message streams requested by account holders. To accommodate multiple advertisers, the messaging platform controls an auction process that determines which candidate messages are selected for inclusion in a requested account holder's message stream. Selection is based on a bid for the candidate message, the message stream that is requested, and a variety of other factors that vary depending upon the implementation. The process for selection of candidate messages generally includes the following steps, though any given step may be omitted or combined into another step in a different implementation: targeting, filtering, prediction, ranking, and selection.Type: GrantFiled: March 14, 2014Date of Patent: January 4, 2022Assignee: Twitter, Inc.Inventors: Reid Andersen, Utkarsh Srivastava, Kumar Chellapilla
-
Patent number: 10769677Abstract: A real-time messaging platform allows advertiser accounts to pay to insert candidate messages into the message streams requested by account holders. To accommodate multiple advertisers, the messaging platform controls an auction process that determines which candidate messages are selected for inclusion in a requested account holder's message stream. Selection is based on a bid for the candidate message, the message stream that is requested, and a variety of other factors that vary depending upon the implementation. The process for selection of candidate messages generally includes the following steps, though any given step may be omitted or combined into another step in a different implementation: targeting, filtering, prediction, ranking, and selection.Type: GrantFiled: February 12, 2018Date of Patent: September 8, 2020Assignee: Twitter, Inc.Inventors: Parag Agrawal, Utkarsh Srivastava, Kumar Chellapilla, Qicheng Ma
-
Patent number: 9892431Abstract: A real-time messaging platform allows advertiser accounts to pay to insert candidate messages into the message streams requested by account holders. To accommodate multiple advertisers, the messaging platform controls an auction process that determines which candidate messages are selected for inclusion in a requested account holder's message stream. Selection is based on a bid for the candidate message, the message stream that is requested, and a variety of other factors that vary depending upon the implementation. The process for selection of candidate messages generally includes the following steps, though any given step may be omitted or combined into another step in a different implementation: targeting, filtering, prediction, ranking, and selection.Type: GrantFiled: September 8, 2016Date of Patent: February 13, 2018Assignee: Twitter, Inc.Inventors: Parag Agrawal, Utkarsh Srivastava, Kumar Chellapilla, Qicheng Ma
-
Patent number: 9454771Abstract: A real-time messaging platform allows advertiser accounts to pay to insert candidate messages into the message streams requested by account holders. To accommodate multiple advertisers, the messaging platform controls an auction process that determines which candidate messages are selected for inclusion in a requested account holder's message stream. Selection is based on a bid for the candidate message, the message stream that is requested, and a variety of other factors that vary depending upon the implementation. The process for selection of candidate messages generally includes the following steps, though any given step may be omitted or combined into another step in a different implementation: targeting, filtering, prediction, ranking, and selection.Type: GrantFiled: July 16, 2015Date of Patent: September 27, 2016Assignee: Twitter, Inc.Inventors: Parag Agrawal, Utkarsh Srivastava, Kumar Chellapilla, Qicheng Ma
-
Patent number: 9117227Abstract: A real-time messaging platform allows advertiser accounts to pay to insert candidate messages into the message streams requested by account holders. To accommodate multiple advertisers, the messaging platform controls an auction process that determines which candidate messages are selected for inclusion in a requested account holder's message stream. Selection is based on a bid for the candidate message, the message stream that is requested, and a variety of other factors that vary depending upon the implementation. The process for selection of candidate messages generally includes the following steps, though any given step may be omitted or combined into another step in a different implementation: targeting, filtering, prediction, ranking, and selection.Type: GrantFiled: March 14, 2014Date of Patent: August 25, 2015Assignee: TWITTER, INC.Inventors: Parag Agrawal, Utkarsh Srivastava, Kumar Chellapilla, Qicheng Ma
-
Patent number: 9104960Abstract: Methods, systems, and computer-storage media having computer-usable instructions embodied thereon for calculating event probabilities are provided. The event may be a click probability. Event probabilities are calculated using a system optimized for runtime model accuracy with an operable learning algorithm. Bin counting techniques are used to calculate event probabilities based on a count of event occurrences and non-event occurrences. Linear parameters, such and counts of clicks and non-clicks, may also be used in the system to allow for runtime adjustments.Type: GrantFiled: June 20, 2011Date of Patent: August 11, 2015Assignee: MICROSOFT TECHNOLOGY LICENSING, LLCInventors: Leon Bottou, Kumar Chellapilla, Patrice Y. Simard, David Max Chickering
-
Patent number: 9043306Abstract: A client application installed on end user computers generates metadata from the content of web pages visited by end users and provides the metadata to a search engine. When an end user visits a web page, the end user's computer downloads and displays the web page to the end user. The client application may simultaneously access the web page content and generate this metadata in the form of a content signature of the web page from the web page content. The client application then provides the content signature to a search engine. The search engine may employ content signatures to identify new web pages to crawl and index. Additionally, the search engine may employ content signatures to identify changes to web pages and determine the crawl frequency of web pages.Type: GrantFiled: August 23, 2010Date of Patent: May 26, 2015Assignee: MICROSOFT TECHNOLOGY LICENSING, LLCInventors: Fabrice Canel, Junaid Ahmed, Thomas Francis McElroy, Walter Sun, Kumar Chellapilla, Abhishek Singh, Vishnu Challam
-
Patent number: 8768919Abstract: A human or hand-labeled ranking of URL results for a search query is compared against actual click data for the respective query/URL pairs (e.g., which URLs were actually clicked on by users when the URLs were presented to users when the search query was run in the real world). The human ranking or ordering of the URL results (e.g., pre-existing relevance ranking) for the query can then be adjusted, if necessary, based upon the real world click data (e.g., click relevance ranking). The modified pre-existing relevance ranking can be used in providing future search results.Type: GrantFiled: August 30, 2012Date of Patent: July 1, 2014Assignee: Microsoft CorporationInventors: Kumar Chellapilla, Anton Mityagin, Xuanhui Wang
-
Publication number: 20120323907Abstract: A human or hand-labeled ranking of URL results for a search query is compared against actual click data for the respective query/URL pairs (e.g., which URLs were actually clicked on by users when the URLs were presented to users when the search query was run in the real world). The human ranking or ordering of the URL results (e.g., pre-existing relevance ranking) for the query can then be adjusted, if necessary, based upon the real world click data (e.g., click relevance ranking). The modified pre-existing relevance ranking can be used in providing future search results.Type: ApplicationFiled: August 30, 2012Publication date: December 20, 2012Applicant: Microsoft CorporationInventors: Kumar Chellapilla, Anton Mityagin, Xuanhui Wang
-
Publication number: 20120323677Abstract: Methods, systems, and computer-storage media having computer-usable instructions embodied thereon for calculating event probabilities are provided. The event may be a click probability. Event probabilities are calculated using a system optimized for runtime model accuracy with an operable learning algorithm. Bin counting techniques are used to calculate event probabilities based on a count of event occurrences and non-event occurrences. Linear parameters, such and counts of clicks and non-clicks, may also be used in the system to allow for runtime adjustments.Type: ApplicationFiled: June 20, 2011Publication date: December 20, 2012Applicant: MICROSOFT CORPORATIONInventors: LEON BOTTOU, KUMAR CHELLAPILLA, PATRICE Y. SIMARD, DAVID MAX CHICKERING
-
Patent number: 8296327Abstract: Short paths are found with a small query time in scale-free directed graphs using a two-phase process by which data structures comprising shortest path trees are first pre-computed for a group of central vertices called “hubs” that have short paths to most other vertices in the graph. In a query time phase, a short path between two vertices of interest in the graph is found by looking up the path to the root in each of the shortest path trees.Type: GrantFiled: May 28, 2009Date of Patent: October 23, 2012Assignee: Microsoft CorporationInventors: Reid Andersen, Kumar Chellapilla, Chinmay Karande
-
Patent number: 8290945Abstract: A human or hand-labeled ranking of URL results for a search query is compared against actual click data for the respective query/URL pairs (e.g., which URLs were actually clicked on by users when the URLs were presented to users when the search query was run in the real world). The human ranking or ordering of the URL results (e.g., pre-existing relevance ranking) for the query can then be adjusted, if necessary, based upon the real world click data (e.g., click relevance ranking). The modified pre-existing relevance ranking can be used in providing future search results.Type: GrantFiled: September 29, 2010Date of Patent: October 16, 2012Assignee: Microsoft CorporationInventors: Kumar Chellapilla, Anton Mityagin, Xuanhui Wang
-
Patent number: 8244752Abstract: A method for classifying search query traffic can involve receiving a plurality of labeled sample search query traffic and generating a feature set partitioned into human physical limit features and query stream behavioral features. A model can be generated using the plurality of labeled sample search query traffic and the feature set. Search query traffic can be received and the model can be utilized to classify the received search query traffic as generated by a human or automatically generated.Type: GrantFiled: April 21, 2008Date of Patent: August 14, 2012Assignee: Microsoft CorporationInventors: Greg Buehrer, Kumar Chellapilla, Jack W. Stokes
-
Patent number: 8200596Abstract: Classes of web graph algorithms are extended to run directly on virtual node-type compressed web graphs where a reduction in runtime of the extended algorithms is realized which is approximately proportional to the compression ratio applied to the original (i.e., uncompressed) graph. In the virtual node compression technique, a succinct representation of a web graph is constructed by replacing dense subgraphs by sparse ones so that the resulting compressed graph has significantly fewer edges and a relatively small number of additional nodes.Type: GrantFiled: May 28, 2009Date of Patent: June 12, 2012Inventors: Reid Andersen, Kumar Chellapilla, Chinmay Karande
-
Publication number: 20120047121Abstract: A client application installed on end user computers generates metadata from the content of web pages visited by end users and provides the metadata to a search engine. When an end user visits a web page, the end user's computer downloads and displays the web page to the end user. The client application may simultaneously access the web page content and generate this metadata in the form of a content signature of the web page from the web page content. The client application then provides the content signature to a search engine. The search engine may employ content signatures to identify new web pages to crawl and index. Additionally, the search engine may employ content signatures to identify changes to web pages and determine the crawl frequency of web pages.Type: ApplicationFiled: August 23, 2010Publication date: February 23, 2012Applicant: MICROSOFT CORPORATIONInventors: FABRICE CANEL, JUNAID AHMED, THOMAS FRANCIS MCELROY, WALTER SUN, KUMAR CHELLAPILLA, ABHISHEK SINGH, VISHNU CHALLAM
-
Publication number: 20110016116Abstract: A human or hand-labeled ranking of URL results for a search query is compared against actual click data for the respective query/URL pairs (e.g., which URLs were actually clicked on by users when the URLs were presented to users when the search query was run in the real world). The human ranking or ordering of the URL results (e.g., pre-existing relevance ranking) for the query can then be adjusted, if necessary, based upon the real world click data (e.g., click relevance ranking). The modified pre-existing relevance ranking can be used in providing future search results.Type: ApplicationFiled: September 29, 2010Publication date: January 20, 2011Applicant: Microsoft CorporationInventors: Kumar Chellapilla, Anton Mityagin, Xuanhui Wang
-
Publication number: 20100306158Abstract: Classes of web graph algorithms are extended to run directly on virtual node-type compressed web graphs where a reduction in runtime of the extended algorithms is realized which is approximately proportional to the compression ratio applied to the original (i.e., uncompressed) graph. In the virtual node compression technique, a succinct representation of a web graph is constructed by replacing dense subgraphs by sparse ones so that the resulting compressed graph has significantly fewer edges and a relatively small number of additional nodes.Type: ApplicationFiled: May 28, 2009Publication date: December 2, 2010Applicant: MICROSOFT CORPORATIONInventors: Reid Andersen, Kumar Chellapilla, Chinmay Karande
-
Publication number: 20100306216Abstract: Short paths are found with a small query time in scale-free directed graphs using a two-phase process by which data structures comprising shortest path trees are first pre-computed for a group of central vertices called “hubs” that have short paths to most other vertices in the graph. In a query time phase, a short path between two vertices of interest in the graph is found by looking up the path to the root in each of the shortest path trees.Type: ApplicationFiled: May 28, 2009Publication date: December 2, 2010Applicant: MICROSOFT CORPORATIONInventors: Reid Andersen, Kumar Chellapilla, Chinmay Karande
-
Patent number: 7743013Abstract: Multiple Bloom filters are generated to partition data between first and second disjoint data sets of elements. Each element in the first data set is assigned to a bucket of a first set of buckets, and each element in the second data set is assigned to a bucket of a second set of buckets. A Bloom filter is generated for each bucket of the first set of buckets. The Bloom filter generated for a bucket indicates that each element assigned to that bucket is part of the first data set, and that each element assigned to a corresponding bucket of the second set of buckets is not part of the first data set. Additionally, a Bloom filter corresponding to a subsequently received element can be determined and used to identify whether that subsequently received element is part of the first data set or the second data set.Type: GrantFiled: June 11, 2007Date of Patent: June 22, 2010Assignee: Microsoft CorporationInventors: Anton Mityagin, Kumar Chellapilla, Denis Charles
-
Publication number: 20090265317Abstract: A method for classifying search query traffic can involve receiving a plurality of labeled sample search query traffic and generating a feature set partitioned into human physical limit features and query stream behavioral features. A model can be generated using the plurality of labeled sample search query traffic and the feature set. Search query traffic can be received and the model can be utilized to classify the received search query traffic as generated by a human or automatically generated.Type: ApplicationFiled: April 21, 2008Publication date: October 22, 2009Applicant: MICROSOFT CORPORATIONInventors: Greg Buehrer, Kumar Chellapilla, Jack W. Stokes