IP Library Granted Patent US 12,401,837
Granted Patent B2
US 12,401,837 · App. 18/599,160 · Granted Aug 26, 2025

Machine learning techniques for advanced frequency management

Inventors: Khaldun Matter Ahmad AlDarabsah (Santa Clara, CA); Hailong Geng (Beijing, CN); Yu Tao Zhao (Olympia, WA); Yoshihiro Tanaka (Redmond, WA); Haofei Wang (Redwood City, CA); Mark Alden Rotblat (Lafayette, CA); Jaya Kawale (San Jose, CA); Chang She (San Francisco, CA); Marios Assiotis (Park City, UT); Joseph Gallagher (San Francisco, CA); Chiyu Zhong (Bloomington, IN); Amir Mazaheri (Mountain View, CA)
Assignee: Tubi, Inc.
H04N21/23424G06Q30/0245G06Q30/0251G06Q30/0277G06V10/70G06V10/774G06V10/776G06V20/41G06V20/46H04N21/251H04N21/26208
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,401,837
App. No.
18/599,160
Granted
Aug 26, 2025
Kind
B2
Abstract

Systems and methods for frequency management, including: an online media service configured to receive a request for a media item, the request comprising a recipient identifier of a recipient, and identify a set of candidate media items ranked based at least partially on relevance to the recipient; and a frequency management service configured to: (i) identify a quantity of impressions associated with a first candidate media item of the set of candidate media items and the recipient identifier over a preceding duration of time, (ii) identify a maximum frequency threshold, (iii) determine, based on the quantity of impressions, that the maximum frequency threshold is exceeded, (iv) exclude the first candidate media item from a result set based on the frequency threshold being exceeded, and (v) provide the result set comprising an identifier of a second candidate media item in response to the request.

Claims (67)

1. A system for frequency management, comprising:

a computer processor;

an online media service configured to:

receive a request for a media item, the request comprising a recipient identifier of a recipient;

identify a set of candidate media items ranked based at least partially on relevance to the recipient; and

a frequency management service executing on the computer processor and configured to enable the computer processor to:

identify a quantity of impressions associated with a first candidate media item of the set of candidate media items and the recipient identifier over a preceding duration of time;

identify a maximum frequency threshold;

determine, based on the quantity of impressions, that the maximum frequency threshold is exceeded;

exclude the first candidate media item from a result set based on the frequency threshold being exceeded;

provide the result set comprising an identifier of a response candidate media item of the set of candidate media items in response to the request; and

identify an industry identifier associated with the first candidate media item, wherein the quantity of impressions is weighted according to an aggregate quantifier representing impressions corresponding to the industry identifier and the recipient identifier.

2. The system of claim 1 , wherein the online media service is further configured to:

obtain a set of cross-device identifiers associated with the recipient identifier, wherein the quantity of impressions is an aggregate of impressions corresponding to the set of cross-device identifiers and the recipient identifier.

3. The system of claim 2 , wherein the cross-device identifiers and the recipient identifier correspond to a household.

4. The system of claim 1 , wherein the online media service is further configured to:

receive a second request for a second media item, the second request comprising a second recipient identifier of a second recipient;

identify a second set of candidate media items ranked based at least partially on relevance to the second recipient;

wherein the frequency management service is further configured to enable the computer processor to:

identify a second quantity of impressions associated with a second candidate media item of the second set of candidate media items and the second recipient identifier over a second preceding duration of time;

identify a minimum frequency threshold;

determine, based at least on the second quantity of impressions, that the minimum frequency threshold is not met;

include the second candidate media item in a second result set based on the minimum frequency threshold not being met; and

provide the second result set comprising an identifier of the second candidate media item in response to the second request.

5. The system of claim 4 , wherein the minimum frequency threshold and the maximum frequency threshold form a lower and upper bound for a range of target impressions of any single entity for each recipient.

6. The system of claim 1 , wherein the identifier of the response candidate media item is associated, in a lookup cache, with a probability generated by an artificial intelligence model configured to perform entity detection on video frames of the response candidate media item, and wherein a prior request comprising an identifier of the response candidate media item triggered an ingestion process resulting in the entity identifier and the probability being stored in the lookup cache.

