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.
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.
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 no 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.
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.
In the arrangement shown in
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
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:
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:
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:
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:
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
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
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.
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.
Number | Date | Country | Kind |
---|---|---|---|
0700340.3 | Jan 2007 | GB | national |
0716001.3 | Aug 2007 | GB | national |
This application is a continuation of U.S. patent application Ser. No. 11/996,870, filed Jan. 9, 2008, now U.S. Pat. No. 8,417,226, which is the National Stage of International Application No. PCT/EP2008/050208, filed Jan. 9, 2008, which claims the benefit of GB0700340.3 filed Jan. 9, 2007, and GB0716001.3 filed Aug. 16, 2007; all of which are incorporated by reference in their entireties, for all purposes, herein.
Number | Name | Date | Kind |
---|---|---|---|
4811382 | Sleevi | Mar 1989 | A |
4935956 | Hellwarth | Jun 1990 | A |
5408519 | Pierce et al. | Apr 1995 | A |
5459306 | Stein et al. | Oct 1995 | A |
5592535 | Klotz | Jan 1997 | A |
5600364 | Hendricks et al. | Feb 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 et al. | Mar 2000 | A |
6097942 | Laiho | Aug 2000 | A |
6253189 | Feezell et al. | Jun 2001 | B1 |
6286005 | Cannon | Sep 2001 | B1 |
6408309 | Agarwal | Jun 2002 | B1 |
6411946 | Chaudhuri | Jun 2002 | B1 |
6502076 | Smith | Dec 2002 | B1 |
6639977 | Swope et al. | Oct 2003 | B1 |
6647269 | Hendrey et al. | Nov 2003 | B2 |
6718178 | Sladek et al. | Apr 2004 | B1 |
6738978 | Hendricks et al. | May 2004 | B1 |
6889054 | Himmel et al. | May 2005 | B2 |
7016864 | Notz et al. | Mar 2006 | B1 |
7039599 | Merriman et al. | May 2006 | B2 |
7072947 | Knox et al. | Jul 2006 | B1 |
7164927 | Koch et al. | Jan 2007 | B1 |
7168084 | Hendricks et al. | Jan 2007 | B1 |
7280818 | Clayton | Oct 2007 | B2 |
7343312 | Capek et al. | Mar 2008 | B2 |
7349527 | Yacoub et al. | Mar 2008 | B2 |
7356477 | Allan et al. | Apr 2008 | B1 |
7529357 | Rae et al. | May 2009 | B1 |
7539652 | Flinn et al. | May 2009 | B2 |
7669212 | Alao et al. | Feb 2010 | B2 |
7729988 | Walker et al. | Jun 2010 | B1 |
7730017 | Nance et al. | Jun 2010 | B2 |
7734632 | Wang | Jun 2010 | B2 |
7747676 | Nayfeh et al. | Jun 2010 | B1 |
7912843 | Murdock et al. | Mar 2011 | B2 |
8046797 | Bentolila et al. | Oct 2011 | B2 |
8060406 | Blegen | Nov 2011 | B2 |
8191098 | Cooper et al. | May 2012 | B2 |
8229786 | Cetin et al. | Jul 2012 | B2 |
20010008404 | Naito et al. | Jul 2001 | A1 |
20020006803 | Mendiola et al. | Jan 2002 | A1 |
20020010645 | Hagen et al. | Jan 2002 | A1 |
20020019829 | Shapiro | Feb 2002 | A1 |
20020021809 | Salo et al. | Feb 2002 | A1 |
20020075305 | Beaton et al. | Jun 2002 | A1 |
20020077130 | Owensby | Jun 2002 | A1 |
20020120498 | Gordon et al. | Aug 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 | Henrickson 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 |
20030126146 | Van Der Riet | Jul 2003 | A1 |
20030130887 | Nathaniel | 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 | Eichstadt et al. | Feb 2005 | A1 |
20050055408 | Dong | Mar 2005 | A1 |
20050075929 | Wolinsky et al. | Apr 2005 | A1 |
20050086141 | Lewis | Apr 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 |
20050229209 | Hildebolt et al. | Oct 2005 | A1 |
20050238154 | Heaton et al. | Oct 2005 | A1 |
20050239504 | Ishii et al. | Oct 2005 | A1 |
20050267798 | Panara | Dec 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 |
20060148555 | Dent et al. | Jul 2006 | A1 |
20060167747 | Goodman et al. | Jul 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 |
20060282319 | Maggio | 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 |
20070016743 | Jevans | Jan 2007 | A1 |
20070022021 | Walker et al. | Jan 2007 | A1 |
20070027703 | Hu et al. | Feb 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 |
20070156534 | Lerner et al. | Jul 2007 | A1 |
20070192409 | Kleinstern et al. | Aug 2007 | A1 |
20070232300 | Wolfman | Oct 2007 | A1 |
20070233671 | Oztekin et al. | Oct 2007 | A1 |
20070237330 | Srivastava | Oct 2007 | A1 |
20070244750 | Grannan et al. | Oct 2007 | A1 |
20070260624 | Chung et al. | Nov 2007 | A1 |
20080052158 | Ferro et al. | Feb 2008 | 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 |
20080133344 | Hyder et al. | Jun 2008 | A1 |
20080134043 | Georgis et al. | Jun 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 |
20090083062 | Gupta | Mar 2009 | A1 |
20090106111 | Walk et al. | Apr 2009 | A1 |
20090125377 | Somji et al. | May 2009 | A1 |
20090132395 | Lam et al. | May 2009 | A1 |
20090138304 | Aharoni et al. | May 2009 | A1 |
20090197619 | Colligan et al. | Aug 2009 | A1 |
20090216847 | Krishnaswamy et al. | Aug 2009 | A1 |
20090240677 | Parekh et al. | Sep 2009 | A1 |
20090286520 | Nielsen et al. | Nov 2009 | A1 |
20090287619 | Liang et al. | Nov 2009 | A1 |
20090298483 | Bratu et al. | Dec 2009 | A1 |
20100030647 | Shahshahani | Feb 2010 | 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 |
20100153216 | Liang et al. | Jun 2010 | A1 |
20100161424 | Sylvain | Jun 2010 | A1 |
20100169157 | Muhonen et al. | Jul 2010 | A1 |
20100169176 | Turakhia | Jul 2010 | A1 |
20100205541 | Rapaport et al. | Aug 2010 | A1 |
20100228603 | Bolder et al. | Sep 2010 | A1 |
20110087526 | Morgenstern et al. | Apr 2011 | A1 |
20110106840 | Barrett et al. | May 2011 | A1 |
20110209067 | Bogess et al. | Aug 2011 | A1 |
20110225048 | Nair | Sep 2011 | A1 |
20110238485 | Haumont et al. | Sep 2011 | A1 |
20110276401 | Knowles et al. | Nov 2011 | A1 |
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 |
WO 2006026505 | 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 |
2009077888 | Jan 2009 | WO |
2009061914 | May 2009 | WO |
2009099876 | Aug 2009 | WO |
2009158097 | Dec 2009 | WO |
Entry |
---|
“Advertisement System, Method and Computer Program Product”, IP.com Prior Art Database Disclosure, Pub No. IPCOM000138557D, dated Jul. 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, 2010., Feb. 4, 2010, 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, May 1999, pp. 1259-1272, Elsevier North-Holland, Inc., New York, NY, 1999., 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, 2006., Jun. 11, 2006. |
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, 2007., May, 8, 2007, 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)., Jul. 29, 2009. |
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. |
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. |
“AdWords Reference Guide”, Google, 2004. |
Ghose, Anindya et al., “An Empirical Analysis of Search Engine Advertising: Sponsored Search in Electronic Markets”, Management Science, Informs, 2009. |
Karuga, Gilber G. et al., “AdPalette: An Algorithm for Customizing Online Advertisements on the Fly”, Decision Support Systems, vol. 32, 2001. |
Science Dictionary, Definition of “dynamic”, 2002. |
World English Dictionary, Definition of “relevant”, 1998. |
Number | Date | Country | |
---|---|---|---|
20130267197 A1 | Oct 2013 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 11996870 | US | |
Child | 13828418 | US |