Back to Search Start Over

Ranking model adaptation for domain specific mining using binary classifier for sponsored ads

Authors :
N. A. Anuja Jaishree
A. Kannan
M. Krishnamurthy
Anitha S. Pillai
Source :
HIS
Publication Year :
2014
Publisher :
IEEE, 2014.

Abstract

Domain — specific search focuses on one area of knowledge. Applying broad based ranking algorithms to vertical search domains is not desirable. The broad based ranking model builds upon the data from multiple domains existing on the web. Vertical search engines attempt to use a focused crawler that index only relevant web pages to a predefined topic. With Ranking Adaptation Model, one can adapt an existing ranking model of a unique new domain. The binary classifiers classify the members of a given set of objects into two groups on the basis of whether they have some property or not. If it is property of relevancy, it is returned to the search query of that particular domain vertical. Sponsored ads are then placed alongside the organic search results and they are ranked with the help of bid, budget and quality score. The ad with the highest bid is placed first in the ad listings. Later, the ad with a maximum quality score is found by click through logs which is replaced in first position. Thus, both organic search and sponsored ads are returned for the specific domain, making it easy for the users to get access to real time ads and connect directly with advertisers as well as to get information on the search query.

Details

Database :
OpenAIRE
Journal :
2014 14th International Conference on Hybrid Intelligent Systems
Accession number :
edsair.doi...........02d5823f469ceea98d0c59f859aa40d7