Advertisement scheduling

Information

  • Patent Grant
  • 8417226
  • Patent Number
    8,417,226
  • Date Filed
    Wednesday, January 9, 2008
    16 years ago
  • Date Issued
    Tuesday, April 9, 2013
    11 years ago
Abstract
Embodiments of the invention are concerned with a method and a system for scheduling the transmission of messages to a subscriber in a communications network on basis of communications events that are determined to have occurred from communications events generated by the communications network. The method includes identifying a communications event as one of a plurality of predetermined types of communications events on the basis of at least one said identified current or previous communications session, and, responsive to the identified communications event, triggering a scheduling process for scheduling transmission of a message to the subscriber, in which the scheduling process is dependent on the type of communications event.
Description
CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a U.S. National Stage Patent Application that relies for priority under 35 U.S.C. 371 on International Application No. PCT/EP2008/050208 filed on Jan. 9, 2008, which claims priority under 35 U.S.C. 119 to United Kingdom Patent Application No. 0716001.3 filed Aug. 16, 2007, and United Kingdom Patent Application No. 0700340.3 filed Jan. 9, 2007, all of which are incorporated herein by reference in their entirety.


FIELD OF THE INVENTION

The present invention relates to scheduling the transmission of messages to a subscriber in a communications network, and is particularly, but not exclusively, suited to the transmission of unsolicited messages in a mobile network.


BACKGROUND OF THE INVENTION

The transmission of messages to mobile devices is a widely used and popular service, and the major messaging types in the GSM network (Global System for Mobile Communications) are the Short Message Service (SMS) and the Multimedia Message Service (MMS). The messages are typically sent from and received by a user terminal such as mobile phone or Personal Digital Assistant (PDA). Mobile communication networks can also be used to send and receive other type of messages including electronic mail messages, voice messages, video messages, and picture messages.


Mobile marketing is widely considered by advertisers to be a significant channel for providing access to a consumer due to the fact that a mobile terminal is personal, it is “always on”, and, by virtue of collaborative communications, is implicitly a member of one or more groups. These characteristics, when combined with the social networks-based marketing approach of the Internet, are seen as having the potential to form a very powerful marketing base.


Today's mobile marketing is largely based on push campaigns that are designed to opt-in a consumer, or pull campaigns that acquire mobile phone numbers from consumers. The most typical example of the pull campaign is the “text-to-win” campaign, where e.g., a soft drink bottle contains a short code and a number, and the mobile user sends the code via a text message to the number. In return, the consumer receives a notification if they have won; irrespective of the winning status, the consumer also receives selected marketing messages or a series of messages that are broadcast to the mobile terminal. Another popular method is direct advertisement, which is typically performed using text and picture messaging.


A problem with these approaches is that they do not take account of the user's activities at the time of sending the promotional message. As a result a message can be sent at a time that is inconvenient for the user, causing the recipient to ignore and delete this and any subsequently received such messages; as a result the marketing efforts are completely wasted. U.S. Pat. No. 6,889,054 describes providing a user with the means for explicitly specifying times at which they are willing to receive promotional messages, this then being used to compile an advertisement schedule for pushing advertisements to the user. However, a problem with this approach is that it is relatively burdensome on the user, since, if the schedule is to capture appropriate times to send messages based on the user's activities, the schedule requires detailed input from the user.


SUMMARY OF THE INVENTION

In accordance with one aspect of the present invention, there is provided a method of, and system for, scheduling transmission of messages to a subscriber in a communications network according to the appended claims.


In one arrangement of an embodiment of the invention the method comprises:


monitoring communications events associated with a subscriber so as to identify a communications event as one of a plurality of predetermined types of communications events; and


responsive to the identified communications event, triggering a scheduling process for scheduling transmission of a message to the subscriber,


in which the scheduling process is dependent on the type of communications event.


Thus in embodiments of the invention, the transmission of messages is determined on the basis of communications events associated with the subscriber; typical communications events include making calls, sending messages, switching off, switching on, roaming, cell to cell handover, answering calls, and trends relating thereto. The method can include reviewing the communications events so as to identify likely actions and availability of the subscriber, and using this information to ensure that messages are received by a subscriber at a time that is convenient to their actions and availability.


In at least some arrangements the transmission of messages is determined on the basis of completed communications events, as can be established from sources such as a Home Location Register (to access network registration information), and/or a billing system (to access Call Detail Records), and/or a database storing data indicating usage of unlicensed network resources, and/or request messages sent directly from the subscriber.


The method can include selecting one or more scheduling rules on the basis of the identified communications event(s) and processing the or each selected rule on the basis thereof so as to create a schedule for use in message transmission. The scheduling rules can be dependent on any one or some of: the time of the monitored communications event; previously observed actions taken by the subscriber in response to previously transmitted messages; subscriber-specified data comprising time slots for message transmission; actions taken by elected subscribers different to the subscriber; and/or availability of network resources.


The format for the message can be selected on the basis of subscriber preferences and/or previously observed actions taken by the subscriber in response to previously transmitted messages. This aspect of the invention could be useful when the messages are promotional messages, since the objective is to maximise the probability of the subscriber paying attention, and responding to, the message.


Most conveniently the content of the message can be selected from a content storage system arranged to hold content data items and data identifying characteristics thereof. The selection process can involve correlating preferences indicated by the subscriber in relation to subject matter of interest with the characteristics of said stored content data items.


Further features and advantages of the invention will become apparent from the following description of preferred embodiments of the invention, given by way of example only, which is made with reference to the accompanying drawings.