7. The system of claim 1 , wherein the quantity of impressions is decayed over time using a decay formula, and wherein the decay formula is configured to reduce the quantity of impressions over each of a predefined unit of time.

8. The system of claim 1 , wherein the online media service is further configured to:

receive the result set including the identifier of the response candidate media item; and

utilize the quantity of impressions as an input to a realtime bidding service to determine whether to serve the response candidate media item in response to the request.

9. A method for frequency management, comprising:

receiving a request for a media item, the request comprising a recipient identifier of a recipient;

identifying a set of candidate media items ranked based at least partially on relevance to the recipient;

identifying, using at least one computer processor, a quantity of impressions associated with a first candidate media item of the set of candidate media items and the recipient identifier over a preceding duration of time;

identifying a maximum frequency threshold;

determining, using the at least one computer processor, that the maximum frequency threshold is exceeded based on the quantity of impressions;

excluding the first candidate media item from a result set based on the frequency threshold being exceeded;

providing the result set comprising an identifier of a response candidate media item of the set of candidate media items in response to the request; and

identifying an industry identifier associated with the first candidate media item, wherein the quantity of impressions is weighted according to an aggregate quantifier representing impressions corresponding to the industry identifier and the recipient identifier.

10. The method of claim 9 , further comprising:

obtaining a set of cross-device identifiers associated with the recipient identifier, wherein the quantity of impressions is an aggregate of impressions corresponding to the set of cross-device identifiers and the recipient identifier.

11. The method of claim 10 , wherein the cross-device identifiers and the recipient identifier correspond to a household.

12. The method of claim 9 , further comprising:

receiving a second request for a second media item, the second request comprising a second recipient identifier of a second recipient;

identifying a second set of candidate media items ranked based at least partially on relevance to the second recipient;

identifying a second quantity of impressions associated with a second candidate media item of the second set of candidate media items and the second recipient identifier over a second preceding duration of time;

identifying a minimum frequency threshold;

determining, based at least on the second quantity of impressions, that the minimum frequency threshold is not met;

including the second candidate media item in a second result set based on the minimum frequency threshold not being met; and

providing the second result set comprising an identifier of the second candidate media item in response to the second request.

13. The method of claim 12 , wherein the minimum frequency threshold and the maximum frequency threshold form a lower and upper bound for a range of target impressions of any single entity for each recipient.

14. The method of claim 9 , wherein the identifier of the response candidate media item is associated, in a lookup cache, with a probability generated by an artificial intelligence model configured to perform entity detection on video frames of the response candidate media item, and wherein a prior request comprising an identifier of the response candidate media item triggered an ingestion process resulting in the entity identifier and the probability being stored in the lookup cache.

15. The method of claim 9 , wherein the quantity of impressions is decayed over time using a decay formula, and wherein the decay formula is configured to reduce the quantity of impressions over each of a predefined unit of time.

16. The method of claim 9 , further comprising:

receiving the result set including the identifier of the response candidate media item; and

utilizing the quantity of impressions as an input to a realtime bidding service to determine whether to serve the response candidate media item in response to the request.

17. A non-transitory computer-readable storage medium comprising a plurality of instructions for frequency management, the plurality of instructions configured to execute on at least one computer processor to enable the at least one computer processor to:

receive a request for a media item, the request comprising a recipient identifier of a recipient;

identify a set of candidate media items ranked based at least partially on relevance to the recipient;

identify a quantity of impressions associated with a first candidate media item of the set of candidate media items and the recipient identifier over a preceding duration of time;

identify a maximum frequency threshold;

determine, based on the quantity of impressions, that the maximum frequency threshold is exceeded;

exclude the first candidate media item from a result set based on the frequency threshold being exceeded;

provide the result set comprising an identifier of a response candidate media item of the set of candidate media items in response to the request; and

identify an industry identifier associated with the first candidate media item, wherein the quantity of impressions is weighted according to an aggregate quantifier representing impressions corresponding to the industry identifier and the recipient identifier.

18. The non-transitory computer-readable storage medium of claim 17 , the plurality of instructions further configured to enable the at least one computer processor to:

obtain a set of cross-device identifiers associated with the recipient identifier, wherein the quantity of impressions is an aggregate of impressions corresponding to the set of cross-device identifiers and the recipient identifier.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded May 7, 2024
From: ALDARABSAH, KHALDUN MATTER AHMAD; GENG, HAILONG; ZHAO, YU TAO; TANAKA, YOSHIHIRO; WANG, HAOFEI; ROTBLAT, MARK ALDEN; KAWALE, JAYA; SHE, CHANG; ASSIOTIS, MARIOS; GALLAGHER, JOSEPH; ZHONG, CHIYU; AMIR MAZAHERI, AMIR MAZAHERI
To: TUBI, INC.
Reel/Frame 067340/0570 →
Continuity (3)
Continuation 17676763 · Feb 21, 2022
Provisional Application 63213177 · Jun 21, 2021
Related Publication 20240214616A1 · Jun 27, 2024
References Cited (99)
US 6546554B1 · Schmidt · 2003 [cited by applicant]
US 6804816B1 · Liu · 2004 [cited by applicant]
US 8776111B1 · Eldering et al. · 2014 [cited by applicant]
US 9215123B1 · Fears et al. · 2015 [cited by applicant]
US 9277275B1 · Arini · 2016 [cited by applicant]
US 9465604B1 · Burgyan et al. · 2016 [cited by applicant]
US 9563928B1 · Sokolowski et al. · 2017 [cited by applicant]
US 10007863B1 · Pereira et al. · 2018 [cited by applicant]
US 10671852B1 · Zadeh et al. · 2020 [cited by applicant]
US 10846737B1 · Matarese et al. · 2020 [cited by applicant]
US 10887421B2 · Moassoudi · 2021 [cited by applicant]
US 11463540B2 · Massoudi · 2022 [cited by applicant]
US 20010020255A1 · Hofmann et al. · 2001 [cited by applicant]
US 20020111995A1 · Mansour · 2002 [cited by applicant]
US 20020129129A1 · Bloch · 2002 [cited by applicant]
US 20020129368A1 · Schlack et al. · 2002 [cited by applicant]
US 20020146181A1 · Azam · 2002 [cited by applicant]
US 20020178126A1 · Beck et al. · 2002 [cited by applicant]
US 20030191726A1 · Kirshenbaum · 2003 [cited by applicant]
US 20030235184A1 · Dorenbosch et al. · 2003 [cited by applicant]
US 20050049998A1 · Ruhlow · 2005 [cited by applicant]
US 20050101321A1 · Ikeda et al. · 2005 [cited by applicant]
US 20050172243A1 · Pabla · 2005 [cited by applicant]
US 20050177835A1 · Chickering · 2005 [cited by applicant]
US 20060075019A1 · Donovan et al. · 2006 [cited by applicant]
US 20060253323A1 · Phan et al. · 2006 [cited by applicant]
US 20070233671A1 · Oztekin et al. · 2007 [cited by applicant]
US 20080082604A1 · Mansour et al. · 2008 [cited by applicant]
US 20080259906A1 · Shkedi · 2008 [cited by applicant]
US 20090006214A1 · Lerman · 2009 [cited by applicant]
US 20090013051A1 · Renschler et al. · 2009 [cited by applicant]
US 20090029687A1 · Ramer et al. · 2009 [cited by applicant]
US 20090064301A1 · Sachdeva · 2009 [cited by applicant]
US 20090089161A1 · Alam Alo et al. · 2009 [cited by applicant]
US 20090106785A1 · Pharn · 2009 [cited by applicant]
US 20090129479A1 · Yellamraju · 2009 [cited by applicant]
US 20090204478A1 · Kaib et al. · 2009 [cited by applicant]
US 20100037255A1 · Sheehan · 2010 [cited by applicant]
US 20100151816A1 · Besehanic et al. · 2010 [cited by applicant]
US 20100211967A1 · Ramaswamy et al. · 2010 [cited by applicant]
US 20100246981A1 · Hu et al. · 2010 [cited by applicant]
US 20110040636A1 · Simmons et al. · 2011 [cited by applicant]
US 20110093335A1 · Fordyce et al. · 2011 [cited by applicant]
US 20110103374A1 · LaJoie et al. · 2011 [cited by applicant]
US 20110113116A1 · Burdette et al. · 2011 [cited by applicant]
US 20110125594A1 · Brown et al. · 2011 [cited by applicant]
US 20110167440A1 · Greenfield · 2011 [cited by applicant]
US 20110219229A1 · Cholas et al. · 2011 [cited by applicant]
US 20110225046A1 · Eldering · 2011 [cited by examiner]
US 20110246298A1 · Williams et al. · 2011 [cited by applicant]
US 20110252305A1 · Tschäni et al. · 2011 [cited by applicant]
US 20110258049A1 · Ramer et al. · 2011 [cited by applicant]
US 20120007866A1 · Tahan · 2012 [cited by applicant]
US 20120016655A1 · Travieso · 2012 [cited by applicant]
US 20120029983A1 · Rodriguez et al. · 2012 [cited by applicant]
US 20120089455A1 · Belani et al. · 2012 [cited by applicant]
US 20120102169A1 · Yu et al. · 2012 [cited by applicant]
US 20120151079A1 · Besehanic et al. · 2012 [cited by applicant]
US 20120263385A1 · van Zwol · 2012 [cited by applicant]
US 20130110634A1 · Cochran et al. · 2013 [cited by applicant]
US 20130132856A1 · Binyamin et al. · 2013 [cited by applicant]
US 20130156269A1 · Matsui et al. · 2013 [cited by applicant]
US 20130198376A1 · Landa et al. · 2013 [cited by applicant]
US 20130227068A1 · Yasrebi et al. · 2013 [cited by applicant]
US 20130268951A1 · Wyatt et al. · 2013 [cited by applicant]
US 20130311649A1 · DeFrancesco et al. · 2013 [cited by applicant]
US 20130346202A1 · Kouladjie · 2013 [cited by applicant]
US 20140059636A1 · Patel · 2014 [cited by applicant]
US 20140075014A1 · Chourey · 2014 [cited by applicant]
US 20140101739A1 · Li et al. · 2014 [cited by applicant]
US 20140143052A1 · Stryker · 2014 [cited by applicant]
US 20140157289A1 · Aarts et al. · 2014 [cited by applicant]
US 20140181243A1 · Nieuwenhuys · 2014 [cited by applicant]
US 20140282642A1 · Needham et al. · 2014 [cited by applicant]
US 20140372415A1 · Fernandez-Ruiz · 2014 [cited by applicant]
US 20140379911A1 · Fayssal et al. · 2014 [cited by applicant]
US 20150055931A1 · Koivukangas et al. · 2015 [cited by applicant]
US 20150082345A1 · Archer et al. · 2015 [cited by applicant]
US 20150206198A1 · Marshall · 2015 [cited by applicant]
US 20150234564A1 · Snibbe et al. · 2015 [cited by applicant]
US 20150271540A1 · Melby et al. · 2015 [cited by applicant]
US 20150382075A1 · Neumeier et al. · 2015 [cited by applicant]
US 20160358099A1 · Sturlaugson · 2016 [cited by applicant]
US 20160358209A1 · Khozani et al. · 2016 [cited by applicant]
US 20160360289A1 · Santoro et al. · 2016 [cited by applicant]
US 20170064411A1 · Goli et al. · 2017 [cited by applicant]
US 20170193560A1 · Bhalgat · 2017 [cited by applicant]
US 20170278289A1 · Marino · 2017 [cited by applicant]
US 20180349391A1 · Chechik · 2018 [cited by applicant]
US 20190138810A1 · Chen et al. · 2019 [cited by applicant]
US 20190295122A1 · Kumar · 2019 [cited by applicant]
US 20190332865A1 · Dassa · 2019 [cited by applicant]
US 20200160389A1 · Yang · 2020 [cited by applicant]
US 20200242364A1 · Zadeh · 2020 [cited by applicant]
US 20210089780A1 · Chang · 2021 [cited by applicant]
US 20210195286A1 · Lohumi · 2021 [cited by applicant]
US 20220172384A1 · Pereira · 2022 [cited by applicant]
“Mediacampaign—A multi modal semantic analysis system for advertisement campaign detection”, IEEE, 2008. (Year (2008). [cited by applicant]
An overview of computational challenges in online advertising. IEEE. 2013. (Year: 2013). [cited by applicant]