IP Library Granted Patent US 12,361,445
Granted Patent B2
US 12,361,445 · App. 17/884,514 · Granted Jul 15, 2025

Systems and methods of log optimization for television advertisements

Inventor: Andrej Ficnar (Carmel, IN)
Assignee: Known Global LLC
G06Q30/0241G06N5/022
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,361,445
App. No.
17/884,514
Granted
Jul 15, 2025
Kind
B2
Abstract

Embodiments of the present invention provide systems and methods of log optimization for television advertisements. Exemplary method and systems can comprise: receiving, at a computer software platform, (i) the digital log, (ii) constraint parameters, and (iii) viewership predictions; and generating, with the computer software platform, an optimized log based on the received digital log, the constraint parameters, and the viewership predictions.

Claims (30)

1. A method for optimizing a digital log of N available advertisements for a television network publisher, the method comprising:

(a) receiving, by a computer, (i) the digital log, (ii) constraint parameters, and (iii) viewership predictions, each for the N available advertisements;

(b) generating, by the computer, a constraint matrix of size N×N, wherein each entry in the constraint matrix corresponds to a separation time between two of the available advertisements in the digital log, the separation time determined based on the constraint parameters of the two available advertisements;

(c) analyzing, by the computer, the constraint matrix using a graph theory process to separate the available advertisements into a number of groups based on the separation times provided in the constraint matrix based on the separation times in the constraint matrix, wherein the number of groups correspond to maximal cliques of the constraint matrix as determine by the group theory process, wherein each group consists of a portion of the available advertisements all having separation times less than a threshold amount;

(d) if the number of groups is greater than a predetermined threshold, applying, by the computer, a further constraint selected from (i) preventing a group of the available advertisements from appearing more than once in a commercial break, or (ii) freezing a portion of the available advertisements to initial advertisement slots, and repeating steps (c) and (d) with the further constraint to further reduce the number of groups until the reduced number of groups is below the predetermined threshold;

(e) generating, with the computer, an optimized log using a linear integer programming (LIP) optimization process based on the reduced groups of available advertisements and the viewership predictions, wherein the optimized log comprises an updated schedule for airing the N available advertisements;

(f) transmitting the optimized log from the computer to an advertisement trafficking server; and

(g) moving and airing, by the advertisement trafficking server, the N available advertisements according to the updated schedule of the optimized log.

2. The method of claim 1 , wherein the digital log is a list of the available advertisements for the television network publisher or an optimized list of the available advertisements for the television network publisher.

3. The method of claim 1 , wherein the constraint parameters include one at least one of: separation constraints, exclusions, and time locks,

wherein the viewership predictions are based on a machine learning model, and

wherein the machine learning model is configured to predict a number of viewers of a certain demographics that will watch a certain program.

4. The method of claim 3 , further comprising:

transmitting, with the advertisement trafficking server, data associated with the moving and airing of the N available advertisements according to the updated schedule of the optimized log to the computer;

retraining, with the computer, the machine learning model with the transmitted data.

5. The method of claim 1 , further comprising:

generating, with the computer, a report including a difference of a first revenue associated with the digital log and a second revenue associated with the optimized log.

6. A system for optimizing a digital log of N available advertisements for a television network publisher, the system comprising:

at least one computer comprising a processor configured to execute instructions, wherein the instructions cause the processor to perform operations comprising:

(a) receiving, by a computer, (i) the digital log, (ii) constraint parameters, and (iii) viewership predictions, each for the N available advertisements,

(b) generating, by the computer, a constraint matrix of size N×N, wherein each entry in the constraint matrix corresponds to a separation time between two of the available advertisements in the digital log, the separation time determined based on the constraint parameters of the two available advertisements;

(c) analyzing, by the computer, the constraint matrix using a graph theory process to separate the available advertisements into a number of groups based on the separation times provided in the constraint matrix based on the separation times in the constraint matrix, wherein the number of groups correspond to maximal cliques of the constraint matrix as determine by the group theory process, wherein each group consists of a portion of the available advertisements all having separation times less than a threshold amount,

(d) if the number of groups is greater than a predetermined threshold, applying, by the computer, a further constraint selected from (i) preventing a group of the available advertisements from appearing more than once in a commercial break, or (ii) freezing a portion of the available advertisements to initial advertisement slots, and repeating steps (c) and (d) with the further constraint to further reduce the number of groups, until the reduced number of groups is below the predetermined threshold, and