BRIEF DESCRIPTION OF THE DRAWINGS


FIG. 1 is a schematic block diagram showing a data messaging system arranged to support embodiments of the invention;



FIG. 2 is a schematic block diagram showing components of a scheduling system shown in FIG. 1;



FIG. 3 is a timing diagram showing interactions between components of the data messaging system shown in FIG. 1; and



FIG. 4 is a schematic flow diagram showing steps performed by certain components of the scheduling system shown in FIG. 2.





DETAILED DESCRIPTION OF THE INVENTION

Embodiments of the invention are concerned with monitoring communication sessions and using temporal information relating thereto in order to schedule transmission of messages. The nature of the scheduling and the criteria relating thereto is described in detail later, but first a description of the infrastructure needed to support embodiments of the invention will be presented.



FIG. 1 shows an example of a data messaging system 1 within which embodiments of the invention operate for the example of the scheduling of short message service messages (SMS); it will be appreciated that other message types, such as multimedia message service (MMS), email messages, bespoke messages in the form of GPRS data and/or streamed data and voice messages and/or streamed or downloaded video and voice messages, can alternatively be scheduled according to embodiments of the invention, and that the specific arrangement of the data messaging system 1 is dependent on the type of message being transmitted.


In the arrangement shown in FIG. 1, a terminal 2 communicates with various network devices within the data messaging system 1 via the mobile network 6, which comprises: a conventional radio and switching network comprising base stations; switches (not shown) arranged in a conventional manner; and a home location register (HLR) for maintaining data relating to subscribers of the network. The mobile network 6 also comprises a billing system 15 for holding Call Detail Records (CDRs) relating to network services used by subscribers of the network 6 and store-and-forward message servers MMSC, SMSC 14, 16 configured to store and forward messages in accordance with conventional methods. The terminal 2 may be a wireless terminal such as a mobile phone or a PDA. The data messaging system 1 also comprises a WAP gateway 8, which is typically a network operator's WAP gateway, and a registration services server S1, with which a terminal T1, typically connected to the Internet 10, communicates via internet gateway 12. The terminal T1 can be e.g. a laptop computer or a personal computer fixedly attached to a network, and the registration service server S1 can be accessed by actuating a URL corresponding to the server S1. In addition the data messaging system 1 comprises content database 20, which is populated with content data from content providers such as information sources and/or advertisers and the like.


In embodiments of the invention it is assumed that the user of the terminal 2 is a subscriber of the network, and that subscribers have entered data indicative of their demographic data, preferences and interests, these data being received and stored by the registration server S1 in the subscriber database 24. As described above, the subscriber database 24 can be associated with a HLR for the mobile network 6: in a preferred arrangement, the preference data can be stored in a logically distinct storage area to that in which the network services and subscription data are stored, thereby decoupling the storage of preference data from the storage of network services data.


Broadly speaking, embodiments of the invention comprise two related processes, each of which is performed by the scheduling server S2 in respect of individual subscribers. The first process is a monitoring process, which operates so as to identify communication events such as registration and de-registration with the mobile network 6, making calls, sending messages, switching off, switching on, roaming, cell to cell handover, answering calls, and trends relating thereto; the first process can also include analysing these events in order to derive a set of message transmission rules. In one arrangement the source of data for the monitoring process is call detail records (CDRs) maintained by the billing system 15. These CDRs typically include parameters detailing the type of network usage (voice/data) used by the subscriber, together with temporal data relating thereto (time of usage, duration of usage); these parameters are subsequently analysed as described in detail below to populate message transmission rules.


The second process is a message selection and scheduling process, in which the transmission time for messages is selected on the basis of the message transmission rules. The messages that are selected for transmission are preferably selected from the content database 20, and in one arrangement are promotional messages. The transmission time can additionally be selected on the basis of temporal preference data specified by subscribers (such as “No messages between 01:00-07:00”) and/or preference data specified by the content providers, while the content of the promotional message is selected by matching preferred subject matter specified by subscribers with the subject matter of the promotional messages.


Turning now to FIGS. 2 and 3, the functionality of the scheduling server S2 will be described in more detail: in addition to standard CPU, memory, data bus, Input/Output ports, data storage, and operating system programs, the server S2 comprises various bespoke software components 201, 203, 205, some or all of which cooperate so as to determine a schedule for message transmission. In one arrangement messages are scheduled for transmission on the basis of historical data, while in another arrangement the scheduling server S2 operates on real-time data—in other words the server S2 queries the CDR records stored in the billing system 15 and/or subscriber records stored in the HLR in real time in order to schedule the transmission of messages.


Considering first the arrangement in which transmission is based on historical data retrieved from the billing system 15, the server S2 comprises retrieval software 201, which periodically queries the billing system 15 for CDRs, either in respect of specific subscribers or in respect of all subscribers. The retrieval software 201 processes the CDRs in order to identify time and duration of network usage, and stores the identified temporal data corresponding to each usage event in local storage DB2. Usage data corresponding to a specified period are then analysed by a usage analysing software component 203, in order to populate values of the following scheduling parameters for each subscriber:

    • 1. Night. The definition of the “night” varies from subscriber to subscriber and from day to day: for example during the weekends one subscriber might go out to disco, party etc., which means that they will be engaging in communications until later than they do during the week, while another subscriber might work night-shifts for certain periods during a month. The value of the “night” parameter is populated as a function of day of the week, on the basis of observed communications events stored in the usage storage DB2.
    • 2. Morning. As for “night”, the value of the “morning” parameter is populated as a function of day of the week, on the basis of observed communications events stored in the usage storage DB2.
    • 3. Busy. During certain periods of the day, the subscriber is involved in work-related communications events, which should continue uninterrupted by unsolicited messages. The value of the “busy” parameter is populated as a function of day of the week, on the basis of observed communications events stored in the usage storage DB2. It is to be noted that there might be several “busy” periods during a given day.


