Systems and methods for providing anonymized user profile data

Information

  • Patent Grant
  • 8639920
  • Patent Number
    8,639,920
  • Date Filed
    Tuesday, May 11, 2010
    14 years ago
  • Date Issued
    Tuesday, January 28, 2014
    10 years ago
Abstract
Embodiments facilitate confidential and secure sharing of anonymous user profile data to improve the delivery of customized content. Embodiments of the invention provide a data appliance to an entity such as a business to convert profile data about the business's customers into anonymous identifiers. A similar data appliance is provided to a content provider in one embodiment to generate identifiers for its user profile data. Because the anonymous identifiers are generated with the same anonymization method, identical identifiers are likely generated from profile data of the same users. Therefore, the identifiers can be used to anonymously match the customers of the business to the users of the content provider. Therefore, data can be shared to improve customized content such as advertisements that the business wishes to place with the content provider without requiring the business to disclose customer data in an unencrypted form, and any non-matched data can remain confidential.
Description
BACKGROUND

1. Field


This disclosure relates in general to computer data processing, and in particular to computer based systems and methods for providing anonymized user profile data.


2. Description Of The Related Art


In the online environment, the effective delivery of customized content is dependent on the quality of known data about the intended consumers of such content. For example, the effectiveness of an advertisement (“ad”) is enhanced when it is delivered to a person whose attributes and/or other recorded past actions indicate possible interest in the content of the ad. While user profile data may be used to customize the delivered content, the sharing of such data is hindered by reluctance among entities that hold such data out of competitive and privacy concerns. For example, while an advertiser may benefit from improved ad customization as a result of sharing information about its customers with a content publisher from which it wishes to purchase ads, the advertiser is typically reluctant to share such data.


SUMMARY OF THE DISCLOSURE

Embodiments of the disclosure are directed to computer based systems and methods for sharing user profile data in an anonymized manner. Embodiments facilitate confidential and secure sharing of de-personalized and/or anonymous customer profile data among entities to improve the delivery of customized content. For example, embodiments of the invention provide a data appliance to an entity such as a business to convert profile data about the business's customers into anonymous identifiers. A similar data appliance is provided to a content provider in one embodiment to generate identifiers for its user profile data. A central server connected to the data appliances facilitate the sharing of the anonymous identifiers across data networks. In one embodiment, because the anonymous identifiers are generated with the same anonymization method, identical identifiers are likely generated from profile data of the same users. Therefore, the identifiers can be used to anonymously match the customers of the business to the users of the content provider. As such, the matched data can be shared to improve the delivery of customized content such as advertisements that the business wishes to place with the content provider without requiring the business to disclose customer data in an unencrypted form, and any non-matched data can remain confidential.


One embodiment of the invention is system for anonymously sharing user profile data among a plurality of entities. The system comprises a plurality of data appliances located at a plurality of entities with user profile data and a server configured to communicate with each of the plurality of data appliances to facilitate sharing of user profile data among the plurality of data appliances. The plurality of data appliances further includes a first data appliance that is configured to: receive, from a first entity, first user profile data for a first group of users associated with the first entity, the first user profile data including names and addresses of the first group of users; encrypt the first user profile data for each of the first group of users into a first encrypted identifier; and send the first encrypted identifiers to the server. The plurality of data appliances also includes a second data appliance that is configured to: receive, from a second entity, second user profile data for a second group of users associated with the second entity, the second user profile data including names and addresses of the second group of users; encrypt the second user profile data for each of the second group of users into a second encrypted identifier with the same encryption used by the first data appliance, so that common user profile data between the first and second user profile data are converted into identical encrypted identifiers; receive from the server the first encrypted identifiers; and locate identical identifiers from among the first and second encrypted identifiers to generate an anonymous list of common users between the first and second groups of users, whereby the list can be used to customize content provided by the second entity to the users associated with the first entity.


Another embodiment is a system for anonymously sharing user profile data among a plurality of entities. The system comprises a plurality of data appliances and a server configured to receive data from and transmit data to the plurality of data appliances. The plurality of data appliances comprises a first data appliance that is configured to: receive, from a first entity, first personal identifiable information related to a first group of persons; transform the first personally identifiable information into first encrypted data via an encryption process, the first encrypted data comprising an identifier for each of the first group of persons; and send the encrypted data to the server. The plurality of data appliances also comprises a second data appliance that is configured to: receive, from a second entity, second personally identifiable information related to a second group of persons; transform the second personally identifiable information into second encrypted data with the encryption process used by the first data appliance, the second encrypted data comprising an identifier for each of the second group of persons; receive from the server the first encrypted data; and use the first and second encrypted data to anonymously generate list data related to common persons between the first and second groups of persons, so that the list data can be used to customize information provided by the second entity at a direction of the first entity.


Yet another embodiment is a method for sharing anonymized user profile data. The method comprises: receiving at a first data appliance, first personally identifiable information related to a first group of persons; transforming the first personally identifiable information into first encrypted data via an encryption process, the first encrypted data comprising an identifier for each of the first group of persons; transmitting the first encrypted data from the first encrypted data to a second data appliance; receiving, at the second data appliance, second personally identifiable information related to a second group of persons; transforming the second personally identifiable information into second encrypted data with the encryption process, the second encrypted data comprising an identifier for each of the second group of persons; and using the first and second encrypted data to anonymously generate list data related to common persons between the first and second groups of persons, so that the list data can be used to customize information provided by the second entity at a direction of the first entity.





BRIEF DESCRIPTION OF THE DRAWINGS

Specific embodiments of the invention will now be described with reference to the following drawings, which are intended to illustrate embodiments of the invention, but not limit the invention:



FIG. 1 is a flow diagram illustrating one embodiment of the marketing data sharing architecture;



FIG. 2 is a flow diagram illustrating the process of loading and matching data with the user ID pass-through feature according to one embodiment;



FIG. 3 is a flow diagram illustrating one embodiment of a hybrid real time targeting model;



FIG. 4 is a flow diagram illustrating one embodiment for data sharing with a data partner;



FIG. 5 is a flow diagram illustrating another embodiment for data sharing with a data partner;



FIG. 6 shows an example audience select tool in accordance with one embodiment; and



FIG. 7 is a flow diagram illustrating the use of data sharing to generate customized email marketing in accordance with one embodiment.



FIGS. 8A and 8B show examples of audience reports output by the system in accordance with one embodiment.



FIG. 9 is block diagram of an example computing system of an embodiment.





DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

Embodiments of the invention will now be described with reference to the accompanying figures, wherein like numerals refer to like elements throughout. The terminology used in the description presented herein is not intended to be interpreted in any limited or restrictive manner, simply because it is being utilized in conjunction with a detailed description of certain specific embodiments of the invention. Furthermore, embodiments of the invention may include several novel features, no single one of which is solely responsible for its desirable attributes or which is essential to practicing the inventions herein described.


System Overview


The effectiveness of online advertising has been shown to improve significantly when an advertisement (“ad”) is customized for a consumer based on known data about that consumer. Ad customization can be performed by either the sellers or buyers of online advertising. Sellers of online advertising include (but may not be limited to) web publishers, portals and ad networks. Buyers of online advertising are advertisers and their agencies. The amount of information that parties have about the consumers they interact with differs based on the type of business they are. An advertiser may have an established database of its customers, both online and offline, that collects information about the consumer's interaction with that advertiser's business. Additionally, an online publisher that requires its users to login to its website as members may have detailed information on each user member. By contrast, an ad network may not have a simple way of collecting customer data other than via observed behaviors.


Regardless of the relative volume of known consumer profile data, for reasons of existing privacy policies and/or for competitive and strategic considerations, companies are traditionally reluctant to share consumer data without the existence of some trusted third party that can protect the confidential information of each contributor. For example, an advertiser A may share a number of common customers with a publisher B. Advertiser A may wish to only target its ads to those common customers on publisher B's website. One way of to achieve this is for A to send B a complete list of its customers and have B match the list against its own member list. However, Advertiser A may be reluctant to share such data with Publisher B for privacy, competitive and strategic reasons. However, if C, a trusted third party, took responsibility for merging the consumer data from Advertiser A and from Publisher B, identifying the overlap, and providing the customization data back to Publisher B in a manner through which consumer identifying information is anonymized, then the parties may be more inclined to use their known data for ad customization. In this manner, A will ensure that B will only know the common users/customers without seeing all of A's customers. If this capability could be made available across a large number of ad sellers, then an advertiser could make highly targeted ad buys across multiple ad sellers.


Embodiments of the invention facilitate confidential and secure sharing of de-personalized and/or anonymous customer profile data between companies for the purposes of improving ad targeting. Companies that would share such data could include buyers of media (e.g., advertiser), sellers of media (e.g., publisher, portal, or ad network), multiple advertisers (in a co-operative type model), or multiple sellers of media. Embodiments of the invention enable an entity to de-personalize and/or anonymize its own consumer data and match that data to a third party's consumer data via anonymous keys. As such, the user profile data can be shared to improve ad customization without the need to disclose sensitive data in an unencrypted form.


Embodiments of the invention comprise a network of marketing data appliances (MDAs) that connect to each other to provide data matches among various entities. The MDAs perform data standardization and encryption to de-personalize the data. An MDA can also use an anonymous key, common to all MDAs to match similar data among MDAs. An entity that wishes to participate in the sharing of data can install the MDA within its secured network environment or can use a central installation. Alternatively, an entity may also share data using MDAs that are hosted off-site via secured transmission channels. The MDAs may be interconnected to one another, as well as to one or more marketing bureaus that serve as hubs that support the anonymization and matching processes performed at the local MDAs. In one or more embodiments, marketing bureaus are data processing entities with computing capacity (computer servers) that can handle matching and anonymization functions. Additional details relating to marketing bureaus will be provided later in the specification.


