System, method and computer program for determining tags to insert in communications

Information

  • Patent Grant
  • 8719091
  • Patent Number
    8,719,091
  • Date Filed
    Friday, October 10, 2008
    16 years ago
  • Date Issued
    Tuesday, May 6, 2014
    10 years ago
Abstract
A method for adding a tag to a message deliverable to a communication device includes monitoring communications to the device to identify a communication with which a tag can be associated. For identified communications with which a tag can be associated, the method includes analyzing at least one of data about the content of the communication, profile data about at least one of the recipient or sender of the communication, data about a commercial relationship between an operator managing communications to the device and an Internet service provider of tags, and data about popularity of an internet site, and selecting a tag to associate with the communication based on the data analysis.
Description
FIELD OF THE INVENTION

The present invention relates generally to systems, methods and computer programs to select digital information, such as advertisements, tags or links to deliver to individuals' communications devices.


BACKGROUND INFORMATION

Peer-to-peer and peer-to-group communications, such as Short Message Service (SMS), Multimedia Message Service (MMS), EMS (Enhanced Message Service), e-mail and Instant Messaging (IM), are being used more frequently as a mechanism for delivering advertisements. The term “tagging” is generally used when describing this type of advertising, i.e., a tag is an advertisement which is delivered to users' communication devices using any of the foregoing techniques. The term Tag refers to information added by a service operator, such as MVNO (mobile virtual network operator), MNO (mobile network operator), other 3rd party or a sender (e.g. using a suitable application in a sending device to a peer-to-peer, peer-to-group, service-to-peer or service-to-group digital message). The information contained within the Tag could be at least one of the following: part of a an advertisement campaign, a service acquisition message, and information services (news stories, weather, ‘What's On’, etc.), or any other content.


In particular, the SMS is a universal standard that allows the users of cellular telephones, cable telephones, or other communication devices which support it, to send and receive messages with a text content that can comprise a predetermined maximum number of alphanumerical characters.


In the alphabetical coding system of the European standard GSM, the maximum number of characters is 160, in the Cyrillic standard the maximun number of characters is 140, and with the UCS2 (Turkish, Greek, Arab, Chinese, Thai, etc.) standard the maximun number of characters is 70.


The evolution of SMS has led to EMS, for incorporating in a SMS text message graphics, images, animations and/or sounds.


In this context SMART MESSAGE (SM) is also used, which is a standard developed by Nokia Corporation and universally recognized. SM enables the addition graphical, audio and video content to normal SMS text messages.


Both the SMART MESSAGE and the EMS standards are made linking several SMS to one another.


A Flash Message, also called SMS of class 0, is a special text message, improved from the SMS message. Its content is displayed directly on the display of the mobile phone.


The MMS (Multimedia Messaging Service) is a universal standard that enables the users of mobile phones and other communication devices that support it to send and receive messages with content of text, images, graphics, sounds, audio clips and/or video clips. The structure of the MMS consists of one or more pages or “slides”, each containing two regions, one for the text and one for the images. The pages, furthermore, can be timed, and sound can be appended, and they can be displayed. Each page, or slide, has the same layout. The MMS is therefore an extension of the concept of SMS, are MMS messages are typically called multimedia messages.


Concerning SMS, the cost of the messages is typically independent of the length of the text being sent, which only seldom achieves the maximum allowed. Therefore, the user incurs the same cost for a single word as for a long text within the limits. The same applies for a Mobile Virtual Network Operator (MVNO), i.e. MVNO typically pays to Mobile Network Operator (MNO) the same fee per message independent of the length of the text as delivered for MVNO's client. To clarify, a MVNO is a company that provides mobile (sometimes called wireless or cellular) telephone service but does not have its own allocation of the radio frequency spectrum nor all of the infrastructure required to provide mobile telephone service.


The same occurs for other types of the above cited messages, EMS, SMART MESSAGE and MMS, where the cost of the sent message is typically fixed, or calculated for blocks of fixed length, or calculated as packages of delivered data. Therefore, except for rare cases, a residual space not exploited by the user is always present.


The use of unused space within digital communications for advertising use creates a substantial inventory of available (that is, unused) tag space and thus requires a substantial inventory of tags to be used to fill these available tag spaces. Efficient use of this tag inventory with a varied supply of commercially viable tags can be problematic. For SMS tags alone, it is estimated that for every 100,000 mobile users, there are more than 2,000,000 tag spaces available every month. Accordingly, it is a primary concern of mobile operators and advertisers to deliver tags to the users of the service that are relevant, engaging and timely.


To this end, “House Ads” are frequently used by mobile operators and are a set of advertisements that promote the mobile operator itself. However, the mobile operator is then unable to directly obtain revenue from the advertisements, tags, links as would occur if a party other than the mobile operator were utilizing this unused available space.


SUMMARY OF THE INVENTION

The present invention enables selection of information such as advertisements, tags, and links to deliver to individuals' communication devices by determining relevant and/or recent url links that may be used as tags when tagging a message, such as SMS or MMS message, being delivered to each user's communication device. The search for relevant and/or recent links is tailored to the users who are sending/receiving the message and is designed to consider several factors including, but not limited to, profile information concerning either the recipient of the communication or, when no information is known about the recipient, the sender of the communication, any commercial relationship between the mobile operator and mobile internet service providers, suitability of a site to mobile internet access generally or based on device capability or rate agreement of sender or receiver of the message and the current popularity of a mobile internet site (for instance, an information provider while a major news story is breaking).