The values of these parameters are subsequently stored in local storage DB2 for use by the scheduling software component 205 at one or more specified scheduling times. The scheduling software component 205 can operate once or several times daily: message delivery rules R1 . . . R3 described below can be processed in conjunction with temporal preference parameters, so as to draw up a schedule for message delivery for part or all of a day; for each subscriber, the schedule can subsequently be stored in the local storage areas DB1, DB2.


Considering now the second arrangement, in which transmission is based on real-time data, the retrieval software 201 periodically queries the billing system 15 for CDRs, either in respect of specific subscribers or in respect of all subscribers. However, in this arrangement, in the event that there are no on-going or completed communications events, no action is taken; in the event that communications events are on-going or have just completed, the retrieval software component 201 triggers the scheduling software component 205 to process delivery rules R1 . . . R3 stored in local storage DB1.


The message delivery rules thus include a first set of rules for real-time querying of CDRs and a second set of rules for querying historical data (i.e. the usage data storage DB2). Examples of the rules are as follows:















Real Time
Historical







R1: Night Rule
IF night time activity
WAIT at least [“Night”



observed THEN wait at least a
+ X1] before sending



period of X1 before sending
any messages



any messages


R2: Morning
IF no activity yet during the
WAIT at least


Rule
day then wait at least a
[“Morning” + X2]



period of X2 + activity
before sending any



observed before sending any
messages



messages


R3: Busy Rule
IF communication session
WAIT at least [“Busy”



ongoing do not send
+ X3] before sending



advertisement; Wait X3
any messages



minutes before sending



message after conmunication



session is over









The values of X1, X2 and X3 are configurable and are stored in the usage database DB2; the value can be modified based on preference data specified by, and subsequently updated by feedback received from, the subscriber. It will be appreciated that rules R1 . . . R3 are an illustrative and non-exhaustive set of rules for use in scheduling message transmission.


These rules are processed by the scheduling software component 205, which additionally checks the output of rules R1 . . . R3 against temporal preference data specified by the subscriber. These temporal preference data can be embodied as parameters (PP), and can include some, or all, of the following:

  • PP 1 Time of the day acceptable for receiving unsolicited messages
  • PP 2 Day of the week acceptable for receiving unsolicited messages
  • PP 3 Week of the month acceptable for receiving unsolicited messages
  • PP 4 Month of the year acceptable for receiving unsolicited messages
  • PP 5 Time delay after previous communication event before unsolicited messages can be sent (per type of event)
  • PP 6 Indication that unsolicited messages should be sent only on a request basis (flag)
  • PP 7 Type of communication which can include unsolicited messages
  • PP 8 Communication patterns which can include unsolicited messages
  • PP 9 Period of no unsolicited messages
  • PP 10 Time delay between successively transmitted unsolicited messages


In the absence of input from the subscriber in respect of one or more of these temporal preference parameters, the or each parameter can be populated with a set of default values or ones used mostly by the peer group/community in which the subscriber belongs, as indicated in the subscriber's records stored in database 24.


The scheduling software component 205 also selects content for a message to be sent on the basis of a match between the content available in content database 20 and the preference data specified in subscriber database 24. The schedule can comprise a plurality of message transmission events, each corresponding to transmission of a given message and having a link to content selected from the content database 20 for the given message; when a message is due for transmission, a message M1 is created on the basis of the selected content and is transmitted to the subscriber.


In the event that messages are scheduled for delivery in real time, a plurality of schedules are generated during a day—each for immediate, or near, execution, and thus are typically held in memory until a timer equal to delay X1, X2 or X3 (as appropriate) has expired.


In addition to the temporal rules described above, the scheduling system server S2 has access to data indicative of actions taken by the terminal 2 in response to receipt of the message M1, and can use these data to determine feedback in respect of the unsolicited messages M1. The feedback can be captured via a further monitoring system (not shown), which monitors subscriber activity and correlates same with the content of the message M1. The output of the further monitoring system is then made available to the scheduling software component 205 in the form of further rules stored in the usage local data storage DB2; these include the following:

  • FR1. If a response is more likely immediately after SMS/MMS sending and receiving session then send message M1 as SMS/MMS;
  • FR2. If a response to an unsolicited message is more likely after or during certain communication event(s), then send message M1 after/during that/those event(s);
  • FR3. If more feedback is received in relation to message M1 during or after communication between certain parties (2 and 4), then send advertisements during/after those sessions;
  • FR4. Send message M1 just before actual communication message between 2 and 4 (this can be achieved by interrupting transmission of a message from 2 to 4, sending message M1, and then sending the message on to terminal 4);
  • FR5. Send the same or a similar message to M1 to both or all parties to a communications session after/during the communications session.


It will be appreciated that FR2-FR5 are real-time rules, so would be actioned at the same time as processing rules R1 . . . R3. Moreover, FR4 applies exclusively to ongoing communications sessions, while FR5 can be applied to messages sent between a group of subscribers.