Embodiments of the data sharing system are beneficial in several ways. First, they enable media buyers to target against their own criteria instead of or complementary to the media's available criteria, thereby reducing media waste and increasing the precision and response of their advertising. Second, they enable media buyers to focus their media purchases without the need to disclose confidential user profile data about their customers. Third, the various embodiments create a virtual network that links disparate entities with potentially different data formats and provides a standardized way to exchange ad targeting and/or other relevant data. Finally, the various embodiments create a dynamic data accounting method that enables both media buyers and sellers to instantly view the number of targeted users at various publisher or portal sites through the use of an audience selector tool.


Although this disclosure provides example embodiments for Internet or online advertising, embodiments of the invention are not so limited to those environments. For example, embodiments of the invention can be implemented in any environment with addressable devices. For example, embodiments may be used to target advertisements served to wireless devices such as cell phones and PDAs, cable television and satellite TV set top boxes, gaming consoles, and other portable devices such as music players and electronic book readers. Embodiments of the invention may be used in numerous environments, even those without “addressable” systems or those in “non-digital” media. Embodiments can be used in non-digital environments such that anonymized marketing data can be used to conduct, for example, phone or postal mail advertising campaigns. This is because, in addition to real-time request/response handling for ad and/or content customization, some embodiments provide productionized and efficient merge, purge, and data enhancement capabilities that can function in “batch” mode of operations, which can be performed daily/nightly/weekly or incrementally (every n hours).


System Architecture and Process



FIG. 1 depicts the components of the data sharing architecture. Although a marketing bureau 102 is shown as connecting an advertiser 104 to a portal or publisher 106, in FIG. 1, the marketing bureau 102 can connect other entities shown in the figure as well. The advertiser 104 and the portal or publisher 106 are highlighted in FIG. 1 as examples. As shown, the advertiser 104 has a member database 114 and the portal or publisher 106 has its own member database 116 as well.


Anonymization of User Profile Data Provided by Advertisers


In one embodiment, to enable anonymized data sharing through the marketing bureau 102, the advertiser 104 installs a MDA 108 within its own environment, which may be protected by a network firewall. The bureau 102 may host a computer server that acts as a central repository for all information about each participating entity's address market. The information may include market segment data, for example. As described below, the data sharing architecture includes a network of interconnected MDAs that enable all connected entities to share data. The anonymized sharing and data matching process proceeds as follows. In step 1, the advertiser 104 may upload, from its member database 114, any (1) personally identifiable information (PII) data such as member names, postal addresses, and (2) additional data such as segments onto the MDA 108. The uploaded data will be referred to as marketing data in this disclosure, and marketing data may include other non-PII data such as IP addresses, email addresses, cookie IDs, etc. In other embodiments, the PII may include email addresses, user IDs, social security numbers, IP addresses, phone numbers, etc. As used herein, “profile data,” “customer data,” and “consumer data” are used to refer generally to both PII and marketing data.


In step 2, as these records are being uploaded, the MDA 108 may derive bureau IDs (BIDs) by encrypting, through for example a forward encrypting hash algorithm such as SHA, some or all of the member's PII, e.g., name and postal address information. In another embodiment, a proprietary hash algorithm is used. For example, a name “John Doe” and an address “123 Main St.” may be hashed into a resultant BID string “A348BEF6” so that the name and address cannot be deciphered from reading the resultant string. Once the BIDs are derived, the encryption process then purges the uploaded names, postal addresses, and other PII data. Because in various embodiments the encryption hashing algorithm is not data dependent, matching may be performed on other member/customer profile data such as membership IDs, vehicle IDs, cookie IDs, phone numbers, and/or email addresses. Any of the identifiable information that is used as input for the match, like a cookie ID or an email address, is subsequently converted into a BID. In one embodiment, if only name and ZIP code are provided, the MDA 108 first attempts to locate the complete postal address using the name and ZIP code and then performs the hashing process.


In one embodiment, the encryption process of step 2 takes place while the uploaded marketing data records are still in volatile memory such as in the MDA's random access memory (RAM). As such, sensitive records containing PII such as names and addresses are not placed in long term storage of the MDA. In one embodiment, the MDA does not need to use the full set of marketing segment data from the marketing bureau server in the encryption process.


After the encryption processing has completed, the MDA 108 stores records that include BIDs and the advertiser appended custom segment data and/or generic segment data appended by the MDA. For example, if the advertiser 104 were a credit reporting agency, it might append custom segment data that indicates whether a consumer is a free trial, paid, or cancelled member of its credit reporting subscription service. Also, the MDA 108 may append generic marketing data (segments) from other sources. The appended marketing segment data may be selected by the advertiser. For example, while an advertiser may not have its own custom segment data, it may instruct the MDA to append segment data identifying “New Parents” or “New Homeowners.” The MDA 108 may use a localized copy of marketing segment data that is periodically updated by a remote server. The localized copy may be encrypted.


If any of the advertiser's appended data is deemed sensitive, the MDA 108 may apply additional security hashing to the appended data to provide a further tier of protection. The MDA may be configured so that no personally identifiable information (PII) is passed outside of the advertiser's environment.


In step 3, in one embodiment, the now anonymized advertiser's segment data is then propagated, through the marketing bureau 102, to some or all of participating entities that are connected to the data sharing network, including the publisher, portal, or ad network from which the example advertiser may wish to buy media. In one embodiment, steps 1-3 as described above may be performed as part of a nightly batch processing job. However, one or more the steps may be performed in real time or as part of a batch job executed at different intervals (e.g. weekly). Once the initial matching and propagation steps are accomplished upon an entity joining the data sharing network, subsequent matching and propagation may be performed on a smaller subset profile data within the member database that includes recent changes.


Embodiments of the invention also allow advertisers to identify some or all of its uploaded marketing data as the ideal or targeted modeling criteria for expanded or “look-alike” matching. For example, an advertiser may specify that ZIP codes be used as an expanded matching criterion, so that the matching process performed by the MDA located at the publisher, portal and/or ad network as further described below returns matching results with additional persons who may live in or near the ZIP code areas of those consumers identified within the advertiser's data. Similarly, an advertiser may select one or more segments on which an expanded matching may be performed (e.g. matching on a “New Parents” or “New Homeowners” segment). In one embodiment, the look-alike matching uses demographic and consumer attributes (e.g. age, gender, income, purchase preferences, etc.) to identify additional persons who are similar to those in the matched results.


In one embodiment or more embodiments, an advertiser can identify ideal or targeted criteria through one of two methods. First, an advertiser can identify ideal or targeted criteria by inserting data flags into the uploaded marketing data records as part of the upload process described above. The uploaded data records may be termed a “primary list” in one or more embodiments. Second, an advertiser can provide a secondary list in conjunction with the primary list, with the secondary list providing a list of records on the primary list that have the ideal or targeted criteria.


Anonymization of User Profile Data Provided by Publishers and Portals


In one embodiment, similar to the advertisers, publishers and portals also install MDAs locally and possibly within their firewalls. In one embodiment, similar to steps 1-3, the portal or publisher 106 undertakes step 4 to upload its subscriber or member file onto an MDA 110 and in step 5 a similar encryption process takes place within MDA 110. The subscriber or member file may include marketing data, which may include PII data and other additional data such as segment data. In one embodiment, a forward encrypting hash algorithm (e.g., SHA) is applied to some or all of the subscriber's or member's PII, e.g., name and postal address information, to derive BIDs. Using the example from above, a “Joe Doe” at “123 Main St.” may be hashed into a resultant BID string “A348BEF6,” which, as described below, is used to match the BID previously generated at the advertiser's MDA. In other embodiments, the PII may include email addresses, user IDs, social security numbers, IP addresses, phone numbers, etc. In one embodiment, if only name and ZIP code are provided, the MDA 110 first attempts to locate the complete postal address using the name and ZIP code and then performs the hashing process. In one embodiment, the derived BIDs replace the names and postal addresses in RAM, ensuring that no names, postal addresses or other PII are stored in non-volatile memory storage. The MDA 110 may include a localized copy of marketing segment data that is periodically updated by a remote server. The localized copy may be encrypted.


Joining/Matching User Profile Data


In step 6, the BID is then used as the connecting key between the disparate data sets from the advertiser 104's member and segment data and those of the portal or publisher 106. In particular, the MDA 110 of the portal or publisher 106 uses the BIDs to join or match the incoming data (from the advertiser 104) with those from the member database 116 of the portal or publisher 106. Although not shown in FIG. 1, the same BID match process can be used to match data between an advertiser and an ad network as well. In one embodiment, once the matching ends, the BIDs are purged, leaving the publisher, portal or ad network's own identifier for a particular consumer and the advertiser's client segment for that same consumer. Thus, the matching is done such a way any non-matched data of the advertiser remains confidential and not revealed to the publisher or portal.


After the processing has completed, the MDA 116 contains records that include BIDs and user IDs from the publisher or portal 106 and ad segment. This creates a set of valid BID to user ID mappings for the network. In one embodiment, the BIDs are then purged, leaving only the publisher, portal or ad network's own identifier for a particular consumer (e.g., user ID) and the advertiser's segment for that same consumer. In step 7, the portal or publisher 106 may then export the list of joined user IDs and the corresponding advertiser's segment data to its proprietary ad server 120 or to an outsourced ad sever. Alternatively, as shown later in FIG. 3, the joined user IDs and the corresponding advertiser's segment data may be retrieved in real time through the use of a compute cluster.


With the data matching completed, advertisers can then include or exclude their own member households or otherwise target their own data in their media buys with publishers or portals. The process may proceed as follows. The advertiser 104 may place a media buy insertion order with the portal or publisher 106. The portal or publisher 106 may possibly stipulate to not target existing members of the advertiser 104. The portal or publisher 106 may then export a list from its local MDA 110, comprised of only its own members that are also known members of the advertiser 104, and upload the list onto its ad server as an “exclusion target” for a campaign, where segment(s) of customers/members are excluded from a media campaign (e.g. existing customers/members are excluded).


The MDAs make up a distributed network that facilitates businesses' ability to connect with each other's data in real time or batch mode and in a secure manner that de-personalizes consumer information throughout the processing steps. While FIG. 1 depicts a data flow from an advertiser to a portal/publisher, embodiments of the invention can facilitate data sharing between any entity depicted, e.g., between two advertisers, between two ad networks, or between two publishers/portals.


