GB2473197A - Advert selection using a decision tree - Google Patents

Advert selection using a decision tree Download PDF

Info

Publication number
GB2473197A
GB2473197A GB0915245A GB0915245A GB2473197A GB 2473197 A GB2473197 A GB 2473197A GB 0915245 A GB0915245 A GB 0915245A GB 0915245 A GB0915245 A GB 0915245A GB 2473197 A GB2473197 A GB 2473197A
Authority
GB
United Kingdom
Prior art keywords
tree
decision model
paths
advertisement
advertising
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Withdrawn
Application number
GB0915245A
Other versions
GB0915245D0 (en
Inventor
Tony Leigh
Martin Ahmed
Christopher Martin
Ian Shelton
James Wilson
Simon Dyke
Trevor Whinmill
Matt Spencer
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Synamedia Ltd
Original Assignee
NDS Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by NDS Ltd filed Critical NDS Ltd
Priority to GB0915245A priority Critical patent/GB2473197A/en
Publication of GB0915245D0 publication Critical patent/GB0915245D0/en
Priority to PCT/IB2010/051544 priority patent/WO2011027231A1/en
Priority to AU2010290905A priority patent/AU2010290905B2/en
Priority to EP10717254A priority patent/EP2422308A1/en
Priority to US13/138,984 priority patent/US8656426B2/en
Publication of GB2473197A publication Critical patent/GB2473197A/en
Withdrawn legal-status Critical Current

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q30/00Commerce
    • G06Q30/02Marketing; Price estimation or determination; Fundraising
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q30/00Commerce
    • G06Q30/02Marketing; Price estimation or determination; Fundraising
    • G06Q30/0241Advertisements
    • G06Q30/0251Targeted advertisements
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N21/00Selective content distribution, e.g. interactive television or video on demand [VOD]
    • H04N21/20Servers specifically adapted for the distribution of content, e.g. VOD servers; Operations thereof
    • H04N21/25Management operations performed by the server for facilitating the content distribution or administrating data related to end-users or client devices, e.g. end-user or client device authentication, learning user preferences for recommending movies
    • H04N21/262Content or additional data distribution scheduling, e.g. sending additional data at off-peak times, updating software modules, calculating the carousel transmission frequency, delaying a video stream transmission, generating play-lists
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N21/00Selective content distribution, e.g. interactive television or video on demand [VOD]
    • H04N21/80Generation or processing of content or additional data by content creator independently of the distribution process; Content per se
    • H04N21/81Monomedia components thereof
    • H04N21/812Monomedia components thereof involving advertisement data

Abstract

An advertisement selection and targeting system 10 comprises an advertisement database to receive and store advertisements, a state database to store information related to an end user, a decision model optimisation module to receive a tree-type decision model 38 and optimise the tree-type decision model 38 based on at least some of the information stored in the state database, an advertisement decision module to evaluate the optimised tree-type decision model 38 and select an advertising campaign, and a rendering module i.e. client 14 to render the at least one advertisement of the selected advertising campaign. The server advertisement decision system 28 is responsible for signaling the advertisement opportunities (Fig-2, 34) within a content stream to a play out system 22. An opportunity tag information 24 includes tags that may be used by the advertisers to control the placement of Ads within specific sets of opportunities.

Description

ADVERTISEMENT SELECTION
FIELD OF THE INVENTION
The present invention relates to selecting an advertisement from a selection of advertisements.
BACKGROUND OF THE INVENTION
The following references are believed to represent the state of the art: US Published Patent Application 2004/0056087 of Bonneau, JR., et al.; US Published Patent Application 2007/0011700 of Johnson; US Published Patent Application 2007/0078849 of Slothouber; US Published Patent Application 2008/0191934 of Baker, et al.; US Published Patent Application 2008/026359 1 of de Heer; PCT Published Patent Application WO 01/52541 of NDS Limited; Article entitled "Using data mining to profile TV viewers" by William E. Spangler, Mordechai Gal-Or and Jerrold H. May, in Communications of the ACM, Dec 2003, Vol. 46, No. 12; and Article entitled "Decision Tree Media" from www.DesignTaxi.com Jan 2008.
SUMMARY OF THE INVENTION
The present invention, in certain embodiments thereof, seeks to provide an improved advertisement selection system.
By way of introduction, TV Advertising business models are very flexible with the advertiser typically wishing to control everything about the placement of their advertisement(s). Some of the criteria an advertiser may specify for an advertising campaign include, but are not limited to: the desired target audience (e.g. by location or age or preferences); the number of impressions per day; the minimum spacing between impressions; the type of content that the advertisement may and may not be shown in; other advertisements that should not be placed near to the advertisement; the times of day the advertisement should be shown; and different versions of the advertisement to display in different conditions.
An advertiser may also specify the number of impressions that they wish to receive for a given target audience in a given timeframe and there may be penalties if the publisher is unable to meet the impressions in the given timeframe.
A single content publisher may have many advertising contracts to fulfill in any time period and many possible advertisements that could be shown at any given opportunity. Solving the problem of placing the available advertisements into the available opportunities in such a way as to maximize the revenue for the publisher is typically a computationally expensive operation.
Until now, the above problem has been solved either entirely at the publisher Headend or entirely, with limited scope, at an end-user device.
At the publisher Headend an advertisement decision system operates by examining the schedule of content and opportunities of a publisher and the expected target audience share for each opportunity. An opportunity is an opportunity to advertize, for example, but not limited to, during a commercial break in live or recorded TV or in an electronic program guide (EPG). The advertisement Decision System typically then optimizes the placement of advertisements within the opportunities respecting the restrictions of placement that the advertisers specify on the placement of their advertisements. The advertisements are then broadcasted to all clients as part of the broadcast stream.
As the decision is made globally and without knowledge of any individual client, the placement decisions can only approximate the spacing between, and number of, impressions shown on any client. The advertisement decision system is also unable to change placement decisions when content has been recorded and is played back at a different time to the broadcast.
The concept of introducing a software component, or agent, within an end-user device to make advertising placement decisions is known, but suffers from several drawbacks. In particular, the problem is that as local storage in the client increases and as new inventory (such as EPG and Trick-play advertisements) requiring less storage space and creative effort becomes available, the number of advertisements that the client may have to choose from may be in the hundreds or even thousands. The number of advertisements becomes too great for a resource constrained device such as a set-top box (STB) and for the client agents therein. In addition, the complex and flexible business models which advertisers demand are generally too complex to implement entirely in an end-user device.
In accordance with an embodiment of the present invention, a global optimization is performed at the publisher Headend and a generally much simpler local optimization is performed in the end-user devices.
There is thus provided in accordance with an embodiment of the present invention, an end-user rendering system including an advertisement database to receive advertisements, and store the advertisements therein, a state database to store information including at least one of the following information about the end-user rendering system, information about a display device operationally connected to the end-user rendering system, information about a user of the end-user rendering system, a history of the advertisements previously rendered by the end-user rendering system, a decision model optimization module to receive a tree-type decision model, the tree-type decision model enabling selection of at least one advertising campaign from a plurality of advertising campaigns based on evaluating a collection of targeting criteria, each one of the advertising campaigns having at least one of the targeting criteria which must be fulfilled for the one advertising campaign to be selected, at least some of the advertising campaigns having at least one of the targeting criteria in common, the tree-type decision model including a plurality of paths emerging from a root node via a plurality of decision nodes terminating in a plurality of terminal nodes, the terminal nodes representing the advertising campaigns for selection and the decision nodes representing the targeting criteria so that for each one of the paths, the one path includes the at least one targeting criterion of the one advertising campaign terminating the one path, the at least some advertising campaigns having the at least one targeting criterion in common sharing at least one of the decision nodes, and optimize the tree-type decision model based on at least some of the information stored in the state database such that the paths having at least one of the decision nodes where the targeting criteria are not satisfied when evaluated with the at least some information are removed from the tree-type decision model, an advertisement decision module to evaluate each of the paths of the optimized tree-type decision model by evaluating the targeting criteria of at least one of the decision nodes in a direction from the root node to the terminal nodes, identify the paths where all the targeting criteria are satisfied in the evaluation of the paths, and select an advertising campaign from the advertising campaigns of the terminal nodes of the identified paths, the selected advertising campaign having at least one advertisement, and a rendering module to render the at least one advertisement of the selected advertising campaign.
Further in accordance with an embodiment of the present invention the at least some information evaluated by the decision model optimization module in order to yield the optimized tree-type decision model are static factors which do not change at least until a new tree-type decision model is received.
Still further in accordance with an embodiment of the present invention the decision model optimization module is operative to optimize the tree-type decision model for at least one of the advertising campaigns that has reached a maximum number of impressions by removing the paths including the at least one advertising campaign from the tree-type decision model.
Additionafly in accordance with an embodiment of the present invention each of the paths has a priority-rating, and the advertisement decision module is operative to select the advertising campaign from a highest priority-rating path of the indentified paths.
There is also provided in accordance with still another embodiment of the present invention a method including receiving advertisements, storing the advertisements, storing information including at least one of the following information about an end-user rendering system, information about a display device operationally connected to the end-user rendering system, information about a user of the end-user rendering system, a history of the advertisements previously rendered by the end-user rendering system, receiving a tree-type decision model, the tree-type decision model enabling selection of at least one advertising campaign from a plurality of advertising campaigns based on evaluating a collection of targeting criteria, each one of the advertising campaigns having at least one of the targeting criteria which must be fulfilled for the one advertising campaign to be selected, at least some of the advertising campaigns having at least one of the targeting criteria in common, the tree-type decision model including a plurality of paths emerging from a root node via a plurality of decision nodes terminating in a plurality of terminal nodes, the terminal nodes representing the advertising campaigns for selection and the decision nodes representing the targeting criteria so that for each one of the paths, the one path includes the at least one targeting criterion of the one advertising campaign terminating the one path, the at least some advertising campaigns having the at least one targeting criterion in common sharing at least one of the decision nodes, optimizing the tree-type decision model based on at least some of the stored information such that the paths having at least one of the decision nodes where the targeting criteria are not satisfied when evaluated with the at least some information are removed from the tree-type decision model, evaluating each of the paths of the optimized tree-type decision model by evaluating the targeting criteria of at least one of the decision nodes in a direction from the root node to the terminal nodes, identifying the paths where all the targeting criteria are satisfied in the evaluation of the paths, selecting an advertising campaign from the advertising campaigns of the terminal nodes of the identified paths, the selected advertising campaign having at least one advertisement, rendering the at least one advertisement of the selected advertising campaign.
BRIEF DESCRIPTION OF THE DRAWINGS
The present invention will be understood and appreciated more fully from the following detailed description, taken in conjunction with the drawings in which: Fig. 1 is a partly pictorial, partly block diagram view of an advertisement selection system constructed and operative in accordance with an embodiment of the present invention; Fig. 2 is partly pictorial, partly block diagram view of opportunity tag signaling in the system of Fig. 1; Fig. 3 is a partly pictorial, partly block diagram view of a tree-type decision model for use in the system of Fig. 1; Fig. 4 is a more detailed view of an end-user rendering system in the advertisement selection system of Fig. 1; Fig. 5 is a partly pictorial, partly block diagram view of a first optimization of the free-type decision model of Fig. 3; and Fig. 6 is a partly pictorial, partly block diagram view of a second optimization of the tree-type decision model of Fig. 3.
DETAILED DESCRIPTION OF AN EMBODIMENT
Persons skilled in the art will appreciate that, throughout the present application, a broadcast Headend is used by way of example only, and that the present invention is not limited to a particular type of informationlcontent server but rather includes any suitable device.
Reference is now made to Fig. 1, which is a partly pictorial, partly block diagram view of an advertisement selection system 10 constructed and operative in accordance with an embodiment of the present invention.
The advertisement selection system 10 includes a broadcast Headend 12 and a plurality of end-user rendering systems 14 (only one shown for the sake of clarity). The end-user rendering systems 14 are also referred herein as the clients.
The broadcast Headend 12 includes a decision model generator 20 and a play-out system 22.
The decision model generator 20 and the play-out system 22 receive information from various publishers 18.
Each publisher 18 typically has a server advertisement decision system 28.
Each server advertisement decision system 28 is responsible for supplying details of the advertising campaigns, the targeting of the campaigns, the restrictions on the campaigns and the relative priority of each targeted campaign (block 16) to the decision model generator 20 of the broadcast Headend 12.
The play-out system 22 of the broadcast Headend 12 receives opportunity tag information 24 from the publishers 18. The opportunity tag information 24 is described in more detail with reference to Fig. 2.
The play-out system 22 prepares content, Ads and the opportunity tag information 24 and other signaling (block 26) for broadcast to the end-user rendering systems 14. The other signaling typically includes metadata associated with the content and the broadcast stream in general.
Reference is now made to Fig. 2, which is partly pictoria', partly block diagram view of signaling of opportunity tags 30 in the system 10 of Fig. 1.
Reference is also made to Fig. 1.
Fig. 2 shows two channels, channel 1 and channel 2, and a plurality of programs 32 therein with a plurality of advertising opportunities 34.
The server advertisement decision system 28 is also responsible for signaling the advertisement opportunities 34 within a content stream 36 to the play-out system 22. The opportunity tag information 24 includes tags 30 that may be used by the advertisers to control the placement of Ads within specific sets of opportunities 34.
The opportunity tag 30 is a tag associated with one or more opportunities 34 that the publisher 18 makes available for advertising placement. The tag 30 is used to identify the type, or types, of opportunity 34 that a specific opportunity 34 represents in an advertising context.
By associating the same tag 30 to multiple opportunities 34, the tag 30 groups opportunities 34 of the same type. By associating many different tags 30 to a single opportunity 34, the single opportunity 34 belongs to multiple groups. The tags 30 are generally used by the advertisers to select which opportunities 34 they wish the publisher 18 (Fig. 1) to consider placing the advertisements within.
There may be multiple and heterogeneous server advertisement decision systems 28 used by different publishers 18 who all publish content via the play-out system 22 of the broadcast Headend 12. A single server advertisement decision system 28 may control all of the advertising placed against the opportunity tags that the server advertisement decision system 28 uses. In other words, for a given opportunity 34, the opportunity tag(s) 30 may be from a single server advertisement decision system 28 and so only advertisements from the single server advertisement decision system 28 are considered for placement.
Reference is again made to Fig. 1.
The decision model generator 20 is generally responsible for aggregating all of the advertising campaigns, targeting criteria and priorities from multiple publishers into a logical tree-type decision model 38 that is ultimately interpreted by the end-user rendering systems 14 in order to place the correct advertisement in the correct opportunity 34 (Fig. 2) and context. The logical tree-type decision model 38 is globally optimized by the decision model generator 20.
Each end-user rendering system 14 receives the tree-type decision model 38 and then locally optimizes the tree-type decision model 38 on receipt before being used.
The decision model generator 20 is now described in more detail.
The decision model generator 20 receives a set of advertising campaigns (blockl6) from each server advertisement decision system 28. Each advertising campaign describes the restrictions on placement that the advertiser has specified and the particular advertisement copy to show in different conditions. An example of an advertising campaign with restrictions is shown in
table 1.
Table 1: Advertising campaign Restrictions ACME Deluxe ________________________ This Campaign is of type CAR, ACME Max Impressions 4 per day Minimum Spacing 1 hour Do not show near Campaigns of type CAR, ALCOHOL Rotate between Advertisement Copy Deluxe 1, Deluxe2 The advertising campaigns and restrictions (block 39) are also broadcast to the end-user rendering systems 14 for use in the advertisement decision making, as will be described in more detail with reference to Fig. 6.
The decision model generator 20 also receives, from the server advertisement decision systems 28, at least one set of targeting criteria (block 16) for each advertising campaign. Each set of targeting instructions/criteria is associated with an opportunity tag 30 and is assigned a selection priority. Each set of targeting criteria describes the conditions that need to be satisfied for an advertising campaign to be selected. In other words, each advertising campaign may have different sets of targeting criteria for different opportunity tags with different priorities.
The targeting criteria refer to attributes of a state of the end-user rendering systems 14. Targeting criteria are described in more detail below with reference to Fig. 3.
The priority for a set of targeting criteria is typically the relative priority of selecting one campaign with a particular set of targeting criteria over all other campaigns managed by the server advertisement decision system 28. The calculation of the priority is outside of the scope of the advertisement selection system 10, but may include factors such as the cost per mule (CPM) rate of the campaign, the number of impressions required, the time left to run the campaign and penalty costs for missing the impression targets. The priorities and/or the targeting criteria are typically reviewed and amended on a periodic basis (typically daily) based on feedback from the end-user rendering systems 14 of actual advertisements viewed so that advertisers' viewing requirements may be fulfilled.
Table 2 shows an example of four advertising campaigns that are targeted into two different opportunity tags 30 (Fig. 2) with different targeting criteria and with different priorities. The opportunity tag "ACME Cars" is used for opportunities that ACME Cars have purchased exclusively and the "Premium Content" opportunity tag is used for opportunities in and around shows that the publisher 18 deems to be premium. The targeting refers to two attributes on the client; "RICH" is explicitly set to indicate that the household is a richlwealthy household, and "Motoring Fan" may be either explicitly set, or determined dynamically by the end-user rendering systems 14. The targeting also refers to three attributes that are transient within the end-user rendering systems 14, namely: "First in Ad Break" refers to an opportunity occurring first within an advertisement break of a content item; "Motoring Content" refers to the opportunity occurring within Motoring Content; and "watched finance today" refers to having watched content described as "finance" during the same day that an opportunity is encountered.
It should be noted that the opportunity tags 30 may be viewed as specialized targeting criteria relating to a particular aspect of an opportunity. For example, a set of targeting criteria may include a criterion that an opportunity has a tag of "ACME CARS".
Table 2: Advertising campaign tags, targeting and priority Advertising Opportunity Tag Targeting Priority campaign ___________________ ____________________________ ________ Deluxe ACME Cars Rich & First Ad in Break 20 Deluxe ACME Cars Rich 10 Deluxe Premium Content Rich 30 Deluxe Premium Content Motoring Fan 30 Deluxe Premium Content Motoring Fan, Motoring Content 40 Deluxe Premium Content Motoring Fan, Motoring Content, 70 _____________ ______________________ First Ad in Break _________ Roger Tyres Premium Content Rich 50 Roger Tyres Premium Content Motoring Fan 50 Compact ACME Cars None 10 First Bank Premium Content Rich 60 First Bank Premium Content Rich and watched finance today 90 The first optimization step the Decision Tree Generator takes is to turn the targeting instructions of Table 2 into the tree-type decision model 38 that can be used to locate the correct advertisement campaign to show for a given opportunity and context.
Reference is now made to Fig. 3, which is a partly pictorial, partly block diagram view of the tree-type decision model 38 for use in the system of Fig. 1.
The tree-type decision model 38 enables selection of at least one advertising campaign 40 from a plurality of advertising campaigns 40 based on evaluating a collection of targeting criteria 42 and the opportunity tags 30. As described above with reference to Fig. 1, each advertising campaign 40 has at least one of the targeting criteria 42 which must be fulfilled for the advertising campaign to be selected. Additionally, at least some of the advertising campaigns 40 have at least one targeting criterion 42 in common. For example, "motoring fan" is common to the "ACME Deluxe" campaign and the "Roger Tyres" campaign.
The tree-type decision model 38 includes a plurality of paths 44 emerging from a root node 46 via a plurality of decision nodes 48 terminating in a plurality of terminal nodes 50. The root node 46 represents the publisher 18. The terminal nodes 50 represent the advertising campaigns 40 for selection. The decision nodes represent the targeting criteria 42 and the opportunity tags 30.
Therefore, each path 44 includes the targeting criteria 42 and the opportunity tag 30 of the advertising campaign 40 terminating the path 44.
Each of the paths 44 has a priority-rating 52 (only some of the priority-ratings 52 have been labeled for the sake of clarity).
To find the correct advertising campaign 40 to display, the end-user rendering system 14 (Fig. 1) must evaluate the tree-type decision model 38 considering all the decision nodes 48 that match the advertising opportunity 34 (Fig. 2) being considered, the context and the client state. Any advertising campaign 40 that is found during the evaluation can be considered for display.
Evaluation of the tree-type decision model 38 is described in more detail with reference to Figs. 5 and 6.
By using a tree-type model to hold the targeting criteria 42, the end-user rendering system 14 operating on the tree-type decision model 38 can quickly avoid considering large parts of the tree-type decision model 38 that are not applicable to the current opportunity 34, context and state. For example, if the opportunity tags 30 do not include "ACME Cars" then some of the left hand side of the tree-type decision model 38 can be discounted.
Additionally, in order to optimize the tree-type decision model 38, the advertising campaigns 40 having one or more targeting criteria 42 and7or an opportunity tag 30 in common may share one or more of the decision nodes 48.
For example, the ACME Compact, Roger Tyres and First Bank advertising campaigns all target the "Rich" audience within the opportunity tag "Premium Content". Therefore, the work performed by the end-user rendering systems 14 is reduced as the evaluation of the viewer being in the "Rich" category occurs oniy once.
A further optimization utilized in the tree-type decision model 38 is to separate static targeting criteria 42 from the transient targeting criteria 42.
The static targeting criteria 42 refer to attributes that are not generally going to change from the clients' perspective for the lifetime of the tree-type decision model 38. For example, a client is designated as "Rich" for at least the lifetime of the tree-type decision model 38. The lifetime of the tree-type decision model 38, as used in the specification and claims, is defined herein as the length of time from receipt of the tree-type decision model 38 by the end-user rendering systems 14 until a new tree-type decision model 38 is received by the end-user rendering systems 14. Since advertising decisions change frequently, typically daily, and hence a new tree-type decision model 38 is delivered this is a reasonable assumption to make.
The transient targeting criteria 42 refer to attributes that are dynamic from the clients' perspective and may be true or false for different opportunities in different contexts. For example, the viewer may or may not have viewed content with a genre of "finance" today when an opportunity is presented.
Examples of static, or near-static targeting include, but are not limited to: location (e.g.: north, south); demographic (e.g.: rich, educated, employed, retired); family status (e.g.: married, kids, divorced, single); spending habits (e.g.: spends a certain amount weekly at the supermarket and e.g.: the kind of data that can be purchased from data mining agencies); subscription tier (e.g.: sports, movies, everything); watches lots of a certain type of content (e.g.: sports, movies, documentaries, news, finance); watches at certain times of day (e.g.: late home from work, stay at home mother, light viewer); age band (elderly, middle aged, young); and time of year/season (e.g.: summer, winter).
Examples of transient targeting include, but are not limited to: time of day, day of week (e.g.: weekday, weekend); type of content viewed (e.g.: genre, channel, series, episode); slot position (e.g.: first or last in commercial break, first break in show); slot occurrence (e.g.: first seen on this channel today, on channel change into channel); length of time watching TV (e.g.: just turned on, been watching for hours); recently watched content (e.g.: just watched the news / kids TV); type of viewing (e.g.: live, time-shifted, recorded, pull VOD, Push VOD; who is watching now; and how many people are watching now. The recently watched TV targeting may be useful when advertisers want to attempt to target an individual and not just anyone in the household.
Reference is now made to Fig. 4, which is a more detailed view of one of the end-user rendering systems 14 in the advertisement selection system 10 of Fig. 1.
The end-user rendering systems 14 may be selected from any suitable end-user rendering device, for example, but not limited to, an STB or a suitably configured computer and/or a mobile device such as a mobile telephone or television or PDA, for example only.
The end-user rendering system 14 typically includes an advertisement database 54, a rendering module 56, an advertisement decision module 58, a decision model optimization module 60 and a state database 62.
The advertisement database 54 is operative to: receive a plurality of advertisements 64 from the broadcast Headend 12; and store the advertisements 64 in the advertisement database 54.
The state database 62 is operative to store information including at least one of the following: information about the end-user rendering system 14 (e.g.: is the household rich); information about a display device 66 operationally connected to the end-user rendering system 14 (e.g.: is the display device HD or SD); information about a user of the end-user rendering system (e.g.: is the user a motoring fan); a history of the advertisements or content previously rendered by the end-user rendering system (e.g.: was finance watched today, when was the ACME Deluxe advertising campaign last displayed, how many times was the ACME Deluxe advertising campaign shown today). The state database 62 also receives the advertising campaign details and restrictions (block 39) from the broadcast Headend 12 for storing in the state database 62 50 that the restrictions may be applied as required, for example, the maximum number of allowed impressions per day.
The decision model optimization module 60 is operative to receive the tree-type decision model 38 from the broadcast Headend 12 and optimize the tree-type decision model 38 as will be described in further detail with reference to Figs. 5 and 6.
The advertisement decision module 58 is operative to select one of the advertising campaigns 40 based on evaluation of the optimized tree-type decision model 38 and data from the state database 62 as will be described in further detail with reference to Figs. 5 and 6.
The rendering module 56 is operative to render received content 70 as well as the advertisements 64 as will be described in more detail with reference to Fig. 5.
Reference is now made to Fig. 5, which is a partly pictorial, partly block diagram view of a first optimization of the tree-type decision model 38 of Fig. 3. Reference is also made to Fig. 4.
By separating the static targeting criteria 42 from the transient targeting criteria 42 in the tree-type decision model 38 at the broadcast Headend 12, it is generally easier for the end-user rendering system 14 to pre-process and optimize the tree-type decision model 38 when the tree-type decision model 38 is acquired.
The decision model optimization module 60 is typically operative to optimize the tree-type decision model 38 based on particular information stored in the state database 62 such that the paths 44 having one or more decision nodes 48 where the targeting criteria 42 are not satisfied when evaluated with the particular information are removed from the tree-type decision model 38. Removing the paths 44 which are no longer relevant typically simplifies the tree-type decision model 38 and generally makes evaluation of the tree-type decision model 38 less computationally intensive.
It will be appreciated that the tree-type decision model 38 is not optimized for all the targeting criteria 42. Generally, the tree-type decision model 38 is optimized for the static targeting criteria 42 50 that the particular information retrieved from the state database 62 and evaluated by the decision model optimization module 60 in order to yield the optimized tree-type decision model 38 are static factors which do not change at least until a new tree-type decision model 38 is received from the broadcast Headend 12. In other words, the static factors do not generally change for the lifetime of the current tree-type decision model 38 as described above with reference to Fig. 3.
Fig. 5 shows that the tree-type decision model 38 of Fig. 3 has been optimized based on static factors of the end-user rendering system 14 in question.
The static factors indicate that at least one of the users of the end-user rendering system 14 is a "motoring fan" and the household of the end-user rendering system 14 is not classified as "Rich". Therefore, the optimized tree-type decision model 38 of Fig. 5 does not include any paths 44 including decision nodes 48 for the targeting criteria 42 of "Rich".
The tree-type decision model 38 may also be optimized for unavailable advertising campaigns described in more detail with reference to Fig. 6.
The above optimization step means that if one or more of the static targeting criteria 42 changes on the client (the end-user rendering system 14) then the tree-type decision model 38 will need to be regenerated for the change to take effect. The decision model optimization module 60 may regenerate the tree-type decision model 38 automatically or may wait for the next tree-type decision model 38 to become available from the broadcast Headend 12. The decision of whether the decision model optimization module 60 may regenerate the tree-type decision model 38 is typically controlled by the Broadcast Headend 12 which may choose to allow the publisher 18 to make the decision.
The lifetime of the tree-type decision model 38 is typically controlled by the server advertisement decision system 28 (Fig. 1). Typically, when the advertising campaigns, targeting, restrictions or priorities change then a new tree-type decision model 38 is generated and distributed to all the end-user rendering systems 14. Although the lifetime of any tree-type decision model 38 is typically controlled by the server advertisement decision system 28 (Fig. 1), a minimum propagation delay of the system 10 is enforced by the decision model generator 20 of the broadcast Headend 12 (Fig. 1). For example, the targeting may change many times within a few minutes, but the decision model generator 20 may generate a new tree only once an hour, for example, incorporating the latest information at the time. Alternatively the server advertisement decision system 28 may send all of the changes to the decision model generator 20, but hold the generation of a new tree-type decision model 38 until a trigger is sent from the server advertisement decision system 28 to the decision model generator 20.
Evaluation of the optimized tree-type decision model 38 is now described in more detail.
The advertisement decision module 58 is operative to evaluate each path 44 of the optimized tree-type decision model 38 by evaluating the targeting criteria 42 of at least one of the decision nodes 48 in a direction from the root node 46 to the terminal nodes 50 for a particular advertising opportunity. The reason all the decision nodes 48 may not need to be checked in the path 44 is that if during evaluation of each path 44, one decision node 48 in the path 44 is not satisfied then there is no need to continue checking down the rest of the path 44.
One of the differences between the tree-type decision model 38 and a "standard" decision tree is that evaluation of any decision node of a standard decision tree leads to continuing along only one path following the decision node which was evaluated, whereas in the tree-type decision model 38 the evaluation of one of the decision nodes 48 either leads to continuing along all the paths 44 below the decision node 48 if the evaluation of the decision node 44 is satisfied or none of the paths 44 if the decision node 48 is not satisfied. Additionally, a "standard" decision tree typically has at least two paths following each decision node whereas the tree-type decision model 38 may have one or more paths following each of the decision nodes 48. The term "is satisfied", as used in the specification and claims, is defined herein as, when the decision node 48 is evaluated the criterion of the node is ftilfilled.
In the example of Fig. 5, the opportunity tag 30 of the particular advertising opportunity 34 (Fig. 2) under consideration is for "Premium Content".
Therefore, the path 44 including "ACME Cars" is not considered any further.
The advertisement decision module 58 is then operative to identify the paths 44 where all the targeting criteria 42 are satisfied in the evaluation of the paths 44. The identified paths 44 terminate in possible advertising campaigns 40 for display. The identified advertising campaigns 40 are now considered.
In the example of Fig. 5, the particular advertising opportunity 34 is during "motoring content" and is the second advertisement in the break. Therefore, the path 44 including "first ad in Break" is not considered fttrther. Therefore, the paths 44 with the thicker lines shown in Fig. S are identified as paths for fttrther consideration.
The advertisement decision module 58 is operative to select an advertising campaign 72 from the advertising campaigns 40 represented by the terminal nodes 50 of the identified paths 44. Typically, the advertisement decision module 58 is operative to select the advertising campaign 72 from a highest priority-rating path 76 of the identified paths 44. The selected advertising campaign 72 may have one or more advertisements 74 for displaying.
In the example of Fig. 5, the advertising campaign 40 of "Roger Tyres" has the highest priority of 50' from the identified paths 44. Therefore, the advertising campaign 40 of "Roger Tyres" is selected for the current advertising opportunity 34.
The advertisement selection system 10 for selecting advertisements is not limited to selecting advertisements for showing within the main video stream content. The advertisement selection system 10 is also usefttl for selecting advertisements for other advertising opportunities, for example, but not limited to, within the electronic program guide (EPG), overlaying the video, trick modes, and channel change. Additionally or alternatively, the advertisement may be any suitable format, for example, but not limited to, a video format, a non-video format such as static or animated images or text.
The rendering module 56 is operative to render one of the advertisements 74 of the selected advertising campaign 72 on the display device 66.
Reference is now made to Fig. 6, which is a partly pictorial, partly block diagram view of a second optimization of the tree-type decision model 38 of Fig. 3. Reference is also made to Fig. 4.
A further optimization that the decision model optimization module 60 can perform is to remove any advertising campaign(s) 40 from the tree-type decision model 38 that are not for display. An advertising campaign 40 may not be able to be displayed because the advertising campaign 40 has not yet been acquired by the end-user rendering system 14 or because the advertising campaign 40 has already met the maximum number of impressions, by way of example only. The number of impressions of an advertising campaign 40 and the maximum number of allowed impressions are typically stored in the state database 62.
Therefore, the decision model optimization module 60 is typically operative to optimize the tree-type decision model 38 for one or more unavailable advertising campaigns 40 that have reached a maximum number of impressions, by removing the paths 44 including the unavailable advertising campaign(s) from the tree-type decision model 38.
Fig. 6 shows that the tree-type decision model 38 of Fig. 3 has been optimized based on removing an unavailable advertising campaign 40, namely the "ACME Deluxe" advertising campaign. Therefore, the optimized tree-type decision model 38 of Fig. 6 does not include any paths 44 tenTriinating with the "ACME Deluxe" advertising campaign.
In the example of Fig. 6, the opportunity tag 30 of the particular advertising opportunity 34 (Fig. 2) under consideration is for "Premium Content".
Therefore, the path 44 including "ACME Cars" is not considered any further.
In the example of Fig. 6, the user(s) of the end-user rendering system 14 have "watched finance today". Therefore, all the paths 44 under "premium content" are identified for further consideration. The advertising campaign 40 (namely, "First Bank") tenrninating the path 44 with the highest priority of 90' is therefore selected for display by the advertisement decision module 58.
It is appreciated that software components of the present invention may, if desired, be implemented in ROM (read only memory) form. The software components may, generally, be implemented in hardware, if desired, using conventional techniques. It is further appreciated that the software components may be instantiated, for example, as a computer program product; on a tangible medium; or as a signal interpretable by an appropriate computer.
It will be appreciated that various features of the invention which are, for clarity, described in the contexts of separate embodiments may also be provided in combination in a single embodiment. Conversely, various features of the invention which are, for brevity, described in the context of a single embodiment may also be provided separately or in any suitable sub-combination.
It will be appreciated by persons skilled in the art that the present invention is not limited by what has been particularly shown and described hereinabove. Rather the scope of the invention is defined by the appended claims and equiva'ents thereof.

Claims (9)

  1. What is claimed is:CLAIMS1. An end-user rendering system comprising: an advertisement database to: receive advertisements; and store the advertisements therein; a state database to store information including at least one of the following: information about the end-user rendering system, information about a display device operationally connected to the end-user rendering system, information about a user of the end-user rendering system, a history of the advertisements previously rendered by the end-user rendering system; a decision model optimization module to: receive a tree-type decision model, the tree-type decision model enabling selection of at least one advertising campaign from a plurality of advertising campaigns based on evaluating a collection of targeting criteria, each one of the advertising campaigns having at least one of the targeting criteria which must be fulfilled for the one advertising campaign to be selected, at least some of the advertising campaigns having at least one of the targeting criteria in common, the tree-type decision model including a plurality of paths emerging from a root node via a plurality of decision nodes terminating in a plurality of terminal nodes, the terminal nodes representing the advertising campaigns for selection and the decision nodes representing the targeting criteria so that for each one of the paths, the one path includes the at least one targeting criterion of the one advertising campaign terminating the one path, the at least some advertising campaigns having the at least one targeting criterion in common sharing at least one of the decision nodes; and optimize the tree-type decision model based on at least some of the information stored in the state database such that the paths having at least one of the decision nodes where the targeting criteria are not satisfied when evaluated with the at least some information are removed from the tree-type decision model; an advertisement decision module to: evaluate each of the paths of the optimized tree-type decision model by evaluating the targeting criteria of at least one of the decision nodes in a direction from the root node to the terminal nodes; identify the paths where all the targeting criteria are satisfied in the evaluation of the paths; and select an advertising campaign from the advertising campaigns of the terminal nodes of the identified paths, the selected advertising campaign having at least one advertisement; and a rendering module to render the at least one advertisement of the selected advertising campaign.
  2. 2. The system according to claim 1, wherein the at least some information evaluated by the decision model optimization module in order to yield the optimized tree-type decision model are static factors which do not change at least until a new tree-type decision model is received.
  3. 3. The system according to claim 1 or claim 2, wherein the decision model optimization module is operative to optimize the tree-type decision model for at least one of the advertising campaigns that has reached a maximum number of impressions by removing the paths including the at least one advertising campaign from the tree-type decision model.
  4. 4. The system according to any of claims 1-3, wherein: each of the paths has a priority-rating; and the advertisement decision module is operative to select the advertising campaign from a highest priority-rating path of the indentified paths.
  5. 5. A method comprising: receiving advertisements; storing the advertisements; storing information including at least one of the following: information about an end-user rendering system, information about a display device operationally connected to the end-user rendering system, information about a user of the end-user rendering system, a history of the advertisements previously rendered by the end-user rendering system; receiving a tree-type decision model, the tree-type decision model enabling selection of at least one advertising campaign from a plurality of advertising campaigns based on evaluating a collection of targeting criteria, each one of the advertising campaigns having at least one of the targeting criteria which must be fulfilled for the one advertising campaign to be selected, at least some of the advertising campaigns having at least one of the targeting criteria in common, the tree-type decision model including a plurality of paths emerging from a root node via a plurality of decision nodes tenTninating in a plurality of terminal nodes, the terminal nodes representing the advertising campaigns for selection and the decision nodes representing the targeting criteria so that for each one of the paths, the one path includes the at least one targeting criterion of the one advertising campaign terminating the one path, the at least some advertising campaigns having the at least one targeting criterion in common sharing at least one of the decision nodes; optimizing the tree-type decision model based on at least some of the stored information such that the paths having at least one of the decision nodes where the targeting criteria are not satisfied when evaluated with the at least some information are removed from the tree-type decision model; evaluating each of the paths of the optimized tree-type decision model by evaluating the targeting criteria of at least one of the decision nodes in a direction from the root node to the terminal nodes; identifying the paths where all the targeting criteria are satisfied in the evaluation of the paths; selecting an advertising campaign from the advertising campaigns of the terminal nodes of the identified paths, the selected advertising campaign having at least one advertisement; rendering the at least one advertisement of the selected advertising campaign.
  6. 6. Apparatus as substantially described hereinabove.
  7. 7. Apparatus as substantially shown in the drawings.
  8. 8. A method as substantially described hereinabove.
  9. 9. A method as substantially shown in the drawings.
GB0915245A 2009-09-02 2009-09-02 Advert selection using a decision tree Withdrawn GB2473197A (en)

Priority Applications (5)

Application Number Priority Date Filing Date Title
GB0915245A GB2473197A (en) 2009-09-02 2009-09-02 Advert selection using a decision tree
PCT/IB2010/051544 WO2011027231A1 (en) 2009-09-02 2010-04-12 Advertisement selection
AU2010290905A AU2010290905B2 (en) 2009-09-02 2010-04-12 Advertisement selection
EP10717254A EP2422308A1 (en) 2009-09-02 2010-04-12 Advertisement selection
US13/138,984 US8656426B2 (en) 2009-09-02 2010-04-12 Advertisement selection

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
GB0915245A GB2473197A (en) 2009-09-02 2009-09-02 Advert selection using a decision tree

Publications (2)

Publication Number Publication Date
GB0915245D0 GB0915245D0 (en) 2009-10-07
GB2473197A true GB2473197A (en) 2011-03-09

Family

ID=41203011

Family Applications (1)

Application Number Title Priority Date Filing Date
GB0915245A Withdrawn GB2473197A (en) 2009-09-02 2009-09-02 Advert selection using a decision tree

Country Status (5)

Country Link
US (1) US8656426B2 (en)
EP (1) EP2422308A1 (en)
AU (1) AU2010290905B2 (en)
GB (1) GB2473197A (en)
WO (1) WO2011027231A1 (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107977865A (en) * 2017-12-07 2018-05-01 畅捷通信息技术股份有限公司 Advertisement sending method, device, computer equipment and readable storage medium storing program for executing

Families Citing this family (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9438957B2 (en) * 2012-02-15 2016-09-06 Thomson Licensing Targeted advertising
US10180978B2 (en) * 2015-03-19 2019-01-15 Sap Se Interface providing decision support in complex problem environment
US10679256B2 (en) 2015-06-25 2020-06-09 Pandora Media, Llc Relating acoustic features to musicological features for selecting audio with similar musical characteristics
US10735795B2 (en) * 2017-01-11 2020-08-04 Invidi Technologies Corporation Managing addressable asset campaigns across multiple devices
US11595724B2 (en) * 2020-05-28 2023-02-28 Dish Network L.L.C. Systems and methods for selecting and restricting playing of media assets stored on a digital video recorder
US11425459B2 (en) 2020-05-28 2022-08-23 Dish Network L.L.C. Systems and methods to generate guaranteed advertisement impressions
US11838596B2 (en) 2020-05-28 2023-12-05 Dish Network L.L.C. Systems and methods for overlaying media assets stored on a digital video recorder on a menu or guide
US11606599B2 (en) 2020-06-10 2023-03-14 Dish Network, L.L.C. Systems and methods for playing media assets stored on a digital video recorder
US11523172B2 (en) 2020-06-24 2022-12-06 Dish Network L.L.C. Systems and methods for using metadata to play media assets stored on a digital video recorder

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20040044569A1 (en) * 2002-08-30 2004-03-04 Roberts William Anthony Systems and method for providing targeted message in a media player
US20070078849A1 (en) * 2005-08-19 2007-04-05 Slothouber Louis P System and method for recommending items of interest to a user
US20090199107A1 (en) * 2008-02-01 2009-08-06 Lewis Robert C Platform for mobile advertising and persistent microtargeting of promotions

Family Cites Families (40)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6460036B1 (en) 1994-11-29 2002-10-01 Pinpoint Incorporated System and method for providing customized electronic newspapers and target advertisements
US5799279A (en) 1995-11-13 1998-08-25 Dragon Systems, Inc. Continuous speech recognition of text and commands
US5822730A (en) 1996-08-22 1998-10-13 Dragon Systems, Inc. Lexical tree pre-filtering in speech recognition
DE69819301D1 (en) 1998-05-01 2003-12-04 Hewlett Packard Co Procedure for managing dynamic decision trees
US6240411B1 (en) 1998-06-15 2001-05-29 Exchange Applications, Inc. Integrating campaign management and data mining
US6230199B1 (en) * 1999-10-29 2001-05-08 Mcafee.Com, Inc. Active marketing based on client computer configurations
US6727914B1 (en) 1999-12-17 2004-04-27 Koninklijke Philips Electronics N.V. Method and apparatus for recommending television programming using decision trees
EP1169858A1 (en) 2000-01-14 2002-01-09 NDS Limited Advertisements in an end-user controlled playback environment
US7389497B1 (en) 2000-07-06 2008-06-17 International Business Machines Corporation Method and system for tracing profiling information using per thread metric variables with reused kernel threads
JP2002157268A (en) 2000-11-22 2002-05-31 Fujitsu Ltd Method and system for announcing article information
US20030139963A1 (en) * 2000-12-08 2003-07-24 Chickering D. Maxwell Decision theoretic approach to targeted solicitation by maximizing expected profit increases
US8571933B2 (en) * 2000-12-27 2013-10-29 The Directv Group, Inc. Advertisements in a television recordation system
US7246102B2 (en) 2001-12-21 2007-07-17 Agere Systems Inc. Method of improving the lookup performance of three-type knowledge base searches
IL162670A0 (en) 2001-12-25 2005-11-20 Dentsu Inc Information distribution system and method, program realizing the method, and information medium concerning the program
US6717950B2 (en) 2002-01-20 2004-04-06 General Instrument Corporation Method and apparatus for priority-based load balancing for use in an extended local area network
US20030154128A1 (en) * 2002-02-11 2003-08-14 Liga Kevin M. Communicating and displaying an advertisement using a personal video recorder
US7092452B2 (en) 2002-03-25 2006-08-15 Bae Systems Information And Electronic Systems Integration Inc Co-channel interference receiver
US7306143B2 (en) 2002-09-20 2007-12-11 Cubic Corporation Dynamic smart card/media imaging
US20040172650A1 (en) 2003-02-28 2004-09-02 Hawkins William J. Targeted content delivery system in an interactive television network
GB0307763D0 (en) 2003-04-04 2003-05-07 Zap Corp Uk The Ltd System and method of broadcasting advertisements
FI118062B (en) 2003-04-30 2007-06-15 Nokia Corp Decision tree with a sparse memory
FR2856820B1 (en) * 2003-06-27 2005-09-30 Axel Buendia SYSTEM FOR DESIGNING AND USING DECISION MODELS
US20060242180A1 (en) * 2003-07-23 2006-10-26 Graf James A Extracting data from semi-structured text documents
US20080288889A1 (en) * 2004-02-20 2008-11-20 Herbert Dennis Hunt Data visualization application
KR20070083530A (en) 2004-07-30 2007-08-24 닐슨 미디어 리서치 인코퍼레이티드 Methods and apparatus for improving the accuracy and reach of electronic media exposure measurement systems
WO2006043012A1 (en) * 2004-10-22 2006-04-27 New Technology/Enterprise Limited Data processing system and method
CN101180875B (en) * 2005-01-12 2010-11-03 英维迪技术公司 Targeted impression model for broadcast network asset delivery
US20060288362A1 (en) 2005-06-16 2006-12-21 Pulton Theodore R Jr Technique for providing advertisements over a communications network delivering interactive narratives
US20080052219A1 (en) 2006-03-31 2008-02-28 Combinenet, Inc. System for and method of expressive auctions of user events
EP2057843A1 (en) * 2006-08-31 2009-05-13 International Business Machines Corporation Personalized advertising in mobile television
US10387891B2 (en) * 2006-10-17 2019-08-20 Oath Inc. Method and system for selecting and presenting web advertisements in a full-screen cinematic view
US20080263591A1 (en) 2007-04-23 2008-10-23 Microsoft Corporation Content viewing session
US20090048907A1 (en) * 2007-08-13 2009-02-19 Universal Passage, Inc. Method and system for advertising and data mining as a part of a marketing and sales program for universal critical life stage decision support
US20090094160A1 (en) 2007-10-09 2009-04-09 Webster Kurt F Portable digital content device and methods for use therewith
US9203911B2 (en) 2007-11-14 2015-12-01 Qualcomm Incorporated Method and system for using a cache miss state match indicator to determine user suitability of targeted content messages in a mobile environment
EP2120192A1 (en) 2008-05-13 2009-11-18 Sap Ag Method and system for supporting a decision-making process
US8793249B2 (en) * 2008-09-24 2014-07-29 Yahoo! Inc. Optimization filters for user generated content searches
KR20130009754A (en) * 2010-02-01 2013-01-23 점프탭, 인크. Integrated advertising system
EP2727065A4 (en) * 2011-07-01 2015-01-28 Dataxu Inc Creation and usage of synthetic user identifiers within an advertisement placement facility
US9877054B2 (en) * 2012-02-22 2018-01-23 Imagine Communications Corp. Dynamic scheduling for advanced advertising in linear television

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20040044569A1 (en) * 2002-08-30 2004-03-04 Roberts William Anthony Systems and method for providing targeted message in a media player
US20070078849A1 (en) * 2005-08-19 2007-04-05 Slothouber Louis P System and method for recommending items of interest to a user
US20090199107A1 (en) * 2008-02-01 2009-08-06 Lewis Robert C Platform for mobile advertising and persistent microtargeting of promotions

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107977865A (en) * 2017-12-07 2018-05-01 畅捷通信息技术股份有限公司 Advertisement sending method, device, computer equipment and readable storage medium storing program for executing

Also Published As

Publication number Publication date
AU2010290905B2 (en) 2014-03-27
WO2011027231A1 (en) 2011-03-10
AU2010290905A2 (en) 2012-02-02
US8656426B2 (en) 2014-02-18
AU2010290905A1 (en) 2011-12-15
US20120072282A1 (en) 2012-03-22
GB0915245D0 (en) 2009-10-07
EP2422308A1 (en) 2012-02-29

Similar Documents

Publication Publication Date Title
AU2010290905B2 (en) Advertisement selection
US11122316B2 (en) Methods and apparatus for targeted secondary content insertion
JP5922724B2 (en) Targeted impression model for broadcasting network asset delivery
US8935721B2 (en) Methods and apparatus for classifying an audience in a content distribution network
US9154824B2 (en) System for content delivery
US10499117B2 (en) Customized variable television advertising generated from a television advertising template
CA2654869C (en) System and method for inserting media based on keyword search
US8544048B2 (en) System for content delivery
US20080195468A1 (en) Rule-Based Contiguous Selection and Insertion of Advertising
US20020123928A1 (en) Targeting ads to subscribers based on privacy-protected subscriber profiles
US20120278161A1 (en) Co-Mingling System for Delivery of Advertising and Corresponding Methods
US11265611B2 (en) Campaign modification for content on demand asset insertion
US20080243583A1 (en) Method and system for dynamic scheduling of content delivery
WO2002013112A1 (en) Targeting ads to subscribers based on privacy-protected subscriber profiles
JP5540050B2 (en) Control table creation apparatus, method, and program
JP5414260B2 (en) Advertisement server, advertisement data distribution method, control information creation device, control information creation method, program, and advertisement system
WO2002030112A1 (en) Targeting ads in ipgs, live programming and recorded programming, and coordinating the ads therebetween
WO2000049805A1 (en) System and method for distributing promotional messages over a communications network

Legal Events

Date Code Title Description
WAP Application withdrawn, taken to be withdrawn or refused ** after publication under section 16(1)