PRIVACY-ENHANCED INTERNET ADVERTISING SYSTEM

• US 20090216642A1
• Filed: 01/29/2009
• Published: 08/27/2009
• Est. Priority Date: 02/25/2008
• Status: Abandoned Application

• Current Assignee: Audience Partners, LLC (Altice USA, Inc.)
• Original Assignee: Bering Media Inc. (Altice USA, Inc.)
• Inventors: Ho, Michael, St-Pierre, Nicolas
• Application Number:
  US12/361,566
• Publication Number:
  US 20090216642A1
• Time in Patent Office: Days
• US Class Current: 705/14.250
• CPC Class Codes: G06F 16/951 Indexing; Web crawling techniques
• CPC Class Codes: G06F 16/958 Organisation or management of web site content, e.g. publishing, maintaining pages or automatic linking
• CPC Class Codes: G06Q 30/02 Marketing; Price estimation or determination; Fundraising
• CPC Class Codes: G06Q 30/0224 based on user history
• CPC Class Codes: G06Q 30/0225 Avoiding frauds
• CPC Class Codes: H04L 2101/668 Internet protocol [IP] address subnets
• CPC Class Codes: H04L 61/5007 Internet protocol [IP] addresses
• CPC Class Codes: H04L 67/02 based on web technology, e.g. hypertext transfer protocol [HTTP]
• CPC Class Codes: H04L 67/06 specially adapted for file transfer, e.g. file transfer protocol [FTP]

Abstract

A system and method of advertising for determining a network location associated with a physical location. In one aspect, a system for performing this function is described which includes an advertiser module for accepting advertisements and a targeting criterion and computing a plurality of restricted identifiers satisfying the targeting criterion, an association module for receiving the plurality of restricted identifiers, associating the plurality of restricted identifiers with a plurality of non-restricted identifiers, and an intermediate module for associating the advertisement identifier with the plurality of non-restricted identifiers.

Claims

1. An advertising system for determining a network location associated with a physical location comprising:

(a) an advertiser module having a first communication interface, for accepting an advertisement identifier and a targeting criterion associated with an advertisement, computing a plurality of restricted identifiers satisfying the targeting criterion, and storing the advertisement identifier, the targeting criterion and the plurality of restricted identifiers in a first computer database, wherein the advertisement identifier identifies the advertisement;

(b) an intermediate module having a second communication interface, for receiving the advertisement identifier and the plurality of restricted identifiers from the advertiser module, storing the advertisement identifier and the plurality of restricted identifiers in a second computer database, communicating the plurality of restricted identifiers to at least one service provider, receiving an indication of a plurality of non-restricted identifiers associated with the plurality of restricted identifiers, and associating the advertisement identifier with the plurality of non-restricted identifiers; and

(c) an association module operated by the at least one service provider having a third communication interface, the association module for receiving the plurality of restricted identifiers, associating the plurality of restricted identifiers with the plurality of non-restricted identifiers stored in a third computer database, and communicating the indication of the plurality of non-restricted identifiers to the intermediate module.

2. The system of claim 1, wherein the targeting criterion comprises personally identifying information about a subscriber of the at least one service provider.

3. The system of claim 1, wherein the targeting criterion is data that is correlatable with postal addresses.

4. The system of claim 1, wherein the targeting criterion is selected from the group consisting of:

names, postal addresses, postal codes, e-mail addresses, network equipment identifiers, government-issued alphanumeric identification strings, privately-issued alphanumeric identification strings, behavioral profiles, website content profiles, administrative divisions, municipal districts, school districts, electoral districts, demographic market areas, neighborhood trading areas, geographic identifiers, and geographic area identifiers.

5. The system of claim 4, wherein the geographic area identifiers comprise at least one geographic center point, at least one inner radius defining an inner circular border and at least one outer radius defining an outer circular border of a geographical area that is between the inner circular border and the outer circular border when both the inner circular border and the outer circular border are centered on the at least one geographic center point.

