Name
Title | ||
|---|---|---|
Generating ad targeting rules using sparse principal component analysis with constraints |
Abstract | ||
|---|---|---|
Determining the right audience for an advertising campaign is a well-established problem, of central importance to many Internet companies. Two distinct targeting approaches exist, the model-based approach, which leverages machine learning, and the rule-based approach, which relies on manual generation of targeting rules. Common rules include identifying users that had interactions (website visits, emails received, etc.) with the companies related to the advertiser, or search queries related to their product. We consider a problem of discovering such rules from data using Constrained Sparse PCA. The constraints are put in place to account for cases when evidence in data suggests a relation that is not appropriate for advertising. Experiments on real-world data indicate the potential of the proposed approach. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1145/2567948.2577351 | WWW (Companion Volume) |
Keywords | DocType | Citations |
internet company,well-established problem,advertising campaign,rule-based approach,real-world data,generating ad,constrained sparse pca,common rule,model-based approach,central importance,sparse principal component analysis | Conference | 6 |
PageRank | References | Authors |
0.66 | 3 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mihajlo Grbovic | 1 | 380 | 24.87 |
| Slobodan Vucetic | 2 | 637 | 56.38 |