US2014095255A1PendingUtilityA1
Radio station market analysis
Assignee: CLEAR CHANNEL MAN SERVICES INCPriority: Jan 14, 2010Filed: Dec 9, 2013Published: Apr 3, 2014
Est. expiryJan 14, 2030(~3.5 yrs left)· nominal 20-yr term from priority
G06Q 30/0201G06Q 30/0204G06Q 30/02
61
PatentIndex Score
0
Cited by
0
References
0
Claims
Abstract
A radio station market analysis program extends Cume values for individual stations to multiple stations (for a particular geographic market, a particular demographic, and a particular daypart) according to the formula C=[1−Π i=1,n (1−C i /P)]*P, where n is the number of media stations, P is the population, and C i is each Cume value. Cume values may be provided for a limited set of input dayparts from Arbitron and Nielson, and are translated to an arbitrary daypart. The arbitrary daypart can represent a sum of component dayparts in a proposed advertising schedule. The reach of the proposed advertising schedule can be further computed based on a hyperbolic function of spot count.
Claims
exact text as granted — not AI-modifiedWhat is claimed is:
1 . A computer implemented method comprising:
obtaining input CUME values for each of a plurality of individual radio stations, wherein the input CUME values represent CUME values associated with a limited set of input dayparts, by executing program instructions in a computer system; and translating the input CUME values associated with a plurality of the input dayparts to determine an output CUME value associated with an arbitrary daypart, different from the input dayparts, by executing program instructions in a computer system.
2 . The method of claim 1 , wherein the translating comprises:
identifying a minimal parent daypart, wherein the minimal parent daypart corresponds to the smallest one of the input dayparts that encompasses the arbitrary daypart, by executing program instructions in a computer system; determining at least a first Cume value associated with a maximal input daypart encompassed by the arbitrary daypart, by executing program instructions in a computer system; and determining at least a second Cume value associated with an intersection of the arbitrary daypart and selected input dayparts, by executing program instructions in a computer system.
3 . The method of claim 2 , further comprising:
computing, by executing program instructions in a computer system, an output Cume value for the arbitrary daypart according to the following formula:
C
=
[
1
-
∏
i
=
1
,
n
(
1
-
C
i
P
cumesubstitute
)
]
*
P
cumesubstitute
where n is the number of media stations included in a set of media stations comprising the plurality of individual radio stations, P cumesubstitue is the CUME value of the minimal parent daypart, and C i is each CUME value for an individual media station i.
4 . The method of claim 3 , further comprising:
calculating, by executing program instructions in a computer system, a CUME value for the set of media stations based on the following formula:
C
=
[
1
-
∏
i
=
1
,
n
(
1
-
C
i
P
)
]
*
P
where n is the number of media stations included in the set of media stations, P is the population value, and C i is each CUME value for an individual media station i.
5 . The method of claim 2 , further comprising:
adding the CUME value of the arbitrary daypart to a list, by executing program instructions in a computer system; removing the maximal input daypart from the arbitrary daypart, by executing program instructions in a computer system; adding the Cume value of the intersection to the list, by executing program instructions in a computer system; and removing the intersection from the arbitrary daypart, by executing program instructions in a computer system.
6 . The method of claim 1 , wherein the arbitrary daypart represents a sum of component dayparts in a proposed advertising schedule.
7 . The method of claim 6 , further comprising;
computing, by executing program instructions in a computer system, a reach of the proposed advertising schedule based on an inverse exponential function of spot count.
8 . A computer system comprising:
one or more processors to process program instructions; a memory device coupled to said one or more processors; and program instructions residing in said memory device, said program of instructions configured to implement a method including:
obtaining input CUME values for each of a plurality of individual radio stations, wherein the input CUME values represent CUME values associated with a limited set of input dayparts; and
translating the input CUME values associated with a plurality of the input dayparts to determine an output CUME value associated with an arbitrary daypart, different from the input dayparts.
9 . The computer system of claim 8 , wherein the translating comprises:
identifying a minimal parent daypart, wherein the minimal parent daypart corresponds to the smallest one of the input dayparts that encompasses the arbitrary daypart; determining at least a first Cume value associated with a maximal input daypart encompassed by the arbitrary daypart; and determining at least a second Cume value associated with an intersection of the arbitrary daypart and selected input dayparts.
10 . The computer system of claim 9 , wherein the method includes:
computing an output Cume value for the arbitrary daypart according to the following formula:
C
=
[
1
-
∏
i
=
1
,
n
(
1
-
C
i
P
cumesubstitute
)
]
*
P
cumesubstitute
where n is the number of media stations included in a set of media stations comprising the plurality of individual radio stations, P cumesubstitute is the CUME value of the minimal parent daypart, and C i is each CUME value for an individual media station i.
11 . The computer system of claim 10 , wherein the method includes:
computing a CUME value for the set of media stations based on the following formula:
C
=
[
1
-
∏
i
=
1
,
n
(
1
-
C
i
P
)
]
*
P
where n is the number of media stations included in the set of media stations, P is the population value, and C i is each CUME value for an individual media station i.
12 . The computer system of claim 9 , wherein the method includes:
adding the CUME value of the arbitrary daypart to a list; removing the maximal input daypart from the arbitrary daypart; adding the Cume value of the intersection to the list; and removing the intersection from the arbitrary daypart.
13 . The computer system of claim 8 , wherein the arbitrary daypart represents a sum of component dayparts in a proposed advertising schedule.
14 . The computer system of claim 13 , further comprising;
computing a reach of the proposed advertising schedule based on an inverse exponential function of spot count.
15 . A computer program product comprising:
a non-transitory computer-readable storage medium; and program instructions residing in said medium, said program instructions including:
at least one instruction to obtain input CUME values for each of a plurality of individual radio stations, wherein the input CUME values represent CUME values associated with a limited set of input dayparts; and
at least one instruction to translate the input CUME values associated with a plurality of the input dayparts to determine an output CUME value associated with an arbitrary daypart, different from the input dayparts.
16 . The computer program product of claim 15 , wherein the translating comprises:
at least one instruction to identify a minimal parent daypart, wherein the minimal parent daypart corresponds to the smallest one of the input dayparts that encompasses the arbitrary daypart; at least one instruction to determine at least a first Cume value associated with a maximal input daypart encompassed by the arbitrary daypart; and at least one instruction to determine at least a second Cume value associated with an intersection of the arbitrary daypart and selected input dayparts.
17 . The computer program product of claim 16 , wherein the method includes:
at least one instruction to compute an output Cume value for the arbitrary daypart according to the following formula:
C
=
[
1
-
∏
i
=
1
,
n
(
1
-
C
i
P
cumesubstitute
)
]
*
P
cumesubstitute
where n is the number of media stations included in a set of media stations comprising the plurality of individual radio stations, P cumesubstitue is the CUME value of the minimal parent daypart, and C i is each CUME value for an individual media station i.
18 . The computer program product of claim 17 , wherein the method includes:
at least one instruction to compute a CUME value for the set of media stations based on the following formula:
C
=
[
1
-
∏
i
=
1
,
n
(
1
-
C
i
P
)
]
*
P
where n is the number of media stations included in the set of media stations, P is the population value, and C i is each CUME value for an individual media station i.
19 . The computer program product of claim 16 , wherein the method includes:
at least one instruction to add the CUME value of the arbitrary daypart to a list; at least one instruction to remove the maximal input daypart from the arbitrary daypart; at least one instruction to add the Cume value of the intersection to the list; and at least one instruction to remove the intersection from the arbitrary daypart.
20 . The computer program product of claim 15 , wherein the arbitrary daypart represents a sum of component dayparts in a proposed advertising schedule.Join the waitlist — get patent alerts
Track US2014095255A1 — get alerts on status changes and closely related new filings.
We store only your email — no account needed. See our privacy policy.