6. The system of claim 4, wherein the geographic area identifiers define polygonal vertices of a geographical area.

7. The system of claim 1, wherein the plurality of restricted identifiers comprises postal addresses.

8. The system of claim 1, wherein the plurality of non-restricted identifiers is selected from the group consisting of:

network addresses, Internet Protocol addresses, telephone numbers, and hash codes.

9. The system of claim 1, wherein the advertising module further accepts a first maximum bid amount associated with the advertisement identifier and at least one additional advertisement identifier with associated maximum bid amount and targeting criterion, and communicates the first maximum bid amount and the associated maximum bid amount to the intermediate module;

and the intermediate module selects the advertisement identifier associated with the highest maximum bid amount when determining the advertisement identifier to associate with the plurality of non-restricted identifiers.

10. An advertising method for determining a network location associated with a physical location comprising:

(a) providing an advertiser module, an intermediate module and an association module, wherein each of the modules has a communication interface;

(b) receiving an advertisement campaign and a targeting criterion associated with the advertisement campaign at the advertiser module;

(c) computing an advertisement identifier and a plurality of restricted identifiers satisfying the targeting criterion, storing the advertisement identifier, the targeting criterion and the plurality of restricted identifiers in a first computer database and communicating the advertisement identifier and the plurality of restricted identifiers to the intermediate module;

(d) receiving the advertisement identifier and the plurality of restricted identifiers at the intermediate module and storing the advertisement identifier and the plurality of restricted identifiers in a second computer database;

(e) communicating the plurality of restricted identifiers to the association module;

(f) computing at the association module a plurality of non-restricted identifiers, drawn from a third computer database, associated with the plurality of restricted identifiers;

(g) communicating an indication of the plurality of non-restricted identifiers associated with the plurality of restricted identifiers to the intermediate module; and

(h) based on the indication, associating the advertisement identifier to the plurality of non-restricted identifiers.

11. The method of claim 10, wherein the targeting criterion comprises personally identifying information about a subscriber of at least one service provider.

12. The method of claim 10, wherein the targeting criterion is data that is correlatable with postal addresses.

13. The method of claim 10, wherein the targeting criterion is selected from the group consisting of:

names, postal addresses, postal codes, e-mail addresses, network equipment identifiers, government-issued alphanumeric identification strings, privately-issued alphanumeric identification strings, behavioral profiles, website content profiles, administrative divisions, municipal districts, school districts, electoral districts, demographic market areas, neighborhood trading areas, geographic identifiers, and geographic area identifiers.

14. The method of claim 13, wherein the geographic area identifiers comprise at least one geographic center point, at least one inner radius defining an inner circular border and at least one outer radius defining an outer circular border of a geographical area that is between the inner circular border and the outer circular border when both the inner circular border and the outer circular border are centered on the at least one geographic center point.

15. The method of claim 13, wherein the geographic area identifiers define polygonal vertices of a geographical area.

16. The method of claim 10, wherein the plurality of restricted identifiers comprises postal addresses.

17. The method of claim 10, wherein the plurality of non-restricted identifiers is selected from the group consisting of:

network addresses, Internet Protocol addresses, telephone numbers, and hash codes.

18. The method of claim 10, further comprising:

(i) receiving a maximum bid amount associated with the advertisement campaign;

(j) receiving at least one additional advertisement campaign with at least one associated maximum bid amount and at least one associated targeting criterion; and

(k) where the plurality of restricted identifiers satisfies both the targeting criterion and the at least one associated targeting criterion, associating, in step (h), the advertisement campaign associated with the highest maximum bid amount.

19. The method of claim 10, further comprising communicating a prohibited advertisement campaign from the association module to the intermediate module.

20. The method of claim 10, further comprising omitting at least one specific restricted identifier in the results of the association at step (f), based on a flag associated with the at least one specific restricted identifier.

21. The method of claim 18, wherein the steps of the method are performed in real time.

22. A physical computer-readable medium upon which a plurality of instructions are stored, the instructions for performing the steps of the method as claimed in claim 10.