Patents by Inventor Jeremy Bem
Jeremy Bem 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: 10055461Abstract: A system ranks documents based, at least in part, on a ranking model. The ranking model may be generated to predict the likelihood that a document will be selected. The system may receive a search query and identify documents relating to the search query. The system may then rank the documents based, at least in part, on the ranking model and form search results for the search query from the ranked documents.Type: GrantFiled: July 31, 2015Date of Patent: August 21, 2018Assignee: Google LLCInventors: Jeremy Bem, Georges R. Harik, Joshua L. Levenberg, Noam M. Shazeer, Simon Tong
-
Patent number: 9116976Abstract: A system ranks documents based, at least in part, on a ranking model. The ranking model may be generated to predict the likelihood that a document will be selected. The system may receive a search query and identify documents relating to the search query. The system may then rank the documents based, at least in part, on the ranking model and form search results for the search query from the ranked documents.Type: GrantFiled: May 11, 2010Date of Patent: August 25, 2015Assignee: Google Inc.Inventors: Jeremy Bem, Georges R. Harik, Joshua L. Levenberg, Noam Shazeer, Simon Tong
-
Patent number: 8688705Abstract: A system for generating a model is provided. The system generates, or selects, candidate conditions and generates, or otherwise obtains, statistics regarding the candidate conditions. The system also forms rules based, at least in part, on the statistics and the candidate conditions and selectively adds the rules to the model.Type: GrantFiled: January 28, 2013Date of Patent: April 1, 2014Assignee: Google Inc.Inventors: Jeremy Bem, Georges R. Harik, Joshua L. Levenberg, Noam Shazeer, Simon Tong
-
Patent number: 8364618Abstract: A system for generating a model is provided. The system generates, or selects, candidate conditions and generates, or otherwise obtains, statistics regarding the candidate conditions. The system also forms rules based, at least in part, on the statistics and the candidate conditions and selectively adds the rules to the model.Type: GrantFiled: June 4, 2012Date of Patent: January 29, 2013Assignee: Google Inc.Inventors: Jeremy Bem, Georges R. Harik, Joshua L. Levenberg, Noam Shazeer, Simon Tong
-
Patent number: 8195674Abstract: A system for generating a model is provided. The system generates, or selects, candidate conditions and generates, or otherwise obtains, statistics regarding the candidate conditions. The system also forms rules based, at least in part, on the statistics and the candidate conditions and selectively adds the rules to the model.Type: GrantFiled: June 24, 2010Date of Patent: June 5, 2012Assignee: Google Inc.Inventors: Jeremy Bem, Georges R. Harik, Joshua L. Levenberg, Noam Shazeer, Simon Tong
-
Patent number: 8135619Abstract: The number of ads potentially relevant to search query information may be increased by relaxing the notion of search query keyword matching. This may be done, for example, by expanding a set of ad request keywords to include both query keywords (or derivatives of a root thereof) and related keywords. The related keywords may be words with a relatively high co-occurrence with a query keyword in a group of previous search queries (e.g., search queries in a session). The scores of ads with keyword targeting criteria that matched words related to words in a search query, but not the words from the search query, may be discounted. That is, the scores of ads served pursuant to a relaxed notion of matching may be discounted relative to the scores of ads served pursuant to a stricter notion of matching. This may be done by using a score modification parameter, such as an ad performance multiplier (for cases in which an ad score is a function of ad performance information).Type: GrantFiled: November 30, 2009Date of Patent: March 13, 2012Assignee: Google, Inc.Inventor: Jeremy Bem
-
Patent number: 7769763Abstract: A system for generating a model is provided. The system generates, or selects, candidate conditions and generates, or otherwise obtains, statistics regarding the candidate conditions. The system also forms rules based, at least in part, on the statistics and the candidate conditions and selectively adds the rules to the model.Type: GrantFiled: April 17, 2007Date of Patent: August 3, 2010Assignee: Google Inc.Inventors: Jeremy Bem, Georges R. Harik, Joshua L. Levenberg, Noam Shazeer, Simon Tong
-
Patent number: 7743050Abstract: A system ranks documents based, at least in part, on a ranking model. The ranking model may be generated to predict the likelihood that a document will be selected. The system may receive a search query and identify documents relating to the search query. The system may then rank the documents based, at least in part, on the ranking model and form search results for the search query from the ranked documents.Type: GrantFiled: April 18, 2007Date of Patent: June 22, 2010Assignee: Google Inc.Inventors: Jeremy Bem, Georges R. Harik, Joshua L. Levenberg, Noam Shazeer, Simon Tong
-
Publication number: 20100076840Abstract: The number of ads potentially relevant to search query information may be increased by relaxing the notion of search query keyword matching. This may be done, for example, by expanding a set of ad request keywords to include both query keywords (or derivatives of a root thereof) and related keywords. The related keywords may be words with a relatively high co-occurrence with a query keyword in a group of previous search queries (e.g., search queries in a session). The scores of ads with keyword targeting criteria that matched words related to words in a search query, but not the words from the search query, may be discounted. That is, the scores of ads served pursuant to a relaxed notion of matching may be discounted relative to the scores of ads served pursuant to a stricter notion of matching. This may be done by using a score modification parameter, such as an ad performance multiplier (for cases in which an ad score is a function of ad performance information).Type: ApplicationFiled: November 30, 2009Publication date: March 25, 2010Inventor: Jeremy BEM
-
Patent number: 7647242Abstract: The number of ads potentially relevant to search query information may be increased by relaxing the notion of search query keyword matching. This may be done, for example, by expanding a set of ad request keywords to include both query keywords and related keywords. The scores of ads served pursuant to a relaxed notion of matching (those with keyword targeting criteria that matched words related to words in the search query, but not the words from the search query) may be discounted relative to the scores of ads served pursuant to a stricter notion of matching. This may be done by using a score modification parameter, such as an ad performance multiplier (when an ad score is a function of ad performance information) The score modification parameter may be updated to reflect observed performance data, such as that associated with {word-to-related word} mappings.Type: GrantFiled: September 30, 2003Date of Patent: January 12, 2010Assignee: Google, Inc.Inventor: Jeremy Bem
-
Patent number: 7346615Abstract: If some aspect of serving or scoring an ad is subject to a performance (e.g., click-through rate, etc.) threshold, such a threshold may be adjusted using a confidence factor of the ad targeting used. For example, ads served pursuant to a more relaxed notion of match might have to meet a higher performance threshold (e.g., than the threshold applied to ads served pursuant to a stricter notion of match). Alternatively, or in addition, ads served pursuant to a stricter notion of match might be subject to a lower performance threshold (e.g., than the threshold applied to ads served pursuant to a more relaxed notion of match). Thus, in general, a performance threshold could increase as match confidence decreases, and/or a performance threshold could decrease as match confidence increases.Type: GrantFiled: November 14, 2003Date of Patent: March 18, 2008Assignee: Google, Inc.Inventor: Jeremy Bem
-
Patent number: 7231399Abstract: A system ranks documents based, at least in part, on a ranking model. The ranking model may be generated to predict the likelihood that a document will be selected. The system may receive a search query and identify documents relating to the search query. The system may then rank the documents based, at least in part, on the ranking model and form search results for the search query from the ranked documents.Type: GrantFiled: November 14, 2003Date of Patent: June 12, 2007Assignee: Google Inc.Inventors: Jeremy Bem, Georges R. Harik, Joshua L. Levenberg, Noam Shazeer, Simon Tong
-
Patent number: 7222127Abstract: A system for generating a model is provided. The system generates, or selects, candidate conditions and generates, or otherwise obtains, statistics regarding the candidate conditions. The system also forms rules based, at least in part, on the statistics and the candidate conditions and selectively adds the rules to the model.Type: GrantFiled: December 15, 2003Date of Patent: May 22, 2007Assignee: Google Inc.Inventors: Jeremy Bem, Georges R. Harik, Joshua L. Levenberg, Noam Shazeer, Simon Tong
-
Publication number: 20050080772Abstract: If some aspect of serving or scoring an ad is subject to a performance (e.g., click-through rate, etc.) threshold, such a threshold may be adjusted using a confidence factor of the ad targeting used. For example, ads served pursuant to a more relaxed notion of match might have to meet a higher performance threshold (e.g., than the threshold applied to ads served pursuant to a stricter notion of match). Alternatively, or in addition, ads served pursuant to a stricter notion of match might be subject to a lower performance threshold (e.g., than the threshold applied to ads served pursuant to a more relaxed notion of match. Thus, in general, a performance threshold could increase as match confidence decreases, and/or a performance threshold could decrease as match confidence increases.Type: ApplicationFiled: November 14, 2003Publication date: April 14, 2005Inventor: Jeremy Bem
-
Publication number: 20050071325Abstract: The number of ads potentially relevant to search query information may be increased by relaxing the notion of search query keyword matching. This may be done, for example, by expanding a set of ad request keywords to include both query keywords (or derivatives of a root thereof) and related keywords. The related keywords may be words with a relatively high co-occurrence with a query keyword in a group of previous search queries (e.g., search queries in a session). The scores of ads with keyword targeting criteria that matched words related to words in a search query, but not the words from the search query, may be discounted. That is, the scores of ads served pursuant to a relaxed notion of matching may be discounted relative to the scores of ads served pursuant to a stricter notion of matching. This may be done by using a score modification parameter, such as an ad performance multiplier (for cases in which an ad score is a function of ad performance information).Type: ApplicationFiled: September 30, 2003Publication date: March 31, 2005Inventor: Jeremy Bem