Ranking model adaptation for domain-specific search

Ranking model adaptation for domain-specific search,10.1145/1645953.1645980,Bo Geng,Linjun Yang,Chao Xu,Xian-sheng Hua

Ranking model adaptation for domain-specific search   (Citations: 3)
BibTex | RIS | RefWorks Download
Recently, various domain-specific search engines emerge, which are restricted to specific topicalities or document formats, and vertical to the broad-based search. Simply applying the ranking model trained for the broad-based search to the verticals cannot achieve a sound performance due to the domain differences, while building different ranking models for each domain is both laborious for labeling sufficient training samples and time-consuming or the training process. In this paper, to address the above difficulties, we investigate two problems: (1) whether we can adapt the ranking model learned for existing Web page search or verticals, to the new domain, so that the amount of labeled data and the training cost is reduced, while the performance requirement is still satisfied; and (2) how to adapt the ranking model from auxiliary domains to a new target domain. We address the second problem from the regularization framework and an algorithm called ranking adaptation SVM is proposed. Our algorithm is flexible enough, which needs only the prediction from the existing ranking model, rather than the internal representation of the model or the data from auxiliary domains. The first problem is addressed by the proposed ranking adaptability measurement, which quantitatively estimates if an existing ranking model can be adapted to the new domain. Extensive experiments are performed over Letor benchmark dataset and two large scale datasets crawled from different domains through a commercial internet search engine, where the ranking model learned for one domain will be adapted to the other. The results demonstrate the applicabilities of the proposed ranking model adaptation algorithm and the ranking adaptability measurement.
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
    • ...It is difficult to directly apply classifier adaptation for ranking [14, 17]...
    • ...Recently, ranking adaptation was received more and more attention [7, 8, 10, 16, 17]...
    • ...[17] treated the model parameters learned from related domain as prior knowledge, and the similarity of parameters between two domains is considered when training on target domain...
    • ...[9, 17] proposed ranking adaptability and domain similarity measures...

    Wei Gaoet al. Learning to rank only using training data from related domain

Sort by: