NDLI: Adaptive weighing designs for keyword value computation

Please wait, while we are loading the content...

Leveraging temporal dynamics of document content in relevance ranking

Tagging human knowledge

Coupled semi-supervised learning for information extraction

Ranking with query-dependent loss for web search

Large scale query log analysis of re-finding

Learning influence probabilities in social networks

A novel click model and its applications to online advertising

Revisiting globally sorted indexes for efficient document retrieval

SBotMiner: large scale search bot detection

Towards recency ranking in web search

Precomputing search features for fast and accurate query classification

Adapting information bottleneck method for automatic construction of domain-oriented sentiment lexicon

IntervalRank: isotonic regression with listwise and pairwise constraints

Anatomy of the long tail: ordinary people with extraordinary tastes

You are who you know: inferring user profiles in online social networks

Early online identification of attention gathering items in social media

Adaptive weighing designs for keyword value computation

Learning URL patterns for webpage de-duplication

Gathering and ranking photos of named entities with high precision, high recall, and diversity

Ranking mechanisms in twitter-like forums

I tag, you tag: translating tags for advanced user models

Data-oriented content query system: searching for data into text on the web

An optimization framework for query recommendation

Inferring search behaviors using partially observable Markov (POM) model

TwitterRank: finding topic-sensitive influential twitterers

Evolution of two-sided markets

Automatic generation of bid phrases for online advertising

On compressing the textual web

Boilerplate detection using shallow text features

Learning concept importance using a weighted dependence model

Pairwise interaction tensor factorization for personalized tag recommendation

Corroborating information from disagreeing views

Improving quality of training data for learning to rank using click-through data

Beyond DCG: user behavior as a predictor of a successful search

Folks in Folksonomies: social link prediction from shared metadata

Personalized click prediction in sponsored search

A sketch-based distance oracle for web-scale graphs

Query reformulation using anchor text

fLDA: matrix factorization through latent dirichlet allocation

A model to estimate intrinsic document relevance from the clickthrough logs of a web search engine

Measuring the reusability of test collections

GeoFolk: latent spatial semantics in web 2.0 social media

Improving ad relevance in sponsored search

Early exit optimizations for additive machine learned ranking systems

Adaptive weighing designs for keyword value computation

Content Provider	ACM Digital Library
Author	Zervas, Georgios Byers, John W. Mitzenmacher, Michael
Abstract	Attributing a dollar value to a keyword is an essential part of running any profitable search engine advertising campaign. When an advertiser has complete control over the interaction with and monetization of each user arriving on a given keyword, the value of that term can be accurately tracked. However, in many instances, the advertiser may monetize arrivals indirectly through one or more third parties. In such cases, it is typical for the third party to provide only coarse-grained reporting: rather than report each monetization event, users are aggregated into larger channels and the third party reports aggregate information such as total daily revenue for each channel. Examples of third parties that use channels include Amazon and Google AdSense. In such scenarios, the number of channels is generally much smaller than the number of keywords whose value per click (VPC) we wish to learn. However, the advertiser has flexibility as to how to assign keywords to channels over time. We introduce the channelization problem: how do we adaptively assign keywords to channels over the course of multiple days to quickly obtain accurate VPC estimates of all keywords? We relate this problem to classical results in weighing design, devise new adaptive algorithms for this problem, and quantify the performance of these algorithms experimentally. Our results demonstrate that adaptive weighing designs that exploit statistics of term frequency, variability in VPCs across keywords, and flexible channel assignments over time provide the best estimators of keyword VPCs.
Starting Page	331
Ending Page	340
Page Count	10
File Format	PDF
ISBN	9781605588896
DOI	10.1145/1718487.1718529
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2010-02-04
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Least squares Regression Design of experiments Weighing designs
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Adaptive Weighing Designs for Keyword Value Computation

Adaptive weighing designs for keyword value computation.

Kernel-Partial Least Squares regression coupled to pseudo-sample trajectories for the analysis of mixture designs of experiments

Designs for weighted least squares regression, with estimated weights

Robust Regression Computation Using Iteratively Reweighted Least Squares

Recursive total least squares algorithms for adaptive filtering

Nonlinear model structure detection using optimum experimental design and orthogonal least squares

Robust prediction and extrapolation designs for nonlinear regression with imprecision

A two-stage variable selection strategy for supersaturated designs with multiple responses

Adaptive weighing designs for keyword value computation

Similar Documents

Adaptive Weighing Designs for Keyword Value Computation

Adaptive weighing designs for keyword value computation.

Kernel-Partial Least Squares regression coupled to pseudo-sample trajectories for the analysis of mixture designs of experiments

Designs for weighted least squares regression, with estimated weights

Robust Regression Computation Using Iteratively Reweighted Least Squares

Recursive total least squares algorithms for adaptive filtering

Nonlinear model structure detection using optimum experimental design and orthogonal least squares

Robust prediction and extrapolation designs for nonlinear regression with imprecision

A two-stage variable selection strategy for supersaturated designs with multiple responses

Adaptive weighing designs for keyword value computation