• Corpus ID: 14229363

The Business Next Door : Click-Through Rate Modeling for Local Search

  title={The Business Next Door : Click-Through Rate Modeling for Local Search},
  author={Suhrid Balakrishnan and Sumit Chopra and I. Dan Melamed},
Computational advertising has received a tremendous amount of attention from the business and academic community recently. Great advances have been made in modeling click-through rates in well studied settings, such as, sponsored search and context match. However, local search has received relatively little attention. Geographic nature of local search and associated local browsing leads to interesting research challenges and opportunities. We consider a novel application of relational… 

Figures and Tables from this paper

Click-through prediction when searching local businesses

The evaluation shows how the non-linear combination of features of business, geo-local and textual allow a significant improvement over state-of-the-art alternatives based on text relevance, distance and business reputation.

Click Through Rate Prediction for Local Search Results

An extensive analysis of online users' behavior and the problem of estimating the click-through rate on local search (LCTR) is investigated, showing that the non-linear combination of business information, geo-local and textual relevance features leads to a significant improvements over state of the art alternative approaches based on a combination of relevance, distance and business reputation.

Characterizing and Predicting Users’ Behavior on Local Search Queries

An extensive analysis of online users’ interactions with a local search engine is performed, investigating their intent, temporal patterns, and highlighting relationships between distance-to-business and other factors, such as business reputation, to demonstrate the non-linear combination of business and user information, geo-local and textual relevance features leads to a significant improvements over existing alternative approaches.

A methodology based on Deep Learning for advert value calculation in CPM, CPC and CPA networks

DL is a supervised method that is very efficient in the classification of spam adverts and in the estimation of the CTR, and DLNN have shown, on average, worse performance than cubist and random forest methods, although better performance than model tree, model rules and linear regression methods.



Catching the drift: learning broad matches from clickthrough data

An online learning algorithm, Amnesiac Averaged Perceptron, that is highly efficient yet able to quickly adjust to the rapidly-changing distributions of bidded keywords, advertisements and user behavior is presented.

Web-Scale Bayesian Click-Through rate Prediction for Sponsored Search Advertising in Microsoft's Bing Search Engine

A new Bayesian click-through rate (CTR) prediction algorithm used for Sponsored Search in Microsoft's Bing search engine is described, based on a probit regression model that maps discrete or real-valued input features to probabilities.

Predicting clicks: estimating the click-through rate for new ads

This work shows that it can be used to use features of ads, terms, and advertisers to learn a model that accurately predicts the click-though rate for new ads, and shows that using this model improves the convergence and performance of an advertising system.

Contextual advertising by combining relevance with click feedback

This paper shows how this match between individual ads and the content of the page where the ads are shown can be improved significantly by augmenting the ad-page scoring function with extra parameters from a logistic regression model on the words in the pages and ads.

To swing or not to swing: learning when (not) to advertise

This paper proposes two methods for addressing the decision problem "whether to swing", whether or not to show any of the ads for the incoming request, a simple thresholding approach and a machine learning approach, which collectively analyzes the set of candidate ads augmented with external knowledge.

A semantic approach to contextual advertising

A system for contextual ad matching based on a combination of semantic and syntactic features is proposed, which will help improve the user experience and reduce the number of irrelevant ads.

Discovering the hidden structure of house prices with a non-parametric latent manifold model

The proposed method comprises a parametric model that predicts the "intrinsic" price of the house from its description, and a smooth, non-parametric model of the latent "desirability" manifold that produces useful estimates of the desirability surface at each location.

Scalable Discriminative Learning for Natural Language Parsing and Translation

To the authors' knowledge, this is the first purely discriminative learning algorithm for translation with tree-structured models and does not require a great deal of feature engineering a priori because it performs feature selection over a compound feature space as it learns.

A Tutorial on Energy-Based Learning

The EBM approach provides a common theoretical framework for many learning models, including traditional discr iminative and generative approaches, as well as graph-transformer networks, co nditional random fields, maximum margin Markov networks, and several manifold learning methods.