Privacy-Cleanroom Audience Matching for Precise Ad Targeting
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Digital advertising campaigns often lack effective audience targeting, leading to inefficiencies and wastage of resources due to inaccurate identification of target consumers, which results in less effective campaigns and loss of advertising value.
Innovation Solution
A method and system utilizing a privacy-protected environment, such as a cleanroom, to pre-verify digital advertising targets by matching audience identifiers to an identity graph associated with a targetable universe of consumers, ensuring precise targeting and efficient resource allocation.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of operation
If advertisements are distributed to all consumers without audience targeting, then the advertising campaign can be executed easily, but advertising effectiveness decreases and resources are wasted
Solution Approach 1:
The system performs preliminary audience verification by matching audience identifiers to the identity graph before the advertising campaign begins. This pre-verification process identifies which consumers actually belong to the desired target audience, allowing advertisers to prepare targeted ad delivery lists in advance rather than wasting resources on non-target consumers during the campaign execution.
2Speed
If audience identifiers are stored and processed outside a privacy protection environment, then processing speed is faster, but consumer privacy is compromised
Solution Approach 1:
The system introduces a privacy protection environment as an intermediary layer between the audience identifiers and the processing system. This environment acts as a secure enclave where matching operations occur without exposing sensitive consumer data to external systems. The identity graph serves as a mediator structure that enables matching while maintaining privacy boundaries, allowing the system to achieve both security and functionality.
3Device complexity
If traditional audience matching methods are used without pre-verification, then the system complexity is lower, but audience identification accuracy decreases
Solution Approach 1:
The system performs preliminary audience verification by matching audience identifiers to the identity graph before the advertising campaign begins. This pre-verification process identifies which consumers actually belong to the desired target audience, allowing advertisers to prepare targeted ad delivery lists in advance rather than wasting resources on non-target consumers during the campaign execution.
Solution Approach 2:
The system replaces traditional mechanical matching methods with automated computational matching using an identity graph data structure. This substitution enables more accurate and scalable audience identification by using algorithmic matching of identifiers against the graph structure, which can handle large volumes of data and complex matching criteria that would be impractical with manual or simpler mechanical approaches.
Data Source
Figure 1
Figure 2
Figure 3
AI summary
A method may include obtaining a target audience for an advertising campaign. The target audience may include one or more audience identifiers. The method may also include storing the one or more audience identifiers in a privacy protection environment. The method may further include matching the one or more audience identifiers to an identity graph associated with a targetable universe of consumers to obtain at least one advertising target. The method may also include directing at least one advertisement of the advertising campaign to be provided to the at least one advertising target. The method may further include obtaining impression results associated with the advertising campaign relative to the at least one advertising target.