BRIEF DESCRIPTION OF THE DRAWINGS

The invention, together with further objects and advantages thereof, may best be understood by reference to the following description taken in conjunction with the accompanying drawings, wherein like reference numerals identify like elements, and wherein:



FIG. 1 illustrates an exemplary system embodiment in accordance with the invention.



FIG. 2 is a flow chart showing the manner in which the system and method in accordance with the invention fill unused inventory of allocatable tag spaces in messages being delivered to communication devices.



FIG. 3 is a flow chart showing an example of how the system and method in accordance with the invention function.





DETAILED DESCRIPTION

Referring to the accompanying drawings wherein the same reference numerals refer to the same or similar elements, FIG. 2 is a flow chart showing the manner in which the system and method in accordance with some embodiments of the invention fill unused inventory of tag spaces in messages being delivered to communication devices.


The first step 10 is for a user to create and send a digital communication, e.g., a message such as a SMS message, to another user's communication device. Then, this communication is analyzed to determine whether it can be modified to include a tag, or otherwise have a tag associated therewith 12. The analysis of the digital communication to determine whether the message can be modified to include additional information such as advertisements, tags or links and how the modification can be implemented is disclosed in U.S. application Ser. No. 10/555,543 entitled Messaging System and Service which was filed on Mar. 6, 2006, the entire disclosure of which is incorporated herein by reference. If not, then the communication is delivered to the user's device without modification 14, i.e., without an associated tag. However, if the message is determined to allow for inclusion or insertion of a tag, then a determination is made as to whether there is a tag in the inventory of tags 16, e.g., tags from advertisers who have paid to have tags delivered to individuals. This stage is performed by communicating with a database containing tag booking data 18. If there is an available and relevant tag, then one of the tags from the inventory is placed within the communication 20 and the communication is delivered to the individual's communication device 14. Selection of a particular tag to place within the communication may be based on the profile of the individual, the content of the communication, and other known parameters for targeting advertisements to individuals.