(e) generating, with the computer, an optimized log using a linear integer programming (LIP) optimization process based on the groups of available advertisements, wherein the optimized log comprises an updated schedule for airing the N available advertisements; and

an advertisement trafficking server configured to receive the optimized log from the at least one computer, and configured to move and air the N available advertisements according to the updated schedule of the optimized log.

7. The system of claim 6 , wherein the digital log is one of a list of the available advertisements for the television network publisher or an optimized list of the available advertisements for the television network publisher.

8. The system of claim 6 , wherein the constraint parameters include one at least one of separation constraints, exclusions, and time locks, wherein the viewership predictions are based on a machine learning model, wherein the machine learning model is configured to predict a number of viewers of a certain demographics that will watch a certain program.

9. The system of claim 8 , wherein the advertisement trafficking server is configured to transmit data associated with the moving and airing of the N available advertisements according to the updated schedule of the optimized log to the computer, and wherein the computer is configured to retrain the machine learning model with the transmitted data.

10. The system of claim 6 , wherein the computer is further configured to:

generate a report including a difference of a first revenue associated with the digital log and a second revenue associated with the optimized log.

Assignments (2)
SECURITY INTEREST Recorded Jul 17, 2025
From: KNOWN GLOBAL LLC
To: WHITE OAK ABL 3, LLC
Reel/Frame 071749/0499 →
SECURITY INTEREST Recorded Jun 25, 2025
From: KNOWN GLOBAL LLC
To: ICG DEBT ADMINISTRATION LLC
Reel/Frame 071525/0233 →
Continuity (2)
Provisional Application 63231211 · Aug 9, 2021
Related Publication 20230039776A1 · Feb 9, 2023
References Cited (28)
US 6285995B1 · Abdel-Mottaleb · 2001 [cited by examiner]
US 6839682B1 · Blume · 2005 [cited by examiner]
US 8255948B1 · Black · 2012 [cited by examiner]
US 8554618B1 · Gasch · 2013 [cited by examiner]
US 11227306B2 · Haberman · 2022 [cited by examiner]
US 20020103818A1 · Amberden · 2002 [cited by examiner]
US 20030101024A1 · Adar · 2003 [cited by examiner]
US 20080183554A1 · Westphal · 2008 [cited by examiner]
US 20080249832A1 · Richardson · 2008 [cited by examiner]
US 20090144117A1 · Cavander · 2009 [cited by examiner]
US 20110078013A1 · Baker · 2011 [cited by examiner]
US 20140194208A1 · Splaine · 2014 [cited by examiner]
US 20140214548A1 · Faltings · 2014 [cited by examiner]
US 20150373387A1 · Chaar · 2015 [cited by examiner]
US 20160098760A1 · Keller · 2016 [cited by examiner]
US 20170064395A1 · Chaar · 2017 [cited by examiner]
US 20170220926A1 · Chhabra · 2017 [cited by examiner]
US 20170315767A1 · Rao · 2017 [cited by examiner]
US 20180102938A1 · Yoon · 2018 [cited by examiner]
US 20180349946A1 · Nguyen · 2018 [cited by examiner]
US 20210287761A1 · Camps · 2021 [cited by examiner]
US 20210383425A1 · Hrycay · 2021 [cited by examiner]
US 20220067769A1 · Ranganathan · 2022 [cited by examiner]
EComputer Notes, What is a Distributed Computing System? Definition, Capture date of Dec. 21, 2019 from URL https://ecomputernotes.com/computernetworkingnotes/computer-network/distributed-computing , Internet Archive Wa… [cited by examiner]
MIT, Integer programming, Internet Archive Way Back Machine Capture date of Oct. 5, 2019 from URL: https://web.mit.edu/15.053/www/AMP-Chapter-09.pdf (Year: 2019). [cited by examiner]
Laurenti, A brief history of Graphs, Internet Archive Way Back Machine Capture date of Aug. 14, 2020 from URL: https://interworks.com/blog/nlaurenti/2014/10/20/brief-history-graphs/ (Year: 2020). [cited by examiner]
Vegard Flovik, What is Graph Theory, and why should your care, Aug. 13, 2020, from URL: https://www.linkedin.com/pulse/what-graph-theory-why-should-you-care-vegard-flovik-phd (Year: 2020). [cited by examiner]
Wikipedia, Interger programming, Internet Archive Way Back Machine capture date of Dec. 24, 2019 from URL https://en.wikipedia.org/wiki/Integer_programming (Year: 2019). [cited by examiner]