Turning to FIG. 3, an example of the steps associated with the scheduling of unsolicited messages in real time and at night will now be described, in relation to rules R1, R2, R3 and preference parameters PP1 . . . PP10. At step S3.1, the retrieval software component 201 queries the billing system in respect of subscribers that are currently engaged in, or who have just completed communications sessions; accordingly the retrieval software component 201 receives a plurality of CDRs, and processes the same in order to extract a) subscriber and b) current communications session or c) just-completed communications session (step S3.3). For those subscribers determined to be category (b) or (c), the retrieval software component 201 triggers operation of the scheduling software component 205 (step S3.5), which responds by splitting the received data into two groups: (b) and (c). Turning to FIG. 4, for the case of a subscriber determined to be in group (b), the scheduling software component 205 identifies which of rules R1-R3 might apply (step 4.1) and checks that the applicable rules are compatible with the preference parameters PP1 . . . PP10 (step 4.3); since the process is being run at night, rule R2 is eliminated; assuming the conditions specified in preference parameters PP1, PP5, PP9 & PP10 to be satisfied, the scheduling software component 205 can then schedule transmission of a message when periods X1 and X3 have expired. If, however, one or more of the preference parameters are not satisfied, the scheduling process either ends or the scheduled time of message transmission is modified in accordance with the temporal constraints associated with a given preference parameter (e.g. in accordance with modified delay periods X1′, X3′: step 4.5).


Assuming message transmission to have been successfully scheduled, the scheduling software component 205 selects content for, and type of, message M1 (step 4.7) from the content database 20 on the basis of the interests and preference data stored in storage 24. In relation to format for the message M1, the scheduling software could process further rule FR1 in conjunction with message sending preference data specified by the subscriber.


Turning back to FIG. 3, at the scheduled delivery time, a message M1, of the selected format and comprising the content selected at step S4.7, is transmitted to the subscriber, and the subscriber database 24 is updated to indicate the time, content and type of message transmission. This information is subsequently used in relation to preference parameters PP5 and PP10 and by the feedback system.


In relation to a subscriber for which the CDR retrieved at step S3.1 indicates completion of a communications session, the scheduling software component 205 progresses as described above, but performs the additional step of adjusting the scheduled time of message delivery to account for the amount of time that has expired since the end of the communications session.


In relation to the further rules FR1 . . . FR5, the real-time embodiment implicitly satisfies the “after” versions of rules FR2, FR3 and FR5; since the “during” versions of rules FR2, FR3 and FR5 conflict with the conditions of rules R1-R3, the further rules are preferably only applied at times of the day in which rules R1 and R2 do not apply (e.g. during the day). In relation to “Busy” rule R3, this conflicts with the “during” versions of FR2, FR3 and FR5, and the scheduling software component 205 consequently makes recourse to preference parameter PP8 so as to identify which of rules R3, or FR2/FR3 should be applied.


Additional Details and Alternatives


The above embodiments are to be understood as illustrative examples of the invention and further arrangements are envisaged. For example in addition, or as an alternative, to scheduling the transmission of messages on the basis of communications activities, the schedule can be drawn up on the basis of subscriber-selectable settings such as “send all promotional messages at time T1”; and/or schedules can be drawn up for groups of subscribers; and/or a subscriber can elect a subscriber and specify that the schedule mirrors that of the elected subscriber; and/or a subscriber can request that all promotional messages are transmitted with a selected application or message to a messages delivery system.


In addition, whilst the above embodiments describe accessing the billing system 15 and retrieving CDRs relating to ongoing or completed communications events, the retrieval software 201 could alternatively access the HLR to determine registration status of the subscriber. In these alternative embodiments, the communications event is registration with the network, and this event can trigger generation of a schedule according to the method described above (the time of registration determining which of rules R1 and R2 might apply). In a yet further arrangement, such as one in which the user is connected to a Wireless Local Area Network (WLAN), the source of data for the monitoring process could be WLAN access login information.


The mobile network 6 can comprise any cellular network technologies which include, but are not limited to, GSM, 3rd generation networks, WCDMA, CDMA and GPRS. In addition to traditional cellular networks, unlicensed networks such as Wireless Local area networks (WLAN), Bluetooth™ (BT) and other technologies such as WiMax, Broadcasting over DVB-H, ISDB-T and DMB can be used to deliver the scheduled messages. The terminal 2 can use the same network or another network for delivery of the messages: i.e. a hybrid network for delivery of messages and voice communications is possible.


Said scheduled messages can be delivered in efficient way using the broadcast networks to many subscribers at the same time.


The terminal 2 can be equipped with a bespoke application arranged to receive messages from a specified system according to a first schedule, and to display the message to the subscriber according to a second schedule. The second schedule can be stored locally on the terminal, or stored remotely in conjunction with the subscriber's record in database 24 and downloaded to the terminal 2. This enables message M1 to be sent in accordance with the first schedule, which is drawn up in dependence on e.g. the availability of network resources (capacity/hotspots/broadcast networks etc.), but viewed in accordance with the second schedule, which can be determined from the subscriber's preferences and availability, as described above.


It is to be understood that any feature described in relation to any one embodiment may be used alone, or in combination with other features described, and may also be used in combination with one or more features of any other of the embodiments, or any combination of any other of the embodiments. Furthermore, equivalents and modifications not described above may also be employed without departing from the scope of the invention, which is defined in the accompanying claims.

