Ad Retrieval via Boolean Expression Segmentation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional advertising systems are limited in serving a large number of advertisements due to the computational expense of evaluating Boolean targeting expressions against user segments, leading to inefficiencies in selecting relevant ads.
Innovation Solution
An advertising system configured to interact with an advertisement search system, where Boolean targeting expressions are deconstructed into terms, allowing for quick evaluation of user segments against these terms to determine responsive advertisements, thereby bypassing explicit evaluation of complex expressions.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If conventional advertising systems evaluate Boolean targeting expressions against user segments, then advertisement selection accuracy is improved, but computational expense increases and productivity decreases
Solution Approach 1:
The patent segments the complex Boolean targeting expression into multiple independent terms. Each term represents a specific targeting criterion that can be evaluated separately. This segmentation allows the system to process advertisements more efficiently by evaluating individual terms rather than computing the entire Boolean expression for each ad, thus improving productivity while maintaining selection accuracy.
Solution Approach 2:
The patent performs preliminary evaluation of terms against user segments before conducting the full Boolean expression evaluation. By pre-computing term matches and storing them, the system avoids redundant calculations during the advertisement selection process, reducing computational expense and enabling faster processing of larger numbers of advertisements.
2Measurement precision
If conventional advertising systems evaluate Boolean targeting expressions against user segments, then advertisement selection accuracy is improved, but computational expense increases
Solution Approach 1:
The patent segments the complex Boolean targeting expression into multiple independent terms. Each term represents a specific targeting criterion that can be evaluated separately. This segmentation allows the system to process advertisements more efficiently by evaluating individual terms rather than computing the entire Boolean expression for each ad, thus improving productivity while maintaining selection accuracy.
Solution Approach 2:
The patent performs preliminary evaluation of terms against user segments before conducting the full Boolean expression evaluation. By pre-computing term matches and storing them, the system avoids redundant calculations during the advertisement selection process, reducing computational expense and enabling faster processing of larger numbers of advertisements.
Data Source
AI summary
An advertising system can be configured to determine advertisements that are responsive to targeting segments included in advertisement requests without having to individually evaluate Boolean or logical targeting expressions associated with each advertisement. For example, the advertising system can be configured to determine, for advertisements, one or more terms that correspond to at least a portion of the respective targeting expressions of the advertisement. When an advertisement request is received, a determination can be made as to whether any of the segments (e.g., age group) associated with that request correspond to any of the terms that were derived from the advertisements. The advertisement system can then determine any advertisements that match the term(s) that correspond to the request. The advertising system can determine the most relevant advertisement based on various criteria, and an advertisement can be provided in response to the advertisement request, for example, upon conducting an electronic auction.