NDLI: Ranking function adaptation with boosting trees

Content Provider	ACM Digital Library
Author	Chen, Keke Bai, Jing Zheng, Zhaohui
Copyright Year	2011
Abstract	Machine-learned ranking functions have shown successes in Web search engines. With the increasing demands on developing effective ranking functions for different search domains, we have seen a big bottleneck, that is, the problem of insufficient labeled training data, which has significantly slowed the development and deployment of machine-learned ranking functions for different domains. There are two possible approaches to address this problem: (1) combining labeled training data from similar domains with the small target-domain labeled data for training or (2) using pairwise preference data extracted from user clickthrough log for the target domain for training. In this article, we propose a new approach called tree-based ranking function adaptation (Trada) to effectively utilize these data sources for training cross-domain ranking functions. Tree adaptation assumes that ranking functions are trained with the Stochastic Gradient Boosting Trees method—a gradient boosting method on regression trees. It takes such a ranking function from one domain and tunes its tree-based structure with a small amount of training data from the target domain. The unique features include (1) automatic identification of the part of the model that needs adjustment for the new domain and (2) appropriate weighing of training examples considering both local and global distributions. Based on a novel pairwise loss function that we developed for pairwise learning, the basic tree adaptation algorithm is also extended (Pairwise Trada) to utilize the pairwise preference data from the target domain to further improve the effectiveness of adaptation. Experiments are performed on real datasets to show that tree adaptation can provide better-quality ranking functions for a new domain than other methods.
Starting Page	1
Ending Page	31
Page Count	31
File Format	PDF
ISSN	10468188
e-ISSN	15582868
DOI	10.1145/2037661.2037663
Volume Number	29
Issue Number	4
Journal	ACM Transactions on Information Systems (TOIS)
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2011-12-08
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Web search ranking Boosting regression trees Domain adaptation Learning to rank User feedback
Content Type	Text
Resource Type	Article
Subject	Computer Science Applications Information Systems Business, Management and Accounting

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

Fast Ranking with Additive Ensembles of Oblivious and Non-Oblivious Regression Trees

Ranking Function Adaptation with Boosting Trees (2011)

An Online Learning Framework for Refining Recency Search Results with User Click Feedback

On ranking techniques for desktop search

Evaluating implicit measures to improve web search

Interest-based personalized search

Parallel boosted regression trees for web search ranking

Trada: tree based ranking function adaptation

Improving retrieval feedback with multiple term-ranking function combination

Ranking function adaptation with boosting trees

Similar Documents

Fast Ranking with Additive Ensembles of Oblivious and Non-Oblivious Regression Trees

Ranking Function Adaptation with Boosting Trees (2011)

An Online Learning Framework for Refining Recency Search Results with User Click Feedback

On ranking techniques for desktop search

Evaluating implicit measures to improve web search

Interest-based personalized search

Parallel boosted regression trees for web search ranking

Trada: tree based ranking function adaptation

Improving retrieval feedback with multiple term-ranking function combination

Ranking function adaptation with boosting trees