If there are no tags in the inventory, which is usually indicative of insufficient tags having been received for the allocatable spaces for the individuals for a given period of time, then a tag feed function is invoked to search for one or more links to include within or otherwise associate with the communication 22. In one embodiment of the invention, even if a tag is selected from an inventory of tags, this tag may be agreed to with an advertiser to be a tag wherein factual content is selected by doing a search according to the invention from the advertiser's web page or from other sources agreed to with the advertiser. This embodiment enables dynamic tags with factual content which is decided upon (selected) just before adding the tag. The search may be performed based on, for example, profile information available concerning the recipient of the communication (possibly contained in one or more user profile databases 24), profile information concerning the sender of the communication, especially if no information (no profile data) is available concerning the recipient but such profile information exists concerning the sender (also possibly contained in database 24), any commercial relationship between the mobile operator managing the individual's communication device and a mobile internet service provider possibly contained in a preferred partner database 26, suitability of a site to mobile internet access generally or based on device capability or rate agreement of the sender or receiver of the message, and the current popularity of a mobile internet site, possibly determined from an internet site index 28. A determination is made as to whether a relevant information to be included in the message has been found 30. Once a relevant information such as an advertisement, link or tag has been found it is inserted within the communication to fill the tag space fully or partly and the communication is delivered 14. It should be noted that a tag is not always something that can be found as such, but it corresponds, for example, to a relevant website, (e.g. a web page having a news about a celebrity buying a new dog). Thereafter a tag is created by creating a link to the site with short description of the link/site. It should also be noted that the length of tag, (i.e. number of characters used for a link and to describe it) is defined based on number of space left in a message (i.e. number of unused space in the message). This size can be used as one selection criteria when selecting a link for tagging (if there is limited amount of characters left then sites with short link to it may be preferred


User profile information may be generated from, for example, preferences (information, likes/dislikes and interests) provided by the user, information regarding purchases made by the user when using the communication system, internet searches conducted when using the communication system, subjects of and information conveyed when sending text messages and emails when using the communication system, and previous advertisements, tags, and/or messages sent from the communication service provider that the user has/has not responded to, among others.


Examples of the manner in which the system and method in accordance with the invention identify and place tags into available tag spaces are as follows:


User A of a mobile communications device sends an SMS to user B of a mobile communications device with the text “Going out tonight?”. The SMS satisfies conditions that allow a tag to be placed within the message prior to delivery and one is sought from the tag inventory. However, all inventory has been exhausted, i.e., there are no more tags to place within the message, or there are no more relevant tags, i.e., although there are still tags in the tag inventory, none of them are deemed relevant to mobile User B. The tagging service recognizes this and invokes a tag feed function. A search is then made on available internet sites, e.g., mobile internet sites, initially attempting to use profiling information known about the intended recipient of the message (User B). However, in this particular example, no profile information is known so a search is then made of the profile information known about the sender (User A), which information exists. The profile information about User A may be stored in one or more databases managed by the mobile service provider and accessed by the server which includes the computer program which performs the search, e.g., user profile database 24.


Profiling information about User A, from user profile database 24, indicates that the user is an avid sports fan with a history of specific interest in the Manchester United soccer club. A mobile internet search is made based upon this information. The search results identify over 200 references, e.g., links, that may be used. However, one result that is particularly popular is a link to an internet site having a breaking news story that a new player is about to sign with the club (this information being available in the internet site index 28). Coincidentally, the company that runs this particular mobile internet site has a commercial relationship with the mobile operator (of the communications network being used by mobile user B) whereby content sold to their users is subject to a revenue sharing agreement (this relationship being stored in the preferred partner database 26). These factors are therefore considered by the searching program, i.e., the popularity of the site and the commercial relationship, when deciding which result to insert into the message being delivered to mobile user B. As a result of these considerations the search engine determines that the link to this site is to be used to fill the tag space at least partly, and then proceeds to enable delivery of the SMS message from User A to User B with this link.


With reference to the foregoing example, it is foreseen that in one embodiment the internet search is performed only from sites that have a commercial relationship with the service provider (e.g. mobile operator).


With reference to FIG. 3, in another example, a tagging entity has made agreements with news/blog/rumor providers P1, P2 and P3 that links to their web page will be added to a message as a tag. The agreement may contain a basic fee for adding a link and another fee for a click-through rate or only a click-through rate is used, or another fixed or variable pricing structure is used. When User A sends a SMS to User B, tag feed functionality is invoked, i.e., the addition of a link tag is requested 32. During this tagging process, a search tool is provided with defined search terms 34 (e.g. based on profile information of the sender or receiver or based on content of the message) and used to search Internet sites (preferably mobile internet sites) of providers P1, P2 and P3 to find the most recent and/or most relevant news or story and a link to the selected provider's site is attached as a tag 36. Relevancy may be based on information about the sender, the receiver, the content of a message, size of unused space of the message and/or the rate agreed with a provider. This embodiment could be used when links are added as tags, i.e., to replace static links with “dynamic links” which are selected based on search and relevancy of the search result. Once a link is selected at 38, it is added to the message at 40.


A computer program may be arranged to perform all of the steps shown in FIGS. 2 and 3. For example, a computer program may be designed to monitor communications to determine whether a tag can be inserted, whether a tag has been booked, whether the size of the unused space of the message permits the addition of a tag and what the size of the tag can be, search for a relevant tag, determine whether a relevant tag has been found, add the tag and continue with or enable the delivery of the modified communication. This program could interact with the tag booking data which may be maintained in a database operated or managed by an advertisement management system operator or the mobile service operator. The program would also interact with the various databases and indexes which provide data about the recipient and/or sender of the communication, data about commercial relationships which may affect the determination of links to include in communications and data about popularity of internet sites.


This computer program may be resident on computer-readable media. Computer-readable medium could be any means that can contain, store, communicate, propagate or transmit a program for use by or in connection with the method, system, apparatus or device. The computer-readable medium can be, but is not limited to (not an exhaustive list), electronic, magnetic, optical, electromagnetic, infrared, or semi-conductor propagation medium. The medium can also be (not an exhaustive list) an electrical connection having one or more wires, a portable computer diskette, a random access memory (RAM), a read-only memory (ROM), an erasable, programmable, read-only memory (EPROM or Flash memory), an optical fiber, and a portable compact disk read-only memory (CDROM). The medium can also be paper or other suitable medium upon which a program is printed, as the program can be electronically captured, via for example, optical scanning of the paper or other medium, then compiled, interpreted, or otherwise processed in a suitable manner, if necessary, and then stored in a computer memory. Also, a computer program or data may be transferred to another computer-readable medium by any suitable process such as by scanning the computer-readable medium.


Having described exemplary embodiments of the invention with reference to the accompanying drawings, it will be appreciated that the present invention is not limited to those embodiments, and that various changes and modifications can be effected therein by one of ordinary skill in the art without departing from the scope or spirit of the invention.

Claims
  • 1. A method comprising: receiving, by a processor, a communication being transmitted to a receiving device, the communication including a first content;determining, by the processor, that a tag can be inserted within the communication, wherein the tag is an advertisement comprising a selectable link to content different than the first content with a short description of the selectable link;checking an available inventory of tags for a tag relevant to the first communication;upon a determination that there is no tag relevant to the communication within the available inventory of tags, creating, by the processor, a new tag relevant to the communication, wherein the new tag is different than the tags in the available inventory of tags and the new tag is created by: analyzing at least one of the first content, profile data about a receiving user of the communication and profile data about a sending user of the communication to determine a search topic;searching on at least one web site that has a commercial relationship with an operator managing communications to the receiving device, for content based upon the search topic, the search resulting in at least one search result;selecting one of the resulting search results; andcreating both a link to the selected search result and a description of the selected search result to comprise the new tag;inserting, by the processor, the new tag into the communication; andtransmitting, by the processor, the communication including the new tag inserted into the communication to the receiving device.
  • 2. The method of claim 1, wherein selecting a search result is based upon a determined popularity of the search result.
  • 3. The method of claim 1, further comprising: determining a number of unused spaces in the communication.
  • 4. The method of claim 3, wherein selecting one of the resulting search results comprises: selecting a search result with a link size that does not exceed the determined number of unused spaces in the communication.
  • 5. The method of claim 3, wherein creating both a link to the selected search result and a description of the selected search result is based upon the determined number of unused spaces in the communication so that the size of both the created link and description do not exceed the determined number of unused spaces in the communication.
  • 6. The method of claim 1, further comprising: delivering the communication to the receiving device.
  • 7. The method of claim 1, wherein the analyzing comprises first analyzing profile data about the receiving user and, upon a determination that profile data about the receiving user is not available, analyzing profile data about the sending user.
  • 8. The method of claim 1, wherein the analyzing comprises searching a user profile database containing data about the receiving user and the sending user.
  • 9. The method of claim 1, wherein the searching on at least one web site that has a commercial relationship with the operator comprises searching at least one preferred partner database containing data about the commercial relationship.
  • 10. The method of claim 9, wherein the data about the commercial relationship includes data about a rate for placement of a tag by an Internet service provider.
  • 11. The method of claim 2, wherein the popularity of the search result is determined by searching an Internet site index.
  • 12. The method of claim 1, wherein the recipient device is a mobile device.
  • 13. The method of claim 1, wherein the communication is received at least partly over a mobile or cellular network.
  • 14. The method of claim 1, wherein the communication is a SMS or MMS message.
  • 15. A non-transitory computer-readable medium containing instruction which, when execute by a computing device, cause the computing device to perform the steps of: receiving a communication being transmitted to a receiving device, the communication including a first content;determining that a tag can be inserted within the communication, wherein the tag is an advertisement comprising a selectable link to content different than the first content with a short description of the selectable link;checking an available inventory of tags for a tag relevant to the first communication;upon a determination that there is no tag relevant to the communication within the available inventory of tags, creating a new tag relevant to the communication, wherein the new tag is different than the tags in the available inventory of tags and the new tag is created by: analyzing at least one of the first content, profile data about a receiving user of the communication and profile data about a sending user of the communication to determine a search topic;searching on at least one web site that has a commercial relationship with an operator managing communications to the receiving device, for content based upon the search topic, the search resulting in at least one search result;selecting one of the resulting search results; andcreating both a link to the selected search result and a description of the selected search result to comprise a new tag;inserting the new tag into the communication;transmitting the communication including the new tag inserted into the communication to the receiving device.
  • 16. The non-transitory computer-readable medium of claim 15, wherein selecting one of the resulting search results is based upon a determined popularity of the search result.
  • 17. The non-transitory computer-readable medium of claim 15, wherein creating the new tag further comprises: determining a number of unused spaces in the communication.
  • 18. The non-transitory computer-readable medium of claim 17, wherein selecting one of the resulting search results comprises: selecting a search result with a link size that does not exceed the determined number of unused spaces in the communication.
  • 19. The non-transitory computer-readable medium of claim 17, wherein creating both a link to the selected search result and a description of the selected search result is based upon the determined number of unused spaces in the communication so that the size of both the created link and description do not exceed the determined number of unused spaces in the communication.
  • 20. The non-transitory computer-readable medium of claim 15, further comprising instructions which, when executed by a computing device, cause the computing device to perform the steps of: delivering the communication to the receiving device.
  • 21. The non-transitory computer-readable medium of claim 15, wherein the analyzing comprises first analyzing profile data about the receiving user and, upon a determination that profile data about the receiving user is not available, analyzing profile data about the sending user.
  • 22. The non-transitory computer-readable medium of claim 15, wherein the analyzing comprises searching a user profile database containing data about the receiving user and the sending user.
  • 23. The non-transitory computer-readable medium of claim 15, wherein the searching on at least one web site that has a commercial relationship with the operator comprises searching at least one preferred partner database containing data about the commercial relationship.
  • 24. The non-transitory computer-readable medium of claim 23, wherein the data about the commercial relationship includes data about a rate for placement of a tag by an Internet service provider.
  • 25. The non-transitory computer-readable medium of claim 16, wherein the popularity of the search result is determined by searching an Internet site index.
  • 26. The non-transitory computer-readable medium of claim 15, wherein the recipient device is a mobile device.
  • 27. The non-transitory computer-readable medium of claim 15, wherein the communication is received at least partly over a mobile or cellular network.
  • 28. The non-transitory computer-readable medium of claim 15, wherein the communication is a SMS or MMS message.
  • 29. A system comprising: a processor; anda memory containing instructions that, when executed, cause the processor to: receive a communication being transmitted to a receiving device;determine that a tag can be inserted within the communication, wherein the tag is an advertisement comprising a selectable link to content different than the first content with a short description of the selectable link;check an available inventory of tags for a tag relevant to the first communication;upon a determination that there is no tag relevant to the communication within the available inventory of tags, create a new tag relevant to the communication, wherein the new tag is different than the tags in the available inventory of tags and the new tag is created by: analyzing at least one of the first content, profile data about a receiving user of the communication and profile data about a sending user of the communication to determine a search topic;searching on at least one web site that has a commercial relationship with an operator managing communications to the receiving device, for content based upon the search topic, the search resulting in at least one search result;selecting one of the resulting search results; andcreating both a link to the selected search result and a description of the selected search result to comprise a new tag;insert the new tag into the communication; andtransmit the communication including the new tag inserted into the communication to the receiving device.
  • 30. The system of claim 29, wherein selecting one of the resulting search results is based upon a determined popularity of the search result.
  • 31. The system of claim 29, wherein creating the new tag further comprises: determining a number of unused spaces in the communication.
  • 32. The system of claim 31, wherein selecting one of the resulting search results comprises: selecting a search result with a link size that does not exceed the determined number of unused spaces in the communication.
  • 33. The system of claim 31, wherein creating both a link to the selected search result and a description of the selected search result is based upon the determined number of unused spaces in the communication so that the size of both the created link and description do not exceed the determined number of unused spaces in the communication.
  • 34. The system of claim 29, wherein the instructions further cause the processor to: deliver the communication to the receiving device.
  • 35. The system of claim 29, wherein the analyzing comprises first analyzing profile data about the receiving user and, upon a determination that profile data about the receiving user is not available, analyzing profile data about the sending user.
  • 36. The system of claim 29, wherein the analyzing comprises searching a user profile database containing data about the receiving user and the sending user.
  • 37. The system of claim 29, wherein the searching on at least one web site that has a commercial relationship with the operator comprises: searching at least one preferred partner database containing data about the commercial relationship.
  • 38. The system of claim 37, wherein the data about the commercial relationship includes data about a rate for placement of a tag by an Internet service provider.
  • 39. The system of claim 30, wherein the popularity of the search result is determined by searching an Internet site index.
  • 40. The system of claim 29, wherein the recipient device is a mobile device.
  • 41. The system of claim 29, wherein the communication is received at least partly over a mobile or cellular network.
  • 42. The system of claim 29, wherein the communication is a SMS or MMS message.
Priority Claims (1)
Number Date Country Kind
0803273.2 Feb 2008 GB national
CROSS-REFERENCE TO RELATED APPLICATIONS

This application claims priority under 35 USC 119 of U.S. Provisional Patent Application No. 60/999,004 filed Oct. 15, 2007, and U.K. Patent Application GB 0803273.2 filed Feb. 25, 2008, the entire disclosure of each of which is incorporated herein by reference.

US Referenced Citations (241)
Number Name Date Kind
5408519 Pierce et al. Apr 1995 A
5459306 Stein et al. Oct 1995 A
5600364 Hendricks et al. Feb 1997 A
5613213 Naddell et al. Mar 1997 A
5678179 Turcotte et al. Oct 1997 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
6055512 Dean et al. Apr 2000 A
6055513 Katz et al. Apr 2000 A
6057872 Candelore May 2000 A
6097942 Laiho Aug 2000 A
6253189 Feezell et al. Jun 2001 B1
6286005 Cannon Sep 2001 B1
6334145 Adams et al. Dec 2001 B1
6338044 Cook et al. Jan 2002 B1
6345279 Li et al. Feb 2002 B1
6381465 Chern et al. Apr 2002 B1
6393407 Middleton, III et al. May 2002 B1
6405243 Nielsen Jun 2002 B1
6408309 Agarwal Jun 2002 B1
6446261 Rosser Sep 2002 B1
6502076 Smith Dec 2002 B1
6684249 Frerichs et al. Jan 2004 B1
6690394 Harui Feb 2004 B1
6698020 Zigmond et al. Feb 2004 B1
6718551 Swix et al. Apr 2004 B1
6738978 Hendricks et al. May 2004 B1
6795808 Strubbe et al. Sep 2004 B1
6886000 Aggarwal et al. Apr 2005 B1
6920326 Agarwal et al. Jul 2005 B2
6990462 Wilcox et al. Jan 2006 B1
7039599 Merriman et al. May 2006 B2
7072947 Knox et al. Jul 2006 B1
7149537 Kupsh et al. Dec 2006 B1
7168084 Hendricks et al. Jan 2007 B1
7203684 Carobus et al. Apr 2007 B2
7280818 Clayton Oct 2007 B2
7356477 Allan et al. Apr 2008 B1
7370002 Heckerman et al. May 2008 B2
7539652 Flinn et al. May 2009 B2
7558559 Alston Jul 2009 B2
7669212 Alao et al. Feb 2010 B2
7685019 Collins Mar 2010 B2
7730017 Nance et al. Jun 2010 B2
7734632 Wang Jun 2010 B2
7747676 Nayfeh et al. Jun 2010 B1
7870576 Eldering Jan 2011 B2
7882518 Finseth et al. Feb 2011 B2
7903099 Baluja Mar 2011 B2
7912843 Murdock et al. Mar 2011 B2
7984014 Song et al. Jul 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
8380562 Toebes et al. Feb 2013 B2
20010044739 Bensemana Nov 2001 A1
20010047272 Frietas et al. Nov 2001 A1
20010051925 Kang Dec 2001 A1
20020006803 Mendiola et al. Jan 2002 A1
20020016736 Cannon et al. Feb 2002 A1
20020019829 Shapiro Feb 2002 A1
20020021809 Salo et al. Feb 2002 A1
20020052781 Aufricht et al. May 2002 A1
20020075305 Beaton et al. Jun 2002 A1
20020077130 Owensby Jun 2002 A1
20020078147 Bouthors et al. Jun 2002 A1
20020083411 Bouthors et al. Jun 2002 A1
20020099842 Jennings et al. Jul 2002 A1
20020120498 Gordon et al. Aug 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
20020165773 Natsumo et al. Nov 2002 A1
20020175935 Wang et al. Nov 2002 A1
20030003935 Vesikivi 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
20030083931 Lang May 2003 A1
20030101454 Ozer et al. May 2003 A1
20030126015 Chan et al. Jul 2003 A1
20030126146 Var Der Riet Jul 2003 A1
20030130887 Nathaniel Jul 2003 A1
20030154300 Mostafa Aug 2003 A1
20030182567 Barton et al. Sep 2003 A1
20030188017 Nomura Oct 2003 A1
20030191689 Bosarge et al. Oct 2003 A1
20030197719 Lincke et al. Oct 2003 A1
20040003398 Donian et al. Jan 2004 A1
20040043777 Brouwer et al. Mar 2004 A1
20040045029 Matsuura Mar 2004 A1
20040054576 Kanerva et al. Mar 2004 A1
20040068435 Braunzell Apr 2004 A1
20040133480 Domes Jul 2004 A1
20040136358 Hind et al. Jul 2004 A1
20040158858 Paxton et al. Aug 2004 A1
20040185883 Rukman Sep 2004 A1
20040192359 McRaild et al. Sep 2004 A1
20040203761 Baba et al. Oct 2004 A1
20040203851 Vetro et al. Oct 2004 A1
20040204133 Andrew et al. Oct 2004 A1
20040209649 Lord Oct 2004 A1
20040240649 Goel Dec 2004 A1
20040259526 Goris et al. Dec 2004 A1
20050010641 Staack Jan 2005 A1
20050021397 Cui et al. Jan 2005 A1
20050060425 Yeh et al. Mar 2005 A1
20050071224 Fikes et al. Mar 2005 A1
20050075929 Wolinsky et al. Apr 2005 A1
20050125397 Gross et al. Jun 2005 A1
20050138140 Wen et al. Jun 2005 A1
20050228680 Malik Oct 2005 A1
20050228797 Koningstein et al. Oct 2005 A1
20050229209 Hildebolt et al. Oct 2005 A1
20050239495 Bayne Oct 2005 A1
20050239504 Ishii et al. Oct 2005 A1
20050249216 Jones Nov 2005 A1
20050267798 Panara Dec 2005 A1
20050273465 Kimura Dec 2005 A1
20050273833 Soinio Dec 2005 A1
20050289113 Bookstaff Dec 2005 A1
20060031327 Kredo Feb 2006 A1
20060040642 Boris et al. Feb 2006 A1
20060048059 Etkin Mar 2006 A1
20060059133 Moritani Mar 2006 A1
20060068845 Muller et al. Mar 2006 A1
20060075425 Koch et al. Apr 2006 A1
20060095511 Munarriz et al. May 2006 A1
20060117378 Tam et al. Jun 2006 A1
20060123014 Ng Jun 2006 A1
20060129455 Shah Jun 2006 A1
20060141923 Goss Jun 2006 A1
20060161520 Brewer et al. Jul 2006 A1
20060167747 Goodman et al. Jul 2006 A1
20060168616 Candelore Jul 2006 A1
20060194595 Myllynen et al. Aug 2006 A1
20060200460 Meyerzon et al. Sep 2006 A1
20060200461 Lucas et al. Sep 2006 A1
20060206586 Ling et al. Sep 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
20060286963 Koskinen et al. Dec 2006 A1
20060286964 Polanski et al. Dec 2006 A1
20060288124 Kraft et al. Dec 2006 A1
20070004333 Kavanti Jan 2007 A1
20070011344 Paka et al. 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
20070037562 Smith-Kerker et al. Feb 2007 A1
20070047523 Jiang Mar 2007 A1
20070061195 Liu et al. Mar 2007 A1
20070061300 Ramer et al. Mar 2007 A1
20070067215 Agarwal et al. Mar 2007 A1
20070072631 Mock et al. Mar 2007 A1
20070074262 Kikkoji et al. Mar 2007 A1
20070078712 Ott et al. Apr 2007 A1
20070083602 Heggenhougen et al. Apr 2007 A1
20070088687 Bromm et al. Apr 2007 A1
20070088801 Levkovitz et al. Apr 2007 A1
20070088851 Levkovitz et al. Apr 2007 A1
20070094066 Kumar et al. Apr 2007 A1
20070100651 Ramer et al. May 2007 A1
20070100805 Ramer et al. May 2007 A1
20070105536 Tingo, Jr. May 2007 A1
20070113243 Brey May 2007 A1
20070117571 Musial May 2007 A1
20070118592 Bachenberg May 2007 A1
20070136457 Dai et al. Jun 2007 A1
20070149208 Syrbe et al. Jun 2007 A1
20070156534 Lerner et al. Jul 2007 A1
20070180147 Leigh Aug 2007 A1
20070192409 Kleinstern et al. Aug 2007 A1
20070198485 Ramer et al. Aug 2007 A1
20070208619 Branam et al. Sep 2007 A1
20070214470 Glasgow et al. Sep 2007 A1
20070233671 Oztekin et al. Oct 2007 A1
20070244750 Grannan et al. Oct 2007 A1
20070260624 Chung et al. Nov 2007 A1
20070288950 Downey et al. Dec 2007 A1
20070290787 Fiatal et al. Dec 2007 A1
20080004046 Mumick et al. Jan 2008 A1
20080004958 Ralph et al. Jan 2008 A1
20080013537 Dewey et al. Jan 2008 A1
20080032703 Krumm et al. Feb 2008 A1
20080032717 Sawada et al. Feb 2008 A1
20080040175 Dellovo Feb 2008 A1
20080052158 Ferro et al. Feb 2008 A1
20080065491 Bakman Mar 2008 A1
20080070579 Kankar et al. Mar 2008 A1
20080071875 Koff et al. Mar 2008 A1
20080071929 Motte et al. Mar 2008 A1
20080082686 Schmidt et al. Apr 2008 A1
20080091796 Story Apr 2008 A1
20080133344 Hyder et al. Jun 2008 A1
20080140508 Anand et al. Jun 2008 A1
20080228568 Williams et al. Sep 2008 A1
20080243619 Sharman et al. Oct 2008 A1
20080249832 Richardson et al. Oct 2008 A1
20080262927 Kanayama et al. Oct 2008 A1
20080271068 Ou et al. Oct 2008 A1
20080281606 Kitts et al. Nov 2008 A1
20080288476 Kim et al. Nov 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
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
20090275315 Alston Nov 2009 A1
20090286520 Nielsen 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
20110106840 Barrett et al. May 2011 A1
20110209067 Bogess et al. Aug 2011 A1
20110276401 Knowles et al. Nov 2011 A1
Foreign Referenced Citations (110)
Number Date Country
1015704 Jul 2005 BE
199 41 461 Mar 2001 DE
10061984 Jun 2002 DE
1061465 Dec 2000 EP
1 073 293 Jan 2001 EP
1 109 371 Jun 2001 EP
1107137 Jun 2001 EP
1109371 Jun 2001 EP
2 369 218 May 2002 EP
1 220 132 Jul 2002 EP
1 239 392 Sep 2002 EP
1280087 Jan 2003 EP
1 365 604 Nov 2003 EP
1 408 705 Apr 2004 EP
1 455 511 Sep 2004 EP
1509024 Feb 2005 EP
1528827 May 2005 EP
1 542 482 Jun 2005 EP
1 587 332 Oct 2005 EP
1 615 455 Jan 2006 EP
1 633 100 Mar 2006 EP
1 677 475 Jul 2006 EP
1772822 Apr 2007 EP
2343051 Apr 2000 GB
2372867 Sep 2002 GB
2 406 996 Apr 2005 GB
2406996 Apr 2005 GB
2 414 621 Nov 2005 GB
2414621 Nov 2005 GB
2424546 Sep 2006 GB
2002-140272 May 2002 JP
2007-087138 Apr 2007 JP
2007087138 Apr 2007 JP
2007-199821 Aug 2007 JP
2007199821 Aug 2007 JP
20060011760 Jul 2004 KR
WO 9624213 Aug 1996 WO
9821713 May 1998 WO
0000916 Jan 2000 WO
0030002 May 2000 WO
WO 0044151 Jul 2000 WO
WO 0122748 Mar 2001 WO
WO 0122748 Mar 2001 WO
WO 0131497 May 2001 WO
0144977 Jun 2001 WO
WO 0152161 Jul 2001 WO
0163423 Aug 2001 WO
WO 0157705 Aug 2001 WO
WO 0158178 Aug 2001 WO
WO 0165411 Sep 2001 WO
WO 0169406 Sep 2001 WO
WO 0171949 Sep 2001 WO
WO 0172063 Sep 2001 WO
WO 0191400 Nov 2001 WO
WO 0193551 Dec 2001 WO
WO 0197539 Dec 2001 WO
0209431 Jan 2002 WO
WO 0231624 Apr 2002 WO
0244989 Jun 2002 WO
WO 02054803 Jul 2002 WO
WO 02054803 Jul 2002 WO
WO 02069585 Sep 2002 WO
WO 02069651 Sep 2002 WO
WO 02075574 Sep 2002 WO
02086664 Oct 2002 WO
WO 02084895 Oct 2002 WO
02096056 Nov 2002 WO
WO 03015430 Feb 2003 WO
WO 03019845 Mar 2003 WO
WO 03024136 Mar 2003 WO
WO 03049461 Jun 2003 WO
WO 03088690 Oct 2003 WO
WO 2004084532 Sep 2004 WO
WO 2004086791 Oct 2004 WO
2004100470 Nov 2004 WO
WO 2004100470 Nov 2004 WO
WO 2004100470 Nov 2004 WO
WO 2004100521 Nov 2004 WO
WO 2004102993 Nov 2004 WO
WO 2004104867 Dec 2004 WO
2005020578 Mar 2005 WO
WO 2005029769 Mar 2005 WO
2005073863 Aug 2005 WO
WO 2005076650 Aug 2005 WO
2006005001 Jan 2006 WO
WO 2006002869 Jan 2006 WO
WO 2006005001 Jan 2006 WO
WO 2006016189 Feb 2006 WO
2006024003 Mar 2006 WO
WO 2006027407 Mar 2006 WO
WO 2006040749 Apr 2006 WO
WO 2006093284 Sep 2006 WO
WO 2006119481 Nov 2006 WO
2007001118 Jan 2007 WO
2007002025 Jan 2007 WO
2007060451 May 2007 WO
2007091089 Aug 2007 WO
2007103263 Sep 2007 WO
WO 2008013437 Jan 2008 WO
2008024852 Feb 2008 WO
2008045867 Apr 2008 WO
WO 2008045867 Apr 2008 WO
2008147919 Dec 2008 WO
WO 2008147919 Dec 2008 WO
2009009507 Jan 2009 WO
2009032856 Mar 2009 WO
2009061914 May 2009 WO
2009077888 Jun 2009 WO
2009099876 Aug 2009 WO
2009158097 Dec 2009 WO
Non-Patent Literature Citations (43)
Entry
Definition of “user” at the Free On-Line Dictionary of Computing, Denis Howe 2010.
definition of “message” at Random house Dictionary, Random House 2011.
definition of “relevant”, World English Dictionary (1998).
definition of “dynamic”, SCience Dictionary (2002).
Search Report under Section 17 dated Jul. 7, 2008 in related U.K. Application GB 0803273.2.
Examination Report dated Jun. 17, 2009 issued in counterpart U.K. Application No. GB0803273.2 by the U.K. Intellectual Property Office (4 pages).
International Search Report and Written Opinion of the International Searching Authority mailed Feb. 11, 2009, issued by the International Searching Authority in related International Application PCT/EP2008/063839 (11 pages).
“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)., Jul. 24, 2006.
“Combined Search and Examination Report”, for United Kingdom Patent Application No. GB 0816228.1 dated Jan. 2009, Jan. 6, 2009.
“Combined Search and Examination Report dated Mar. 7, 2008”, for United Kingdom Patent Application No. GB 0721863.9, Mar. 7, 2008.
“Communication (Combined Search and Examination Report under Sections 17 and 18(3)) dated Jan. 30, 2009 issued from the United Kingdom Patent Office”, in related United Kingdom Application No. GB 0818145.5 (8 pages), Jan. 30, 2009.
“Communication (European Search Report) dated Jun. 26, 2008”, in European Patent Application No. EP 08101394, Jun. 26, 2008.
“Communication (European Search Report) dated Oct. 17, 2008 issued by the European Patent Office”, in counterpart European Patent Application EP 08156763, Oct. 17, 2008.
“Communication (International Search Report along with Written Opinion of International Searching Authority) mailed Oct. 8, 2008 issued by the International Searching Authority”, in counterpart International Application PCT/EP 2008/056342, Oct. 8, 2008.
“Communication (Notification Concerning Transmittal of International Preliminary Report on Patentability, International Preliminary Report on Patentability, and Written Opinion of the International Searching Authority)”, issued in connection with related International Application PCT/EP 2008/051489 and mailed on Sep. 24, 2009 (6 pages), Sep. 24, 2009.
“Communication (Search Report under Section 17 along with Examination Report under Section 18(3)) dated Oct. 6, 2008 issued by the United Kingdom Intellectual Property Office”, in counterpart U.K. Application GB 0809321.3, Oct. 6, 2008.
“Communication Pursuant to Article 94(3) EPC (European Examination Report) dated Oct. 23, 2008”, issued in counterpart European Patent Application No. EP 08101394.8-1238, Oct. 23, 2008.
“Examination Report”, for counterpart European Patent Applicaiton No. 08153257.4 issued Jun. 2, 2009.
“Examination Report dated Sep. 11, 2009”, for European Patent Application No. EP 08159355.0, Sep. 11, 2009.
“International Preliminary Report on Patentability and Written Opinion issued Nov. 24, 2009”, in International Application PCT/EP 2008/056342 ,Nov. 24, 2009.
“International Search Report”, for International Application No. PCT/FI 2006/050455, dated Jul. 25, 2007.
“International Search Report and Written Opinion mailed on Aug. 26, 2011”, for PCT/US 2011/034927 titled “Content Delivery Based on User Terminal Events,” to Apple Inc., Aug. 26, 2011.
“International Search Report and Written Opinion of the International Search Authority mailed Jun. 19, 2009”, for International Application No. PCT/EP 2008/056069, Jun. 19, 2009.
“International Search Report mailed Mar. 24, 2009”, in related PCT International Application No. PCT/EP 2008/063326 (4 pages), Mar. 24, 2009.
“Notice of Allowance dated Apr. 29, 2011”, U.S. Appl. No. 11/888,680, Apr. 29, 2011, 13 pages.
“Office Action dated Mar. 31, 2011 issue by the U.S. Patent Office”, in related U.S. Appl. No. 12/080,124 (29 pages), Mar. 31, 2011.
“Office Action issued from the USPTO dated Aug. 20, 2009”, issued in related U.S. Appl. No. 12/075,593 (14 pages), Aug. 20, 2009.
“Office Action issued Mar. 17, 2010”, in related U.S. Appl. No. 12/075,593 (11 pages), Mar. 17, 2010.
“Office Action Issued Oct. 15, 2010 by the U.S. Patent Office”, in related U.S. Appl. No. 12/080,124 (28 pages), Oct. 15, 2010.
“U.K. Search Report under Section 17 dated Oct. 23, 2007”, in U.K. Application No. 0712280.7, Oct. 23, 2007.
“Written Opinion of the International Searching Authority mailed Mar. 24, 2009 issued from the International Searching Authority”, in related PCT International Application No. PCT/EP 2008/063326 (5 pages), Mar. 24, 2009.
“XP002456252—Statement in Accordance with the Notice from the European Patent Office dated Oct. 1, 2007”, concerning business methods (OJ Nov. 2007; p. 592-593), Nov. 1, 2007, 592-593.
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.
Mueller, Milton , “Telecommunication Access in Age of Electronic Commerce: Toward a Third-Generation Service Policy”, Nov. 1996, HeinOnline, 49. Fed. Comm L.J., Nov. 1, 1996, 655-665.
Perkins, Ed , “When to buy airfare”, http://www.smartertrael.com/travel-advice/when-to-buy-airfare.html?id=1628038, Nov. 21, 2006 (4 pages), Nov. 21, 2006.
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.
“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.
Related Publications (1)
Number Date Country
20090099906 A1 Apr 2009 US
Provisional Applications (1)
Number Date Country
60999004 Oct 2007 US