In one embodiment, MDA ensures that any set of data elements does not constitute a signature. This means that, for example, any set of data elements must be the same for at least 100 users or 0.05% of the users, whichever is greater. In one embodiment, if a data element set has less than 100 users, that element is not created so as to protect the privacy of the few users that may constitute that element.


In one embodiment, the matching process takes into account the generic or custom segment data and/or expanded matching criteria. Thus for example, before or after identifying the overlap in users/members/subscribers between the advertiser and the publisher/portal, the matching process may apply criteria to narrow or expand the match results. The matching process may narrow by filtering the results through segment matching. For example, the results may be narrowed down to include those records with matching segments only. As discussed above, the segments may be custom (created by the advertisers) or generic (selected by the advertisers from a list of available segments). The matching process may also expand the overlap results by using expanded or “look-alike” matching as previously described. In these embodiments, the matching process adds to the overlap list users/members/subscribers of the publisher or portal that do not already appear on the overlap list but nonetheless match one or more ideal or targeted criteria as specified by the advertiser. In one or more embodiments, the system is highly customizable and the advertiser can select a combination of narrowing or expanding matching processes as described above.


Ad Network


Although ad networks sell media to advertisers across publisher websites with their networks and have large ad distribution capability, they generally have very limited or no PII such as names or postal addresses for their “members,” which in this case include households or users that are tracked by the ad networks. Instead, for each end user, ad networks generally create a unique user ID that they store locally and in cookies on the end user's computer. Cookies are small text files that are deposited onto consumers' computers and generally contain basic identifying information such as user IDs, time stamps, etc.


One embodiment directed at the ad network model takes into account information that the ad networks may pass back to advertisers. In addition to the process described above in conjunction with FIG. 1, this embodiment allows for the ad network to pass its user ID to back to the advertiser when an end user clicks on the advertiser's ad.



FIG. 2 illustrates this additional user ID pass-through feature. User ID matching steps 1-6 are substantially similar to the corresponding steps illustrated in FIG. 1. After they are completed, the advertiser 104 may arrange for the ad network 124 to pass its user ID to the advertiser 104 in the “E” series of steps shown in FIG. 2. The user ID may be passed via a cookie or other suitable means. In step E1, the advertiser 104 places an insertion order for a media buy with the ad network 124. In step E2, the ad network exports a list of user IDs with the advertiser's segments to a publisher-partner site 124. In step E3, when a visitor clicks on an ad served by on the publisher-partner site 124, the visitor is re-directed to the advertiser's site 126. During the re-direction, the advertiser 104 receives the ad network's user ID for that visitor. In step E4, the user ID is carried through to the visitor's session with the advertiser, which may end with a registration or lead form 130 for service sign up. Assuming the visitor completes the registration or lead form 130, the advertiser 104 receives his or her marketing data including PII, e.g., name and postal address, and in step E5 passes the newly received marketing data to its local MDA 108.


In one embodiment, in the MDA 108 the above described anonymization process would be executed the newly received marketing data. In one embodiment, after the anonymization processing is executed in the MDA's RAM, the MDA may contain a BID, the advertiser's segments, and the ad network's user ID. In step E6, this newly processed information is passed through the marketing bureau to the ad network 124, so that it can be joined, in the ad network's local MDA, with a forward hashed version of the ad network's user ID. After the new data match in step E6, the ad network would have the ability to connect its user IDs with the advertiser's segments.


The “F” series of steps illustrate an alternate embodiment in which the advertiser is using the data sharing system to target specific segments on the publisher-partner site 126 using data obtained in the “E” series of steps. In step F1, the advertiser 104 may place a media buy with the ad network 124, targeting its members with, for example, upsell offers. In step F2, the ad network 124 may export a list of its IDs and the advertiser's members that are the targets for upselling, and upload the list to the ad server for the publisher-partner site 126. When users who are members of the advertiser 104 visit the publisher-partner site 126, they may see ads that are targeted to them for upselling, leading them to the advertiser's site 128.


Data Transmission


In one embodiment, data that are transmitted from the advertiser to the publisher or portal are fully encrypted. These data may be passed using an encryption scheme such as GPG (GnuPG) and the keys to decrypt the data exist on the target MDAs. For example, in FIG. 1, the decryption keys reside on MDA 110. Servers that receive the data in transit do not have the keys required to decrypt the data and act as a pass-throughs to minimize the amount of firewall rules required to accommodate MDAs that receive the data.


Hybrid Real Time Targeting Model


In one embodiment, a publisher, portal, or an ad network may have a compute cluster 138 installed within its environment in addition to a MDA. An example embodiment with a compute cluster 138 is illustrated in FIG. 3. BID matching steps 1-6 shown in FIG. 3 are substantially the same as the corresponding numbered steps depicted in FIG. 1. However, instead of a simple export to the ad server in step 7, a different process is performed on a per-transaction basis as illustrated in the following “G” series of steps depicted in FIG. 3.


In step G1, the advertiser 104 may place a media buy with the portal or publisher 106. In step G2, when a user visits the portal or publisher site 106, the portal or publisher 106 may send a request to the compute cluster 138 with the user ID that the publisher 106 has assigned to the user, along with the user's IP address. If the compute cluster 138 fails to find a match on the user ID, it may send the IP address to the marketing bureau and retrieve household level targeting or inferred geo-demographic targeting of consumer data. The process of obtaining inferred geo-demographic targeting is further described in co-pending U.S. patent application entitled “SYSTEMS AND METHODS FOR REAL TIME SEGMENTATION OF CONSUMERS,” No. 12/118,585, filed May 9, 2008, the disclosures of which are hereby fully incorporated by reference. Once the appropriate targeting data is returned to the ad server 120, an ad may be selected based on the targeting data and served in step G3.


With the compute cluster, any publisher, portal, or ad network can offer three tiers of insights to its advertisers, namely by custom segment (FIG. 1), by household level targeting data (e.g., through segment data made available by the compute cluster), and by inferred geo-demographic targeting data (e.g., through functions provided by the compute cluster) (FIG. 3). Having a compute cluster also allows the publisher, portal, or ad network to retrieve advertiser targeting on a transaction-by-transaction basis, rather than exporting a file from its MDA to its ad server.


Localized Copy of Marketing Segment Database


As mentioned above, in some embodiments, each MDA can include a local encrypted copy of a marketing segment database. Thus, in addition to submitting marketing data including PII such as names and addresses from their membership databases, advertisers could then also retrieve the cleansed records (e.g., hygiene—cleanse invalid records, standardization—standardize data elements such as address suffix, and verification—verify the data elements with an external source) along with data enhancement and even custom scores in real time, within their own local environments. For example, the MDA may contain a local copy of segment market data that may be returned as part of the data anonymization process. Similarly, the MDA may perform a process of standardizing the input addresses and may return addresses that conform to U.S. Postal standards, for example. In some embodiments, custom scores may also be returned as part of the process. The functions and features of an individual compute cluster are customizable and may be dynamically updated through data sent from the marketing bureau 102.


Data Partners



FIG. 4 illustrates another embodiment where a data partner 142 is involved in the process. In this embodiment, an advertiser 162 places ads on a publisher 152 while using the data partner 142's segment data to target the ads. The BID matching steps 1-6 shown in FIG. 4 are substantially the same as the corresponding numbered steps depicted in FIG. 1, except in FIG. 4 the matching is conducted between members of the data partner 142 and the publisher 152.


Once the matching steps are accomplished, the process proceeds as illustrated in the “H” series of steps in one embodiment. In step H1, the advertiser 162 places a media buy insertion order with the publisher 152, instructing it to target the data partner 142's members. In step H2, the publisher 152 exports a list from its local MDA 154, comprised of only user IDs from the publisher's member database 156 that are known members of data partner 142, and uploads the list onto its ad server 160 as the target for a campaign for the advertiser 162 on its site. In step H3, acquisition marketing traffic from the display of those targeted ads is driven to the advertiser 162.



FIG. 5 illustrates another example embodiment that connects an advertiser and a data partner 172 to an ad network 182. In this embodiment, an advertiser and data partner 172 places ads on an ad network 182. The BID matching steps 1-6 shown in FIG. 5 are substantially the same as the corresponding numbered steps depicted in FIG. 1. Note that the ad network 182 is able to accomplish the matching steps for the advertiser and data partner 172 because it has access to member data. Some ad networks may not have PII data such as name and address data on which they can conduct the initial BID matching.


Once the matching steps are accomplished, the process proceeds as illustrated in the “I” series of steps in one embodiment. In step I1, the advertiser 172 places a media buy insertion order with the ad network 182, instructing it to target a specific segment of the advertiser and data partner 172's members. In step 13, the ad network 182 exports a list from its local MDA 184, comprised of user IDs from the advertiser and data partner's member database 176, and uploads the list onto its ad server 190. In step 13, acquisition marketing traffic from the display of those targeted ads are driven to the advertiser and data partner 172.


Customized Emails



FIG. 6 illustrates another embodiment in which the data sharing system is applied to provide targeted advertising through customized emails. In this embodiment, a customized email provider 192 purchases ads from an portal/publisher 196 that will be placed into the email provider 192's own emails instead of web pages. The segments used in this matching process are provided by an advertiser A1194 that wishes to use the email provider 192 to send custom emails on A1's behalf. The BID matching steps 1-6 shown in FIG. 7 are substantially the same as the corresponding numbered steps depicted in FIG. 1. In step 7, matched data from the portal/publisher 196 are exported to a server that sends customized ads to emails generated by the email provider 192.


Audience Selector Tool


With a network of MDAs installed in various advertisers, ad networks, publishers and online portals and interconnected through the marketing bureau, sharing of user profile data may be greatly enhanced and online media buys may be made more efficient. In addition, advertisers may be able to query, through an audience selector tool, the data sharing system to determine how many unique users exist within the desired target entities. For example, an ad buyer may be able to see how many unique users exist on various portal and/or publisher sites that are also free trial members of its services. An example audience selector tool is shown in FIG. 7.