Claims
  • 1. A computer implemented method comprising: monitoring a communications network to identify communication events associated with a subscriber of the communications network, wherein the monitoring includes querying Call Detail Records to identify communication sessions associated with the subscriber;populating at least one scheduling parameter value based on an analysis of the identified communication events, wherein the at least one scheduling parameter value indicates a time when the subscriber performs daily activities and is populated as a function of day of the week on the basis of the identified communication events;deriving a set of message transmission rules associated with the subscriber based on the at least one populated scheduling parameter, wherein the set of message transmission rules dictates when messages are to be transmitted to the subscriber in relation to the at least one populated scheduling parameter; andscheduling a transmission time for messages based on the message transmission rules.
  • 2. The method of claim 1, wherein deriving a set of message transmission rules is based on real-time communication events.
  • 3. The method of claim 1, wherein deriving a set of message transmission rules is based on historical communication events.
  • 4. The method of claim 1, wherein the call detail records include the type of network usage used by the subscriber along with temporal data relating thereto.
  • 5. The method of claim 3, wherein deriving a set of message transmission rules comprises setting values for parameters defining the availability of the subscriber.
  • 6. The method of claim 5, wherein the parameters include night, morning and busy.
  • 7. The method of claim 1 wherein deriving a set of message transmission rules comprises deriving a first set of message transmission rules for real-time communication events and a second set of message transmission rules for historical communication events.
  • 8. The method of claim 1, wherein deriving a set of message transmission rules is further based on temporal preference data specified by the subscriber.
  • 9. The method of claim 1, wherein deriving a set of message transmission rules is further based on preference data specified by a content provider.
  • 10. The method of claim 1, further comprising: selecting content for a message; andtransmitting the message to a terminal based on the scheduled transmission time.
  • 11. The method of claim 10, further comprising receiving data indicative of actions taken by the terminal in response to receipt of the message.
  • 12. The method of claim 11, wherein deriving a set of message transmission rules is further based on the received data indicative of actions taken by the terminal in response to receipt of the message.
  • 13. A system comprising: a communication device configured to monitor a communications network to identify communication events associated with a subscriber of the communications network, wherein the monitoring includes querying Call Detail Records to identify communication sessions associated with the subscriber; anda processor configured to populate at least one scheduling parameter value based on an analysis of the identified communication events, wherein the at least one scheduling parameter value indicates a time when the subscriber performs a daily activity and is populated as a function of day of the week on the basis of the identified communication events;the processor further configured to derive a set of message transmission rules associated with the subscriber based on the at least one populated scheduling parameter, wherein the set of message transmission rules dictates when messages are to be transmitted to the subscriber in relation to the at least one populated scheduling parameter;the processor further configured to schedule a transmission time for messages based on the message transmission rules.
  • 14. The system of claim 13, wherein the processor derives a set of message transmission rules based on real-time communication events.
  • 15. The system of claim 13, wherein the processor derives a set of message transmission rules based on historical communication events.
  • 16. The system of claim 15, wherein the processor is further configured to set values for parameters defining the availability of the subscriber.
  • 17. The system of claim 13, wherein the call detail records include the type of network usage used by the subscriber along with temporal data relating thereto.
  • 18. The system of claim 13, further comprising: a messaging device configured to select content for a message;the messaging device further configured to transmit the message to a terminal based on the scheduled transmission time.
  • 19. The system of claim 18, wherein the messaging device is further configured to receive data indicative of actions taken by the terminal in response to receipt of the message.
  • 20. The system of claim 19, wherein the processor is further configured to derive a set of message transmission rules further based on the received data indicative of actions taken by the terminal in response to receipt of the message.
  • 21. A non-transitory computer readable medium having instructions stored thereon for causing a computing device to perform a method comprising: monitoring a communications network to identify communication events associated with a subscriber of the communication network, wherein the monitoring includes querying Call Detail Records to identify communication sessions associated with the subscriber;populating at least one scheduling parameter value based on an analysis of the identified communication events, wherein the at least one scheduling parameter value indicates a time when the subscriber performs daily activities and is populated as a function of day of the week on the basis of the identified communication events;deriving a set of message transmission rules associated with the subscriber based on the at least one populated scheduling parameter, wherein the set of message transmission rules dictates when messages are to be transmitted to the subscriber in relation to the at least one populated scheduling parameter; andscheduling a transmission time for messages based on the message transmission rules.
  • 22. The method of claim 1, wherein the Call Detail Records are a record to network services including any one of data and voice network usage, time and duration of usage, sending messages, network registration and de-registration, making calls, switching off, switching on, roaming, cell to cell handover and answering calls, performed by subscribers of the network.
  • 23. The method of claim 8, wherein in the absence of input from the subscriber specifying the temporal preference data, the temporal preference data is populated with default data.
  • 24. The method of claim 8, wherein in the absence of input from the subscriber specifying the temporal preference data, the temporal preference data is populated with data most commonly associated with a community in which the subscriber belongs.
  • 25. The method of claim 2, wherein deriving a set of message transmission rules includes periodically querying the Call Detail Records and determining whether there are new communication events.
  • 26. The method of claim 5, wherein the message transmission rules dictate that a message should be sent a predetermined time interval from a parameter defining the availability of the subscriber.
  • 27. The method of claim 8, wherein the temporal preference data dictates a time of data acceptable for receiving messages.
  • 28. The method of claim 8, wherein the temporal preference data dictates a day of the week acceptable for receiving messages.
  • 29. The method of claim 8, wherein the temporal preference data dictates a time delay after a previous message before another message can be sent.
  • 30. The method of claim 8, wherein the temporal preference data dictates that messages should only be sent on a request basis.
  • 31. The method of claim 8, wherein the temporal preference data dictates the type of communication which can include a message.
  • 32. The method of claim 8, wherein the temporal preference data dictates communication patterns which can include messages.
  • 33. The method of claim 8, wherein the temporal preference data dictates a period wherein no messages can be received.
  • 34. The method of claim 1, further comprising: receiving data indicative of actions taken by the terminal in response to receipt of the message.
  • 35. The method of claim 34, wherein the data indicative of actions taken by the terminal are used to determine the message transmission rules.
  • 36. The method of claim 34, wherein when the data indicative of actions taken by the terminal indicates that a response is more likely when a message is sent as a specific type of communication, the message transmission rules dictate that messages be sent as that specific type of communication.
  • 37. The method of claim 34, wherein when the data indicative of actions taken by the terminal indicates that a response is more likely after a certain communication event, the message transmission rules dictate that messages be sent after that certain communication event.
  • 38. The method of claim 34, wherein when the data indicative of actions taken by the terminal indicates that a response is more likely after communication between certain subscribers, the message transmission rules dictate that messages be sent after communications between those subscribers.
  • 39. The system of claim 13, wherein the Call Detail Records are a record to network services including any one of data and voice network usage, time and duration of usage, sending messages, network registration and de-registration, making calls, switching off, switching on, roaming, cell to cell handover and answering calls, performed by subscribers of the network.
  • 40. The non-transitory computer readable medium of claim 21, wherein the Call Detail Records are a record to network services including any one of data and voice network usage, time and duration of usage, sending messages, network registration and de-registration, making calls, switching off, switching on, roaming, cell to cell handover and answering calls, performed by subscribers of the network.