Feedback Data—Match Data and Conversion Metrics


In addition to the audience selector tool, which can assist in pre-purchase planning and allocating decisions, embodiments also provide feedback data to assist advertisers and other participants to monitoring match rates and return on investment. In one or more embodiments, an advertiser can receive feedback on the marketing data uploaded. The feedback data provided by embodiments of the MDA include the number of persons within the uploaded data who match certain segments. FIG. 8A provides an example of the type of match data provided. As shown, an example advertiser is receiving a report on the number of matches with a publisher and the detailed breakdown of matches by segments.


In one or more embodiments, the feedback data provided is based on conversion metrics. To receive conversion metrics data, an advertiser can identify a number of persons who have recently engaged in conversion activities. For example, an advertiser can identify persons who have recently signed up for paid services or filled out a form to request additional information as a result of its advertising efforts initiated through the system. An advertiser may identify such persons through, for example, the two mechanisms described in conjunction with FIG. 1: (1) upload a secondary list of such persons or (2) identify such persons in the primary list by, for example, inserting flags into the data records. The MDA in one or more embodiments processes the uploaded information by cross-referencing it against the primary list(s) uploaded from previous time period(s) and returning an estimated percentage of conversion to the advertiser.


For example, a MDA may receive from an advertiser a list of persons who have engaged in conversion activities in the last week. The DNA may cross reference the new conversion list against the primary list from last week's campaign and return one or more example conversion metrics as shown in FIG. 8B. As shown in the figure, the metrics calculated include a tally of those who visited the site, those who signed up for trial services and those who signed up for paid services. As shown, the metrics results may also include break-down by segments for individual conversion activities. The metrics on conversion activities are customizable and can be used to track any type of activities. For example, when used in contexts outside of internet advertising, a cable television operator may track movie downloads and a wireless service provider may track ringtone or song downloads. Metrics calculations can also be performed at various frequencies, for example, on a real-time or near real-time, daily, weekly, monthly, or yearly basis. The MDA in one embodiment aggregates the metrics over a period of time and provides advertisers a reporting tool for analyzing their return on investment in their advertising efforts.


As mentioned above, the various types of match and feedback data reports provided can be customized by advertisers and/or other interested parties. Similarly, portals, publishers and ad networks may be able to customize such reports and utilize them to provide potential advertisers characteristics of its membership. In addition, advertisers, portals, publishers and ad networks may use the match and feedback data to fine tune matching criteria in expanded (“look-alike”) matching operations as described above.


System Architecture



FIG. 9 is a block diagram illustrating a computer system 200 for implementing the marketing data appliances, bureau servers, ad servers, compute clusters, and other computer systems and devices illustrated in FIGS. 1 to 6 in accordance with one embodiment. The computer system 200 includes, for example, a personal computer that is IBM, Macintosh, or Linux/Unix compatible. In one embodiment, the computing system 200 comprises a server, a desktop computer, a laptop computer, a personal digital assistant, a kiosk, or a mobile device, for example. In one embodiment, the computing system 200 includes a central processing unit (“CPU”) 202, which may include one or more conventional microprocessors. The computing system 200 further includes a memory 206, such as random access memory (“RAM”) for temporary storage of information and a read only memory (“ROM”) for permanent storage of information, and a mass storage device 210, such as a hard drive, diskette, or optical media storage device. Typically, the components and modules of the computing system 200 are connected to the computer using a standard based bus system 208. In different embodiments, the standard based bus system could be Peripheral Component Interconnect (“PCI”), Microchannel, Small Computer System Interface (“SCSI”), Industrial Standard Architecture (“ISA”) and Extended ISA (“EISA”) architectures, for example. In addition, the functionality provided for in the components and modules of the computing system may be combined into fewer components and modules or further separated into additional components and modules.


The computing system 200 is generally controlled and coordinated by operating system software, such as Windows Server, Linux Server, Windows XP, Windows Vista, Unix, Linux, SunOS, Solaris, or other compatible server or desktop operating systems. In Macintosh systems, the operating system may be any available operating system, such as MAC OS X. In other embodiments, the computing system 200 may be controlled by a proprietary operating system. Conventional operating systems control and schedule computer processes for execution, perform memory management, provide file system, networking, I/O services, and provide a user interface, such as a graphical user interface (“GUI”), among other things.


The computing system 200 includes one or more commonly available input/output (I/O) devices and interfaces 216, such as a keyboard, mouse, touchpad, and printer. In one embodiment, the I/O devices and interfaces 216 include one or more display device, such as a monitor, that allows the visual presentation of data to a user. More particularly, a display device provides for the presentation of GUIs, application software data, and multimedia presentations, for example. The computing system 200 may also include one or more multimedia devices 204, such as speakers, video cards, graphics accelerators, and microphones, for example. In other embodiments, such as when the computing system 200 comprises a network server, for example, the computing system may not include any of the above-noted man-machine I/O devices.


In the embodiment of FIG. 9, the I/O devices and interfaces 216 provide a communication interface to various external devices. In the embodiment of FIG. 9, the computing system 200 is electronically coupled to the network 214, which may comprise one or more of a LAN, WAN, or the Internet, for example, via a wired, wireless, or combination of wired and wireless, communication link 212. The network 214 facilitates communications among various computing devices and/or other electronic devices via wired or wireless communication links.


According to FIGS. 1 to 6, requests are sent to the computing system 200 over the network 214. Similarly, results are returned over the network 214. In addition to the devices that are illustrated in FIG. 9, the computing system 200 may communicate with other data sources or other computing devices. In addition, the data sources may include one or more internal and/or external data sources. In some embodiments, one or more of the databases, data repositories, or data sources may be implemented using a relational database, such as Sybase, Oracle, CodeBase and Microsoft® SQL Server as well as other types of databases such as, for example, a flat file database, an entity-relationship database, and object-oriented database, and/or a record-based database. For example, the above described data including at least the user profile data, the member data, the customer data, the personally identifiable information, and the encrypted data may be stored in various embodiments in these data sources.


In the embodiment of FIG. 9, the computing system 200 also includes program codes and/or instructions stored on the mass storage device 210 that may be executed by the CPU 202. The program codes and/or instructions may include modules for performing user profile data anonymization, hashing, data encryption, data matching, and audience reporting as described above. These modules may include, by way of example, components, such as software components, object-oriented software components, class components and task components, processes, functions, attributes, procedures, subroutines, segments of program code, drivers, firmware, microcode, circuitry, data, databases, data structures, tables, arrays, and variables. Alternately, the modules may be implemented as separate devices, such as computer servers.


In general, the word “module,” as used herein, refers to logic embodied in hardware or firmware, or to a collection of software instructions, possibly having entry and exit points, written in a programming language, such as, for example, Java, Lua, C or C++. A software module may be compiled and linked into an executable program, installed in a dynamic link library, or may be written in an interpreted programming language such as, for example, BASIC, Perl, or Python. It will be appreciated that software modules may be callable from other modules or from themselves, and/or may be invoked in response to detected events or interrupts. Software instructions may be embedded in firmware. It will be further appreciated that hardware modules may be comprised of connected logic units, such as gates and flip-flops, and/or may be comprised of programmable units, such as programmable gate arrays or processors. The modules described herein are preferably implemented as software modules, but may be represented in hardware or firmware. Generally, the modules described herein refer to logical modules that may be combined with other modules or divided into sub-modules despite their physical organization or storage.


Conclusion


The foregoing description details certain embodiments of the invention. It will be appreciated, however, that no matter how detailed the foregoing appears in text, the invention can be practiced in many ways. As is also stated above, it should be noted that the use of particular terminology when describing certain features or aspects of the invention should not be taken to imply that the terminology is being re-defined herein to be restricted to including any specific characteristics of the features or aspects of the invention with which that terminology is associated. The scope of the invention should therefore be construed in accordance with the appended claims and any equivalents thereof.

Claims
  • 1. A system for anonymously sharing user profile data among a plurality of entities, comprising: a server having one or more hardware computer processors and configured to: receive, from each of a plurality of data appliances, a respective plurality of encrypted identifiers for a respective plurality of users, wherein the plurality of data appliances are located at the plurality of entities and each data appliance comprises one or more computing devices;periodically distribute market segment data to each of the plurality of data appliances, wherein the market segment data comprises at least supplemental user profile data associated with each of the respective plurality of encrypted user identifiers for the respective plurality of users;wherein the plurality of data appliances comprises: a first data appliance that is configured to: receive, from a first entity, first user profile data for a first group of users associated with the first entity, the first user profile data including names and addresses of the first group of users;encrypt the first user profile data for each of the first group of users into a respective plurality of first encrypted identifiers using an encryption technique; andsend the plurality of first encrypted identifiers to the server; and a second data appliance that is configured to:receive, from a second entity, second user profile data for a second group of users associated with the second entity, the second user profile data including names and addresses of the second group of users;encrypt the second user profile data for each of the second group of users into a respective plurality of second encrypted identifiers using the same encryption technique used by the first data appliance, so that common user profile data between the first and second user profile data are converted into identical encrypted identifiers;receive, from the server, the market segment data; anduse the plurality of second encrypted identifiers to retrieve, from the market segment data, supplemental user profile data associated with users in both the first and second groups of users, based on matching of at least one of the second encrypted identifiers to at least one of the first encrypted identifiers.
  • 2. The system of claim 1 wherein the encryption technique is a cryptographic hash function.
  • 3. A system for anonymously sharing user profile data among a plurality of entities, comprising: a server comprising one or more computing devices and configured to: receive, from each of a plurality of data appliances, encrypted data for a respective group of persons associated with a respective entity, wherein the plurality of data appliances are located at the plurality of entities and each data appliance comprises one or more computing devices;supplement marketing data associated with a plurality of individuals with the encrypted data from each of the plurality of data appliances; andtransmit the marketing data including the encrypted data from each of the plurality of data appliances to each of the plurality of data appliances,wherein the plurality of data appliances comprises: a first data appliance that is configured to: receive, from a first entity, first personal identifiable information related to a first group of persons;transform the first personally identifiable information into first encrypted data via an encryption process, the first encrypted data comprising an identifier for each of the first group of persons; andsend the first encrypted data to the server; and a second data appliance that is configured to:receive, from a second entity, second personally identifiable information related to a second group of persons;transform the second personally identifiable information into second encrypted data with the encryption process used by the first data appliance, the second encrypted data comprising an identifier for each of the second group of persons;receive from the server the first encrypted data; anduse the first and second encrypted data to anonymously generate list data related to common persons between the first and second groups of persons, wherein the list data is used to customize information provided by the second entity.
  • 4. The system of claim 3, wherein the second data appliance is further configured to generate the list data by matching the identifiers in the first encrypted data to the identifiers in the second encrypted data.
  • 5. The system of claim 3, wherein the first personally identifiable information comprise names and addresses related to the first group of persons.
  • 6. The system of claim 5, wherein the first data appliance is further configured to complete missing portions in the addresses in the first personally identifiable information before transforming the first personally identifiable information into the first encrypted data.
  • 7. The system of claim 3, wherein the first data appliance is further configured to delete the first personally identifiable information after transforming the first personally identifiable information into the first encrypted data.
  • 8. The system of claim 3, wherein the first data appliance is further configured to append segment data to the first encrypted data before sending the encrypted data to the server.
  • 9. The system of claim 8, wherein the second data appliance is further configured to: receive, from the second entity, in addition to the second personally identifiable information, identifiers used by the second entity to identify the second groups of persons; anduse the list data to create a mapping of user identifiers received from the second entity to the segment data from the first entity.
  • 10. The system of claim 9, wherein the mapping is used to anonymously track responses to online advertisements and emails.
  • 11. The system of claim 8, wherein the second data appliance is further configured to identify additional persons referenced in the second encrypted data with personally identifiable information matching a criterion specified in the segment data, the additional persons not among the common persons in the list data.
  • 12. The system of claim 11, wherein the criterion is residing within an area with a common postal code.
  • 13. The system of claim 11, wherein the criterion is a type of consumer.
  • 14. The system of claim 11, wherein the criterion is an indication of consumer interest shown to a product.
  • 15. The system of claim 3, wherein the data appliance is configured to delete the first and second encrypted data after generating the list data related to common persons.
  • 16. A method for sharing anonymized user profile data, the method comprising: receiving at a first data appliance, first personally identifiable information related to a first group of persons, wherein the first data appliance comprises one or more computing devices;transforming the first personally identifiable information into first encrypted data via an encryption process, the first encrypted data comprising an identifier for each of the first group of persons;transmitting the first encrypted data from the first data appliance to a second data appliance, wherein the second data appliance comprises one or more second computing devices;receiving, at the second data appliance, the first encrypted data;receiving, at the second data appliance, second personally identifiable information related to a second group of persons;transforming the second personally identifiable information into second encrypted data with the encryption process, the second encrypted data comprising an identifier for each of the second group of persons;receiving, from a server, market segment data, the market segment data comprising information related to at least the first group of persons or the second group of persons; andusing the first and second encrypted data and the market segment data to anonymously generate list data related to common persons between the first and second groups of persons, wherein the list data is used to customize information provided by the second entity.
  • 17. The method of claim 16, wherein the using further comprises generating the list data by matching the identifiers in the first encrypted data to the identifiers in the second encrypted data.
  • 18. The method of claim 16 wherein the first personally identifiable information comprise names and addresses related to the first group of persons.
  • 19. The method of claim 18, further comprising: completing missing portions in the addresses in the first personally identifiable information before transforming the first personally identifiable information into the first encrypted data.
  • 20. The method of claim 16, further comprising: deleting the first personally identifiable information after transforming the first personally identifiable information into the first encrypted data.
  • 21. The method of claim 16, further comprising: appending segment data to the first encrypted data before sending the encrypted data to the server.
  • 22. The method of claim 21, further comprising: receiving, from the second entity, in addition to the second personally identifiable information, identifiers used by the second entity to identify the second groups of persons; andusing the list data to create a mapping of user identifiers received from the second entity to the segment data from the first entity.
  • 23. The method of claim 22, wherein the mapping is used to anonymously track responses to online advertisements and emails.
  • 24. The method of claim 21, wherein the second data appliance is further configured to identify additional persons referenced in the second encrypted data with personally identifiable information matching a criterion specified in the segment data, the additional persons not among the common persons in the list data.
  • 25. The method of claim 24, wherein the criterion is residing within an area with a common postal code.
  • 26. The method of claim 24, wherein the criterion is a type of consumer.
  • 27. The method of claim 24, wherein the criterion is an indication of consumer interest shown to a product.
  • 28. The method of claim 16, wherein the data appliance is configured to delete the first and second encrypted data after generating the list data related to common persons.
CROSS-REFERENCE TO RELATED APPLICATIONS

This application claims the benefit of priority from U.S. Provisional Patent Application No. 61/177,205 filed on May 11, 2009, entitled “Systems and Methods for Providing Anonymized Marketing Information,” the entire contents of which are hereby incorporated herein by reference in their entirety. All publications and patent applications mentioned in this specification are herein incorporated by reference in their entirety to the same extent as if each individual publication or patent application was specifically and individually indicated to be incorporated by reference.