Priority Claims (2)
Number Date Country Kind
0700340.3 Jan 2007 GB national
0716001.3 Aug 2007 GB national
PCT Information
Filing Document Filing Date Country Kind 371c Date
PCT/EP2008/050208 1/9/2008 WO 00 2/11/2009
Publishing Document Publishing Date Country Kind
WO2008/084065 7/17/2008 WO A
US Referenced Citations (141)
Number Name Date Kind
4811382 Sleevi Mar 1989 A
4935956 Hellwarth Jun 1990 A
5408519 Pierce et al. Apr 1995 A
5592535 Klotz Jan 1997 A
5678179 Turcotte et al. Oct 1997 A
5752238 Dedrick May 1998 A
5978775 Chen Nov 1999 A
5978833 Pashley et al. Nov 1999 A
6006197 d'Eon et al. Dec 1999 A
6009410 LeMole et al. Dec 1999 A
6023700 Owens et al. Feb 2000 A
6044259 Hentila Mar 2000 A
6097942 Laiho Aug 2000 A
6286005 Cannon Sep 2001 B1
6408309 Agarwal Jun 2002 B1
6411946 Chaudhuri Jun 2002 B1
6639977 Swope et al. Oct 2003 B1
6647269 Hendrey et al. Nov 2003 B2
6718178 Sladek et al. Apr 2004 B1
6889054 Himmel et al. May 2005 B2
7039599 Merriman et al. May 2006 B2
7072947 Knox et al. Jul 2006 B1
7164927 Koch et al. Jan 2007 B1
7280818 Clayton Oct 2007 B2
7529357 Rae et al. May 2009 B1
7730017 Nance et al. Jun 2010 B2
7734632 Wang Jun 2010 B2
20010008404 Naito et al. Jul 2001 A1
20020006803 Mendiola et al. Jan 2002 A1
20020019829 Shapiro Feb 2002 A1
20020075305 Beaton et al. Jun 2002 A1
20020077130 Owensby Jun 2002 A1
20020128908 Levin et al. Sep 2002 A1
20020137507 Winkler Sep 2002 A1
20020138291 Vaidyanathan et al. Sep 2002 A1
20020161770 Shapiro et al. Oct 2002 A1
20020164977 Link, II et al. Nov 2002 A1
20020183040 Lundstrom et al. Dec 2002 A1
20020193093 Henrikson et al. Dec 2002 A1
20030003929 Himmel et al. Jan 2003 A1
20030023489 McGuire et al. Jan 2003 A1
20030040297 Pecen et al. Feb 2003 A1
20030040300 Bodic et al. Feb 2003 A1
20030076940 Manto Apr 2003 A1
20030083931 Lang May 2003 A1
20030096599 Takatsuki May 2003 A1
20030110171 Ozer et al. Jun 2003 A1
20030126015 Chan et al. Jul 2003 A1
20030197719 Lincke et al. Oct 2003 A1
20030216147 Morin et al. Nov 2003 A1
20040068435 Braunzell Apr 2004 A1
20040133480 Domes Jul 2004 A1
20040137874 Veerepalli et al. Jul 2004 A1
20040158612 Concannon Aug 2004 A1
20040180648 Hymel Sep 2004 A1
20040185827 Parks Sep 2004 A1
20040192359 McRaild et al. Sep 2004 A1
20040209649 Lord Oct 2004 A1
20040240649 Goel Dec 2004 A1
20040259526 Goris et al. Dec 2004 A1
20050027676 Eichstaedt et al. Feb 2005 A1
20050055408 Dong Mar 2005 A1
20050113064 Halsell May 2005 A1
20050123111 Philbin et al. Jun 2005 A1
20050125397 Gross et al. Jun 2005 A1
20050148350 Kamphuis Jul 2005 A1
20050186940 Schatzberger et al. Aug 2005 A1
20050228680 Malik Oct 2005 A1
20050238154 Heaton et al. Oct 2005 A1
20050239504 Ishii et al. Oct 2005 A1
20050273465 Kimura Dec 2005 A1
20060025109 Levitan Feb 2006 A1
20060025129 Wolfman Feb 2006 A1
20060025163 Smith et al. Feb 2006 A1
20060031327 Kredo Feb 2006 A1
20060041470 Filho et al. Feb 2006 A1
20060048059 Etkin Mar 2006 A1
20060068845 Muller et al. Mar 2006 A1
20060094406 Cortegiano May 2006 A1
20060109969 Oh May 2006 A1
20060117378 Tam et al. Jun 2006 A1
20060123014 Ng Jun 2006 A1
20060200460 Meyerzon et al. Sep 2006 A1
20060200461 Lucas et al. Sep 2006 A1
20060252512 Walker et al. Nov 2006 A1
20060253327 Morris et al. Nov 2006 A1
20060276170 Radhakrishnan et al. Dec 2006 A1
20060276213 Gottschalk et al. Dec 2006 A1
20060282328 Gerace et al. Dec 2006 A1
20060286962 Davis Dec 2006 A1
20060286963 Koskinen et al. Dec 2006 A1
20060288124 Kraft et al. Dec 2006 A1
20070004380 Ylikoski Jan 2007 A1
20070016488 Ulenas Jan 2007 A1
20070027760 Collins et al. Feb 2007 A1
20070027762 Collins et al. Feb 2007 A1
20070033104 Collins et al. Feb 2007 A1
20070061195 Liu et al. Mar 2007 A1
20070074262 Kikkoji et al. Mar 2007 A1
20070077911 Raman Apr 2007 A1
20070091869 Kahn Apr 2007 A1
20070094066 Kumar et al. Apr 2007 A1
20070100805 Ramer et al. May 2007 A1
20070105536 Tingo, Jr. May 2007 A1
20070136457 Dai et al. Jun 2007 A1
20070192409 Kleinstern et al. Aug 2007 A1
20070232300 Wolfman Oct 2007 A1
20070237330 Srivastava Oct 2007 A1
20070260624 Chung et al. Nov 2007 A1
20080057917 Oria Mar 2008 A1
20080065491 Bakman Mar 2008 A1
20080071929 Motte et al. Mar 2008 A1
20080075249 Zach Mar 2008 A1
20080091796 Story Apr 2008 A1
20080125080 Phillips May 2008 A1
20080140508 Anand et al. Jun 2008 A1
20080228568 Williams et al. Sep 2008 A1
20080249832 Richardson et al. Oct 2008 A1
20080271068 Ou et al. Oct 2008 A1
20080319836 Aaltonen et al. Dec 2008 A1
20090006194 Sridharan et al. Jan 2009 A1
20090029721 Doraswamy Jan 2009 A1
20090049090 Shenfield et al. Feb 2009 A1
20090063249 Tomlin et al. Mar 2009 A1
20090075627 Hwang Mar 2009 A1
20090106111 Walk et al. Apr 2009 A1
20090125377 Somji et al. May 2009 A1
20090132395 Lam et al. May 2009 A1
20090197619 Colligan et al. Aug 2009 A1
20090216847 Krishnaswamy et al. Aug 2009 A1
20090286520 Nielsen et al. Nov 2009 A1
20090298483 Bratu et al. Dec 2009 A1
20100082397 Blegen Apr 2010 A1
20100082423 Nag et al. Apr 2010 A1
20100088152 Bennett Apr 2010 A1
20100114654 Lukose et al. May 2010 A1
20100125505 Puttaswamy May 2010 A1
20100138271 Henkin Jun 2010 A1
20100161424 Sylvain Jun 2010 A1
20100169157 Muhonen et al. Jul 2010 A1
20100169176 Turakhia Jul 2010 A1
Foreign Referenced Citations (100)
Number Date Country
1015704 Jul 2005 BE
19941461 Mar 2001 DE
1073293 Jan 2001 EP
1109371 Jun 2001 EP
1161093 Dec 2001 EP
1193955 Apr 2002 EP
1220132 Jul 2002 EP
1239395 Sep 2002 EP
1253542 Oct 2002 EP
1280087 Jan 2003 EP
1298945 Apr 2003 EP
1320214 Jun 2003 EP
1324250 Jul 2003 EP
1365604 Nov 2003 EP
1 445 703 Aug 2004 EP
1455511 Sep 2004 EP
1528827 May 2005 EP
1587332 Oct 2005 EP
1613102 Jan 2006 EP
1615455 Jan 2006 EP
1633100 Mar 2006 EP
1772822 Apr 2007 EP
2352856 Feb 2001 GB
2356777 May 2001 GB
2372867 Sep 2002 GB
2383149 Jun 2003 GB
2406996 Apr 2005 GB
2407002 Apr 2005 GB
2002140272 May 2002 JP
9624213 Aug 1996 WO
9733421 Sep 1997 WO
9837685 Aug 1998 WO
9853637 Nov 1998 WO
0044151 Jul 2000 WO
WO 0062564 Oct 2000 WO
0122748 Mar 2001 WO
0131497 May 2001 WO
0144977 Jun 2001 WO
0157705 Aug 2001 WO
0158178 Aug 2001 WO
0163423 Aug 2001 WO
0163897 Aug 2001 WO
0165411 Sep 2001 WO
0169406 Sep 2001 WO
0171949 Sep 2001 WO
0172063 Sep 2001 WO
0177840 Oct 2001 WO
0178425 Oct 2001 WO
0191400 Nov 2001 WO
0193551 Dec 2001 WO
0197539 Dec 2001 WO
WO 0223423 Mar 2002 WO
0231624 Apr 2002 WO
0244834 Jun 2002 WO
0244989 Jun 2002 WO
02054803 Jul 2002 WO
02059720 Aug 2002 WO
02069585 Sep 2002 WO
02075574 Sep 2002 WO
02096056 Sep 2002 WO
02080595 Oct 2002 WO
02084895 Oct 2002 WO
03015430 Feb 2003 WO
03019845 Mar 2003 WO
03024136 Mar 2003 WO
03038638 May 2003 WO
03088690 Oct 2003 WO
2004034671 Apr 2004 WO
2004054205 Jun 2004 WO
2004084532 Sep 2004 WO
2004086791 Oct 2004 WO
2004100470 Nov 2004 WO
2004100521 Nov 2004 WO
2004107795 Dec 2004 WO
2004114109 Dec 2004 WO
2005015806 Feb 2005 WO
2005029769 Mar 2005 WO
2005062637 Jul 2005 WO
2005073863 Aug 2005 WO
2005076650 Aug 2005 WO
WO2005083980 Sep 2005 WO
WO 2005086927 Sep 2005 WO
2006002869 Jan 2006 WO
2006024003 Mar 2006 WO
2006026505 Mar 2006 WO
2006027407 Mar 2006 WO
WO2006026505 Mar 2006 WO
2006093284 Sep 2006 WO
2006110446 Oct 2006 WO
2006119481 Nov 2006 WO
2007002025 Jan 2007 WO
2007056698 May 2007 WO
2007060451 May 2007 WO
2007091089 Aug 2007 WO
2008013437 Jan 2008 WO
2009009507 Jan 2009 WO
2009061914 May 2009 WO
2009077888 Jun 2009 WO
2009099876 Aug 2009 WO
2009158097 Dec 2009 WO
Non-Patent Literature Citations (23)
Entry
International Search Report dated May 6, 2008 for International Application No. PCT/EP2008/050208.
Written Opinion of the International Search Authority dated May 6, 2008 for International Application No. PCT/EP2008/050208.
United Kingdom Search Report dated Apr. 13, 2007 for UK Application No. GB0700340.3.
European Search Report dated Jun. 26, 2008 for European Patent Application No. 08155590.6.
“Advertisement System, Method and Computer Program Product”, IP.com Prior Art Database Disclosure, Pub No. IPCOM000138557D, dated Jun. 24, 2006, IP.com, Amherst, NY (Available online at http;//priorartdatabase.com/IPCOM/000138557, last visited Aug. 30, 2010).
Communication Pursuant to Article 94(3) EPC, European Application No. 08 101 640.4, mailed Nov. 25, 2009.
European Patent Application No. EP08101640.4, European Search Report, completed Mar. 19, 2008.
European Application No. EP 08101331, European Search Report, completed Jun. 4, 2008.
PCT/EP2008/005084, International Preliminary Report on Patentability and Written Opinion, issued Nov. 17, 2009.
PCT/EP2008/057438, International Preliminary Report on Patentability, dated Dec. 17, 2009.
PCT/EP2008/058117, International Search Report and Written Opinion, mailed Feb. 13, 2009.
Office Action, related U.S. Appl. No. 12/221,028, mailed Feb. 19, 2009.
U.K. Search Report under Section 17, U.K. Application No. GB0803468.8, dated Jun. 4, 2008.
U.K. Search Report under Section 17, U.K. Patent App. No. GB0809536.6, dated Jun. 9, 2008.
U.K. Search Report Under Section 17, U.K Application No. GB 0712291.4.
UK Search Report under Section 17, Application No. GB0709426.1, dated Sep. 10, 2007.
PCT/EP2008/057438, International Search Report and Written Opinion of the International Searching Authority, mailed Jan. 22, 2009.
Hillard, Dustin et al., “Improving Ad Relevance in Sponsored Search”, Proceedings of the third ACM international conference on Web search and data mining, WSDM'10, Feb. 4-6, 2010, SESSION: Ads, pp. 361-369, ACM, New York, New York, USA, 361-369.
Internet Reference, “Specific Media Behavioral Targeting Index”, Specific Media, Inc., Irvine, CA, 2010, Available online at http://www.specificmedia.com/behavioral-targeting.php.
Langheinrich, Marc et al., “Unintrusive Customization Techniques for Web Advertising”, Computer Networks: The International Journal of Computer and Telecommunications Networking, vol. 31, No. 11, pp. 1259-1272, Elsevier North-Holland, Inc., New York, NY, May 11, 1999, 1259-1272.
Regelson, Moira et al., “Predicting Click-Through Rate Using Keyword Clusters”, Proceedings of the Second Workshop on Sponsored Search Auctions, EC'06, SSA2, Jun. 11, 2006, ACM.
Richardson, Matthew et al., “Predicting Clicks: Estimating the Click-Through Rate for New Ads”, Proceedings of the 16th international conference on World Wide Web, Banff, Alberta, Canada, May 8-12, 2007, SESSION: Advertisements & click estimates, pp. 521-529, ACM, 521-529.
Shaikh, Baber M. et al., “Customized User Segments for Ad Targeting”, IP.com Prior Art Database Disclosure, Pub No. IPCOM000185640D, dated Jul. 29, 2009 UTC, IP.com, Amherst, NY (Available online at http://priorartdatabase.com/IPCOM/000185640, last visited Aug. 30, 2010).
Related Publications (1)
Number Date Country
20090176501 A1 Jul 2009 US