US Referenced Citations (399)
Number Name Date Kind
4775935 Yourick Oct 1988 A
4982346 Girouard et al. Jan 1991 A
5201010 Deaton et al. Apr 1993 A
5283731 Lalonde et al. Feb 1994 A
5305195 Murphy Apr 1994 A
5459306 Stein et al. Oct 1995 A
5515098 Carles May 1996 A
5590038 Pitroda Dec 1996 A
5592560 Deaton et al. Jan 1997 A
5640577 Scharmer Jun 1997 A
5659731 Gustafson Aug 1997 A
5661516 Carles Aug 1997 A
5692107 Simoudis et al. Nov 1997 A
5740549 Reilly et al. Apr 1998 A
5754939 Herz et al. May 1998 A
5822751 Gray et al. Oct 1998 A
5825884 Zdepski et al. Oct 1998 A
5828837 Eikeland Oct 1998 A
5832068 Smith Nov 1998 A
5844218 Kawan et al. Dec 1998 A
5848396 Gerace Dec 1998 A
5857175 Day et al. Jan 1999 A
5873068 Beaumont et al. Feb 1999 A
5881131 Farris et al. Mar 1999 A
5944790 Levy Aug 1999 A
5956693 Geerlings Sep 1999 A
5961593 Gabber et al. Oct 1999 A
5991735 Gerace Nov 1999 A
6038551 Barlow et al. Mar 2000 A
6044357 Garg Mar 2000 A
6070147 Harms et al. May 2000 A
6073106 Rozen et al. Jun 2000 A
6073140 Morgan et al. Jun 2000 A
6101486 Roberts et al. Aug 2000 A
6128602 Northington et al. Oct 2000 A
6144948 Walker et al. Nov 2000 A
6157927 Schaefer et al. Dec 2000 A
6202053 Christiansen et al. Mar 2001 B1
6208979 Sinclair Mar 2001 B1
6236977 Verba et al. May 2001 B1
6253202 Gilmour Jun 2001 B1
6289318 Barber Sep 2001 B1
6298330 Gardenswartz et al. Oct 2001 B1
6317752 Lee et al. Nov 2001 B1
6324566 Himmel et al. Nov 2001 B1
6334110 Walter et al. Dec 2001 B1
6385592 Angles et al. May 2002 B1
6405173 Honarvar Jun 2002 B1
6442577 Britton et al. Aug 2002 B1
6446200 Ball et al. Sep 2002 B1
6456979 Flagg Sep 2002 B1
6457012 Jatkowski Sep 2002 B1
6460036 Herz Oct 2002 B1
6463533 Calamera et al. Oct 2002 B1
6505168 Rothman et al. Jan 2003 B1
6513018 Culhane Jan 2003 B1
6523022 Hobbs Feb 2003 B1
6523041 Morgan et al. Feb 2003 B1
6581059 Barrett et al. Jun 2003 B1
6601173 Mohler Jul 2003 B1
6615247 Murphy Sep 2003 B1
6623529 Lakritz Sep 2003 B1
6640215 Galperin et al. Oct 2003 B1
6665715 Houri Dec 2003 B1
6698020 Zigmond et al. Feb 2004 B1
6748426 Shaffer et al. Jun 2004 B1
6754665 Futagami et al. Jun 2004 B1
6757740 Parekh et al. Jun 2004 B1
6766327 Morgan, Jr. et al. Jul 2004 B2
6766946 Iida et al. Jul 2004 B2
6804346 Mewhinney Oct 2004 B1
6810356 Garcia-Franco et al. Oct 2004 B1
6845448 Chaganti et al. Jan 2005 B1
6910624 Natsuno Jun 2005 B1
6925441 Jones, III et al. Aug 2005 B1
6934714 Meinig Aug 2005 B2
6950858 Ogami Sep 2005 B2
6954757 Zargham et al. Oct 2005 B2
6959281 Freeling et al. Oct 2005 B1
6983379 Spalink et al. Jan 2006 B1
6983478 Grauch et al. Jan 2006 B1
6985887 Sunstein et al. Jan 2006 B1
6993493 Galperin et al. Jan 2006 B1
7003792 Yuen Feb 2006 B1
7028001 Muthuswamy et al. Apr 2006 B1
7033792 Zhong et al. Apr 2006 B2
7035855 Kilger et al. Apr 2006 B1
7039607 Watarai et al. May 2006 B2
7047251 Reed et al. May 2006 B2
7050989 Hurt et al. May 2006 B1
7072853 Shkedi Jul 2006 B2
7072963 Anderson et al. Jul 2006 B2
7076475 Honarvar Jul 2006 B2
7085734 Grant et al. Aug 2006 B2
7133935 Hedy Nov 2006 B2
7136448 Venkataperumal et al. Nov 2006 B1
7150030 Eldering et al. Dec 2006 B1
7152018 Wicks Dec 2006 B2
7152237 Flickinger et al. Dec 2006 B2
7184974 Shishido Feb 2007 B2
7185016 Rasmussen Feb 2007 B1
7185353 Schlack Feb 2007 B2
7200602 Jonas Apr 2007 B2
7234160 Vogel et al. Jun 2007 B2
7246067 Austin et al. Jul 2007 B2
7249048 O'Flaherty Jul 2007 B1
7272591 Ghazal et al. Sep 2007 B1
7275083 Seibel et al. Sep 2007 B1
7360251 Spalink et al. Apr 2008 B2
7366694 Lazerson Apr 2008 B2
7367011 Ramsey et al. Apr 2008 B2
7370044 Mulhern et al. May 2008 B2
7376603 Mayr et al. May 2008 B1
7383988 Slonecker, Jr. Jun 2008 B2
7403942 Bayliss Jul 2008 B1
7424439 Fayyad et al. Sep 2008 B1
7433864 Malik Oct 2008 B2
7451113 Kasower Nov 2008 B1
7460857 Roach, Jr. Dec 2008 B2
7472088 Taylor et al. Dec 2008 B2
7478157 Bohrer et al. Jan 2009 B2
7499868 Galperin et al. Mar 2009 B2
7529698 Joao May 2009 B2
7536346 Aliffi et al. May 2009 B2
7546619 Anderson et al. Jun 2009 B2
7571139 Giordano et al. Aug 2009 B1
7580856 Pliha Aug 2009 B1
7587366 Grim, III et al. Sep 2009 B2
7590589 Hoffberg Sep 2009 B2
7596512 Raines et al. Sep 2009 B1
7596716 Frost et al. Sep 2009 B2
7603701 Gaucas Oct 2009 B2
7606725 Robertson et al. Oct 2009 B2
7610257 Abrahams Oct 2009 B1
7653592 Flaxman et al. Jan 2010 B1
7672833 Blume et al. Mar 2010 B2
7672865 Kumar et al. Mar 2010 B2
7672924 Scheurich et al. Mar 2010 B1
7672926 Ghazal et al. Mar 2010 B2
7689505 Kasower Mar 2010 B2
7698163 Reed et al. Apr 2010 B2
7698236 Cox et al. Apr 2010 B2
7698445 Fitzpatrick et al. Apr 2010 B2
7707059 Reed et al. Apr 2010 B2
7725300 Pinto et al. May 2010 B2
7730509 Boulet et al. Jun 2010 B2
7739139 Robertson et al. Jun 2010 B2
7742982 Chaudhuri et al. Jun 2010 B2
7747559 Leitner et al. Jun 2010 B2
7752236 Williams et al. Jul 2010 B2
7765311 Itabashi et al. Jul 2010 B2
7769696 Yoda Aug 2010 B2
7774270 MacCloskey Aug 2010 B1
7797252 Rosskamm et al. Sep 2010 B2
7797725 Lunt et al. Sep 2010 B2
7841008 Cole et al. Nov 2010 B1
7849004 Choudhuri et al. Dec 2010 B2
7962404 Metzger, II et al. Jun 2011 B1
7983932 Kane Jul 2011 B2
7991689 Brunzell et al. Aug 2011 B1
7996912 Spalink et al. Aug 2011 B2
8001042 Brunzell et al. Aug 2011 B1
8015045 Galperin et al. Sep 2011 B2
8024264 Chaudhuri et al. Sep 2011 B2
8036979 Torrez et al. Oct 2011 B1
8065233 Lee et al. Nov 2011 B2
8095458 Peterson et al. Jan 2012 B2
8099341 Varghese Jan 2012 B2
8127986 Taylor et al. Mar 2012 B1
8135607 Williams et al. Mar 2012 B2
8145754 Chamberlain et al. Mar 2012 B2
8271313 Williams et al. Sep 2012 B2
8271378 Chaudhuri et al. Sep 2012 B2
8285577 Galperin et al. Oct 2012 B1
8285656 Chang et al. Oct 2012 B1
8301574 Kilger et al. Oct 2012 B2
8312033 McMillan Nov 2012 B1
8315943 Torrez et al. Nov 2012 B2
8321952 Spalink et al. Nov 2012 B2
20010011245 Duhon Aug 2001 A1
20010014868 Herz et al. Aug 2001 A1
20010049620 Blasko Dec 2001 A1
20020004736 Roundtree et al. Jan 2002 A1
20020023051 Kunzle et al. Feb 2002 A1
20020026507 Sears et al. Feb 2002 A1
20020026519 Itabashi et al. Feb 2002 A1
20020035684 Vogel et al. Mar 2002 A1
20020046099 Frengut et al. Apr 2002 A1
20020049968 Wilson et al. Apr 2002 A1
20020055906 Katz et al. May 2002 A1
20020069122 Yun et al. Jun 2002 A1
20020077964 Brody et al. Jun 2002 A1
20020082892 Raffel et al. Jun 2002 A1
20020099628 Yakaoka et al. Jul 2002 A1
20020099824 Bender et al. Jul 2002 A1
20020103809 Starzl et al. Aug 2002 A1
20020123904 Amengual et al. Sep 2002 A1
20020123928 Eldering et al. Sep 2002 A1
20020128960 Lambiotte et al. Sep 2002 A1
20020128962 Kasower Sep 2002 A1
20020129368 Schlack et al. Sep 2002 A1
20020133404 Pedersen Sep 2002 A1
20020133504 Vlahos et al. Sep 2002 A1
20020156676 Ahrens et al. Oct 2002 A1
20020169747 Chapman et al. Nov 2002 A1
20020188544 Wizon et al. Dec 2002 A1
20020198824 Cook Dec 2002 A1
20030009418 Green et al. Jan 2003 A1
20030018578 Schultz Jan 2003 A1
20030033242 Lynch et al. Feb 2003 A1
20030041050 Smith et al. Feb 2003 A1
20030065563 Elliott et al. Apr 2003 A1
20030097342 Whittingtom May 2003 A1
20030097380 Mulhern et al. May 2003 A1
20030101344 Wheeler et al. May 2003 A1
20030105728 Yano et al. Jun 2003 A1
20030212654 Harper et al. Nov 2003 A1
20030216965 Libman Nov 2003 A1
20030219709 Olenick et al. Nov 2003 A1
20030229892 Sardera Dec 2003 A1
20030233323 Bilski et al. Dec 2003 A1
20040006488 Fitall et al. Jan 2004 A1
20040010458 Friedman Jan 2004 A1
20040039688 Sulkowski et al. Feb 2004 A1
20040062213 Koss Apr 2004 A1
20040078809 Drazin Apr 2004 A1
20040098625 Lagadec et al. May 2004 A1
20040102197 Dietz May 2004 A1
20040107125 Guheen et al. Jun 2004 A1
20040111359 Hudock Jun 2004 A1
20040117358 Von Kaenel et al. Jun 2004 A1
20040122730 Tucciarone et al. Jun 2004 A1
20040122735 Meshkin Jun 2004 A1
20040128193 Brice et al. Jul 2004 A1
20040139025 Coleman Jul 2004 A1
20040153330 Miller et al. Aug 2004 A1
20040153521 Kogo Aug 2004 A1
20040163101 Swix Aug 2004 A1
20040199456 Flint et al. Oct 2004 A1
20040199584 Kirshenbaum et al. Oct 2004 A1
20040199789 Shaw et al. Oct 2004 A1
20040205157 Bibelnieks et al. Oct 2004 A1
20040225594 Nolan, III et al. Nov 2004 A1
20050005168 Dick Jan 2005 A1
20050021397 Cui et al. Jan 2005 A1
20050027995 Menschik et al. Feb 2005 A1
20050050027 Yeh et al. Mar 2005 A1
20050055231 Lee Mar 2005 A1
20050144067 Farahat et al. Jun 2005 A1
20050192008 Desai et al. Sep 2005 A1
20050204381 Ludvig et al. Sep 2005 A1
20050209922 Hofmeister Sep 2005 A1
20050222906 Chen Oct 2005 A1
20050251820 Stefanik et al. Nov 2005 A1
20050278743 Flickinger et al. Dec 2005 A1
20050288954 McCarthy et al. Dec 2005 A1
20060004731 Seibel et al. Jan 2006 A1
20060020611 Gilbert et al. Jan 2006 A1
20060041443 Horvath Feb 2006 A1
20060074991 Lussier et al. Apr 2006 A1
20060080233 Mendelovich et al. Apr 2006 A1
20060080251 Fried et al. Apr 2006 A1
20060155573 Hartunian Jul 2006 A1
20060184440 Britti et al. Aug 2006 A1
20060195866 Thukral Aug 2006 A1
20060206379 Rosenberg Sep 2006 A1
20060212353 Roslov et al. Sep 2006 A1
20060224696 King et al. Oct 2006 A1
20060229943 Mathias et al. Oct 2006 A1
20060230415 Roeding Oct 2006 A1
20060242039 Haggerty et al. Oct 2006 A1
20060242046 Haggerty et al. Oct 2006 A1
20060242047 Haggerty et al. Oct 2006 A1
20060242050 Haggerty et al. Oct 2006 A1
20060271472 Cagan Nov 2006 A1
20060282359 Nobili et al. Dec 2006 A1
20060282856 Errico et al. Dec 2006 A1
20060287915 Boulet et al. Dec 2006 A1
20060287919 Rubens et al. Dec 2006 A1
20060293921 McCarthy et al. Dec 2006 A1
20060293954 Anderson et al. Dec 2006 A1
20060293955 Wilson et al. Dec 2006 A1
20060294199 Bertholf Dec 2006 A1
20070011020 Martin Jan 2007 A1
20070011039 Oddo Jan 2007 A1
20070022032 Anderson et al. Jan 2007 A1
20070022297 Britti et al. Jan 2007 A1
20070033227 Gaito et al. Feb 2007 A1
20070038483 Wood Feb 2007 A1
20070038497 Britti et al. Feb 2007 A1
20070061195 Liu et al. Mar 2007 A1
20070061243 Ramer et al. Mar 2007 A1
20070067297 Kublickis Mar 2007 A1
20070078835 Donnelli Apr 2007 A1
20070118393 Rosen et al. May 2007 A1
20070156515 Hasselback et al. Jul 2007 A1
20070156554 Nikoley et al. Jul 2007 A1
20070174122 Howard et al. Jul 2007 A1
20070192165 Haggerty et al. Aug 2007 A1
20070192409 Kleinstern et al. Aug 2007 A1
20070208619 Branam et al. Sep 2007 A1
20070220553 Branam et al. Sep 2007 A1
20070220611 Socolow et al. Sep 2007 A1
20070226130 Haggerty et al. Sep 2007 A1
20070233857 Cheng et al. Oct 2007 A1
20070244732 Chatterji et al. Oct 2007 A1
20070250459 Schwarz et al. Oct 2007 A1
20070261114 Pomerantsev Nov 2007 A1
20070282684 Prosser et al. Dec 2007 A1
20070282730 Carpenter et al. Dec 2007 A1
20070282736 Conlin et al. Dec 2007 A1
20070288271 Klinkhammer Dec 2007 A1
20070288360 Seeklus Dec 2007 A1
20070288950 Downey et al. Dec 2007 A1
20070288953 Sheeman et al. Dec 2007 A1
20070294126 Maggio Dec 2007 A1
20070299759 Kelly Dec 2007 A1
20080005313 Flake et al. Jan 2008 A1
20080010206 Coleman Jan 2008 A1
20080021802 Pendleton Jan 2008 A1
20080028067 Berkhin et al. Jan 2008 A1
20080033742 Bernasconi Feb 2008 A1
20080046383 Hirtenstein et al. Feb 2008 A1
20080052182 Marshall Feb 2008 A1
20080059224 Schechter Mar 2008 A1
20080059317 Chandran et al. Mar 2008 A1
20080065774 Keeler Mar 2008 A1
20080091535 Heiser et al. Apr 2008 A1
20080109875 Kraft May 2008 A1
20080115191 Kim et al. May 2008 A1
20080133325 De et al. Jun 2008 A1
20080172324 Johnson Jul 2008 A1
20080177836 Bennett Jul 2008 A1
20080183504 Highley Jul 2008 A1
20080184289 Cristofalo et al. Jul 2008 A1
20080205655 Wilkins et al. Aug 2008 A1
20080208873 Boehmer Aug 2008 A1
20080228635 Megdal et al. Sep 2008 A1
20080255897 Megdal et al. Oct 2008 A1
20080263058 Peden Oct 2008 A1
20080270209 Mauseth et al. Oct 2008 A1
20080294540 Celka et al. Nov 2008 A1
20080301727 Cristofalo et al. Dec 2008 A1
20080306750 Wunder et al. Dec 2008 A1
20090018996 Hunt et al. Jan 2009 A1
20090024505 Patel et al. Jan 2009 A1
20090031426 Dal Lago et al. Jan 2009 A1
20090043691 Kasower Feb 2009 A1
20090044246 Sheehan et al. Feb 2009 A1
20090055894 Lorsch Feb 2009 A1
20090076883 Kilger et al. Mar 2009 A1
20090094640 Anderson et al. Apr 2009 A1
20090094674 Schwartz et al. Apr 2009 A1
20090112650 Iwane Apr 2009 A1
20090133058 Kouritzin et al. May 2009 A1
20090138335 Lieberman May 2009 A1
20090144201 Gierkink et al. Jun 2009 A1
20090150166 Leite et al. Jun 2009 A1
20090150238 Marsh et al. Jun 2009 A1
20090164380 Brown Jun 2009 A1
20090177480 Chen et al. Jul 2009 A1
20090222373 Choudhuri et al. Sep 2009 A1
20090222374 Choudhuri et al. Sep 2009 A1
20090222375 Choudhuri et al. Sep 2009 A1
20090222376 Choudhuri et al. Sep 2009 A1
20090222377 Choudhuri et al. Sep 2009 A1
20090222378 Choudhuri et al. Sep 2009 A1
20090222379 Choudhuri et al. Sep 2009 A1
20090222380 Choudhuri et al. Sep 2009 A1
20090234665 Conkel Sep 2009 A1
20090248567 Haggerty et al. Oct 2009 A1
20090248568 Haggerty et al. Oct 2009 A1
20090248569 Haggerty et al. Oct 2009 A1
20090248570 Haggerty et al. Oct 2009 A1
20090248571 Haggerty et al. Oct 2009 A1
20090248572 Haggerty et al. Oct 2009 A1
20090248573 Haggerty et al. Oct 2009 A1
20090288109 Downey et al. Nov 2009 A1
20090328173 Jakobson et al. Dec 2009 A1
20100037255 Sheehan et al. Feb 2010 A1
20100094758 Chamberlain et al. Apr 2010 A1
20100138290 Zschocke et al. Jun 2010 A1
20100145840 Kasower Jun 2010 A1
20100169159 Rose et al. Jul 2010 A1
20110016042 Cho et al. Jan 2011 A1
20110029388 Kendall et al. Feb 2011 A1
20110047071 Choudhuri et al. Feb 2011 A1
20110093383 Haggerty et al. Apr 2011 A1
20110112958 Haggerty et al. May 2011 A1
20110137760 Rudie et al. Jun 2011 A1
20110164746 Nice et al. Jul 2011 A1
20110213641 Metzger, II et al. Sep 2011 A1
20110219421 Ullman et al. Sep 2011 A1
20110307397 Benmbarek Dec 2011 A1
20120011158 Avner et al. Jan 2012 A1
20120047219 Feng et al. Feb 2012 A1
20120095927 Hirtenstein et al. Apr 2012 A1
20120136768 Megdal et al. May 2012 A1
20120158574 Brunzell et al. Jun 2012 A1
Foreign Referenced Citations (34)
Number Date Country
1290372 May 2001 CN
0 749 081 Dec 1996 EP
1 122 664 Aug 2001 EP
10-222559 Aug 1998 JP
10-261009 Sep 1998 JP
2000-331068 Nov 2000 JP
2001-297141 Oct 2001 JP
2001-344463 Dec 2001 JP
2001-357256 Dec 2001 JP
2002-149778 May 2002 JP
2002-163498 Jun 2002 JP
2002-259753 Sep 2002 JP
2003-271851 Sep 2003 JP
2003-316881 Nov 2003 JP
10-2000-0036594 Jul 2000 KR
10-2000-0063995 Nov 2000 KR
10-2001-0016349 Mar 2001 KR
10-2001-0035145 May 2001 KR
10-2002-0007132 Jan 2002 KR
WO 9723838 Jul 1997 WO
WO 9904350 Jan 1999 WO
WO 0055789 Sep 2000 WO
WO 0055790 Sep 2000 WO
WO 0111522 Feb 2001 WO
WO 0125896 Apr 2001 WO
WO 0175754 Oct 2001 WO
WO 0184281 Nov 2001 WO
WO 03101123 Dec 2003 WO
WO 2004114160 Dec 2004 WO
WO 2007149941 Dec 2007 WO
WO 2008054403 May 2008 WO
WO 2008076343 Jun 2008 WO
WO 2009117518 Sep 2009 WO
WO 2010062537 Jun 2010 WO
Non-Patent Literature Citations (69)
Entry
International Search Report and Written Opinion for PCT/US2010/34434 dated Jun. 23, 2010, in 8 pages.
“Atlas on Demand, Concurrent, and Everstream Strike Video-On-Demand Advertising Alliance”, Atlassolutions.com, Jul. 13, 2006, 3 pages.
“Epsilon Leads Discussion on Paradigm Shift in TV Advertising,” Epsilon.com, Jun. 24, 2004, 2 pages, http://www.epsilon.com/who-pr—tvad040624.html.
Experian-Scorex Announces New Credit Simulation Tool, PR Newswire, Costa Mesa, CA, Jun. 13, 2005.
Instant Access to Credit Reports Now Available Online with DMS' CreditBrowser-based system also Simplifies Credit Decisioning and Offers a Central Point of Control, Business Wire, p. 0264, Dallas, May 23, 2000.
“IRI and Acxiom Introduce More Efficient and Actionable Approach to Consumer Segmentation and Targeted Marketing,” Eu-Marketingportal.de, Jan. 26, 2006, 2 pages, http://www.eu-marketingportal.de.
“PremierGuide Announces Release 3.0 of Local Search Platform”, Business Wire, p. 5574, Palo Alto, CA, Mar. 4, 2004.
“Accenture Launches Media Audit and Optimization Service to Help U.S. Companies Measure Return on Investment in Advertising,” Business Wire, May 22, 2006, 2 pages, http://findarticles.com/p/articles/mi—m0EIN/is—2006—May—22/ai—n16374159.
“Accenture Newsroom: Accenture Completes Acquisition of Media Audits: Acquisition Expands Company's Marketing Sciences and Data Services Capabilities,” Accenture.com, Dec. 12, 2005, 2 pages, http://accenture.tekgroup.com/article—display.cfm?article—id=428.
“Arbitron 2006 Black Consumers,” Arbitron Inc., Lvtsg.com, Jul. 8, 2006, 2 pages, http://www.lvtsg.com/news/publish/Factoids/article—3648.shtml.
“Atlas On Demand and C-COR Join Forces to Offer Advertising Management Solution for On Demand TV: Global Provider of On Demand Systems Partners with Atlas to Develop and Market Comprehensive VOD Advertising Solution,” Atlassolutions.com, Jul. 25, 2005, 3.
Atlas On Demand and Tandberg Television Join Forces to Enhance Dynamic Ad Placement for On-Demand Television: Combined End-to End Solution to Provide Media Buying and Selling Communities with New Tools for Dynamic Advertising that Eliminate Technical Bar.
“Cable Solution Now, The Industry Standard for Information Management: Strata's TIM.net Crosses Important Threshold Dominant Solution for All Top 20 TV Markets,” Stratag.com, Apr. 28, 2006, 1 page, http://stratag.com/news/cablepress042806.html.
“Claritas Forms Life Insurance Consortium with Worldwide Financial Services Association: Initiative with LIMRA International is First of its Kind to Provide Actual Sales Information at Small Geographic Areas,” Claritas.com, Feb. 9, 2006, 3 pages, http.
“Claritas Introduces Prizm NE Consumer Electronic Monitor Profiles: New Information Product Provides Insight Into The Public's Purchasing Behaviors of Consumer Electronics,” Claritas.com May 30, 2006, 3 pages.
Information Resources, Inc. and Navic Networks Form Joint Relationship to Support Next Generation of Technology for Advertising Testing, IRI Expands BehaviorScan® Solution to Meet Digital and On-demand Needs, Infores.com, Feb. 27, 2006, 2 pages, http://u.
“Intelligent Miner Applications Guide”; Chapters 4-7; pp. 33-132; IBM Corp., Apr. 2, 1999.
“Japan's JAAI system appraises used cars over internet”, Asia Pulse, Mar. 3, 2000.
“Mediamark Research Inc. Releases Findings From Mobile Marketing Consumer Study; Outback Steakhouse and Royal Caribbean Cruise Lines Among Brands Participating in Mobile Marketing Research,” Thefreelibrary.com, May 9, 2006, 4 pages, http://thefreelibrary.
“SRC Announces Free Dashups to Mashups Adding Geographic Business Intelligence at Web Speed to the Enterprise on www.FreeDemographics.com/API,” Directionsmag.com, Jun. 12, 2006, 3 pages, http://www.directionsmag.com/press.releases/index.php?duty=Show&id=1.
“SRC Delivers Industry's First Drive Time Engine Developed to Follow Actual Road Networks,” Thomasnet.com, May 21, 2006, 4 pages, http://news.thomasnet.com/companystory/485722.
“VOD Integration Now Available in Strata: Buyers / Sellers Benefit from VOD Component on Popular Platform,” Stratag.com, Feb. 21, 2006, 1 page, http://www.stratag.com/news/mediapress022106.html.
“WashingtonPost.com and Cars.com launch comprehensive automotive web site for the Washington area”, PR Newswire, Oct. 22, 1998.
Adzilla, Press Release, “ZILLACASTING technology approved and patent pending,” dated May 16, 2005 as downloaded from http://www.adzilla.com/newsroom/pdf/patent—051605.pdf on May 28, 2008.
AFX New Limited—AFX International Focus, “Nielsen moving to measure off-TV viewing,” Jun. 14, 2006, 1 page.
Bachman, Katy, “Arbitron, VNU Launch Apollo Project,” Mediaweek.com Jan. 17, 2006, 3 pages, http://www.mediaweek.com/mw/search/article—display.jsp?schema=&vnu—content—id=1001847353.
Caliendo, et al., “Some Practical Guidance for the Implementation of Propensity Score Matching”; IZA:Discussion Paper Series; No. 1588; Germany; May 2005.
Click Z, “ISPs Collect User Data for Behavioral Ad Targeting,” dated Jan. 3, 2008 as downloaded from http://www.clickz.com/showPage.html?page=clickz on Apr. 16, 2008.
CNET News.com, “Target me with your ads, please,” dated Dec. 5, 2007 as downloaded from http://www.news.com/2102-1024—3-6221241.html?tag+st.util.print on Mar. 18, 2008.
Creamer, Matthew; Consulting in marketing; Accenture, Others Playing Role in Firms' Processes, Crain's Chicago Business, Jun. 12, 2006, 2 pages.
Delany, Kevin J., et al. , Firm Mines Offline Data to Target Online as downloaded from http://www.commercialalert.org on Apr. 22, 2008, Commercial Alert, Oct. 17, 2007.
Demographicsnow.com, sample reports, “Age Rank Report”, Jul. 17, 2006, 3 pages.
Demographicsnow.com, sample reports, “Consumer Expenditure Summary Report”, Jul. 17, 2006, 3 pages.
Demographics.com, sample reports, “Income Comparison Report”, Jul. 17, 2006, 4 pages.
Egol, Len; “What's New in Database Marketing Software,” Direct, Aug. 1994, vol. 6, No. 8, p. 39(4).
Ettorre, Paul Kahn on Exceptional Marketing. Management Review, vol. 38(11), Nov. 1994, pp. 48-51.
Fanelli, Marc; “Building a Holistic Customer View”; MultiChannel Merchant; pp. 2; Jun. 26, 2006.
Frontporch, Ad Networks-Partner with Front 2008 Porch, www.frontporch.com, in 2 pages, Apr. 2008.
Frontporch, New Free Revenue for Broadband ISPs!, Get your share of the $20 Billion online advertising market!, Improve Your Users' Internet Browsing Experience, as downloaded from http://www.frontporch.com/html/bt/FPBroadbandISPs.pdf on May 28, 2008.
Gonul, et al., “Optimal Mailing of Catalogs: A New Methodology Using Estimable Structural Dynamic Programming Models”, 14 pages, Management Science, vol. 44, No. 9, Sep. 1998.
Halliday, Jean, “Ford recruits Accenture for marketing plan,” Automotive News Feb. 13, 2006, 2 pages, Crain Communications.
Haughton, Dominique et al.; Direct Marketing Modeling with CART and CHAID, Journal of Direct Marketing, Fall 1997, vol. 11, No. 4, pp. 42-52.
Helm, Burt, “Nielsen's New Ratings Yardstick,” Businessweek.com, Jun. 20, 2006, 3 pages, http://www.businessweek.com/technology/content/jun2006/tc20060620—054223.htm.
Hinman, Donald P., “The Perfect Storm: Response Metrics and Digital TV,” Chiefmarketer.com, May 17, 2006, 2 pages, http://www.chiefmarketer.com/crm—loop/roi/perfect-storm-051706/index.html.
Ideon, Credit-Card Registry that Bellyflopped this Year, Is Drawing some Bottom-Fishers, The Wall Street Journal, Aug. 21, 1995, pp. C2.
Lamons, Bob, Be Smart: Offer Inquiry Qualification Services, Marketing News, vol. 29, Issue 23, ABI/Inform Global, p. 13, Nov. 6, 1995.
Lanubile, et al., “Evaluating Empirical Models for the Detection of High-Risk Components: Some Lessons Learned”, 20th Annual Software Engineering Workshop, Nov. 29-30, 1995, Greenbelt, Maryland, pp. 1-6.
Loshin, Intelligent Enterprise: Better Insight for Business Decisions, “Value-Added Data: Merge Ahead”, Feb. 9, 2000, vol. 3, No. 3, 5 pages.
Miller, Joe, “NADA used-car prices go online”, Automotive News, Jun. 14, 1999, p. 36.
Morrissey, Brian, “Aim High: Ad Targeting Moves to the Next Level”, ADWEEK, dated Jan. 21, 2008 as downloaded from http://www.adweek.com/aw/magazine/article—display.isp?vnu on Apr. 16, 2008.
Muus, et al., “A Decision Theoretic Framework for Profit Maximization in Direct Marketing”, 20 Pages, Sep. 1996.
NebuAd, Press Release dated Oct. 22, 2007, “Venture Capital: What's New—The Latest On Technology Deals From Dow Jones VentureWire,” as downloaded from http://www.nebuad.com/company/media—coverage/media—10—22—07.php on May 28, 2008.
Polatoglu et al., “Theory and Methodology, Probability Distributions of Cost, Revenue and Profit over a Warranty Cycle”, European Jourhal of Operational Research, vol. 108, Issue 1, Jul. 1998, pp. 170-183.
Predictive Behavioral Targeting as downloaded from http://www.predictive-behavioral-targeting.com/index.php.Main—Page on Mar. 28, 2008.
RAP Interactive, Inc. and Web Decisions: Proudly Presents Live Decisions, A Powerful New Information and Technology Resource that Revolutionizes Interactive Marketing, downloaded from www.webdecisions.com/pdf/LiveDecisions—Bro.pdf, as printed on Aug. 13, 2007.
Reinbach, Andrew; MCIF aids banks in CRA Compliance, Bank Systems & Technology, Aug. 1995, vol. vol. 32, Issue No. 8, Pages pp. 27.
SalesLogix.net, SalesLogix Sales Tour, http://web.archive.org/web/20010411115938/www.saleslogix.com/home/index.php3celli . . . as printed on Aug. 30, 2005, Apr. 2000, 19 Pgs.
Sawyers, Arlena, “NADA to Offer Residual Guide”, Automotive News, May 22, 2000, p. 3.
Sax, Michael M., Data Collection and Privacy Protection: An International Perspective, Presentation: Managing Online Risk and Liability Conference, Aug. 31, 1999, pp. 58.
Schmittlein et al., “Customer Base Analysis: An Industrial Purchase Process Application”, Marketing Science, vol. 13, No. 1 (Winter 1994), p. 41-67.
Sweat, Jeff; “Know Your Customers,” Information Week, Nov. 30, 1998, pp. 20.
Tao, Lixin, “Shifting Paradigms with the Application Service Provider Model”; Concordia University, Canada; IEEE; Oct. 2001.
Thoemmes, Felix, “Propensity Score Matching in SPSS”, Center for Educational Science and Psychology, University of Tübingen, Jan. 2012.
UPI, “Nielsen Media Research goes electronic,” Jun. 14, 2006, 1 page.
Whitney, Daisy; Atlas Positioning to Shoulder VOD Ads; Campaign Management Tools Optimize Inventory, TelevisionWeek, May 23, 2005, 3 pages.
International Search Report and Written Opinion for Application No. PCT/US2007/21815, dated Sep. 5, 2008.
International Search Report and Written Opinion in PCT/US08/83939, dated Jan. 29, 2009.
International Search Report and Written Opinion for Application No. PCT/US09/60393, dated Dec. 23, 2009.
International Search Report and Written Opinion for Application No. PCT/US09/37565, dated May 12, 2009.
Related Publications (1)
Number Date Country
20110060905 A1 Mar 2011 US
Provisional Applications (1)
Number Date Country
61177205 May 2009 US