Query weighting for ranking model adaptation

• Main Authors: CAI, Peng, GAO, Wei, ZHOU, Aoying, WONG, Kam-Fai
• Format: text
• Language: English
• Published: Institutional Knowledge at Singapore Management University 2011
• Subjects: Databases and Information Systems
• Online Access: https://ink.library.smu.edu.sg/sis_research/4595; https://ink.library.smu.edu.sg/context/sis_research/article/5598/viewcontent/P11_1012.pdf
• Institution: Singapore Management University

We propose to directly measure the importance of queries in the source domain to the target domain where no rank labels of documents are available, which is referred to as query weighting. Query weighting is a key step in ranking model adaptation. As the learning object of ranking algorithms is divided by query instances, we argue that it’s more reasonable to conduct importance weighting at query level than document level. We present two query weighting schemes. The first compresses the query into a query feature vector, which aggregates all document instances in the same query, and then conducts query weighting based on the query feature vector. This method can efficiently estimate query importance by compressing query data, but the potential risk is information loss resulted from the compression. The second measures the similarity between the source query and each target query, and then combines these fine-grained similarity values for its importance estimation. Adaptation experiments on LETOR3.0 data set demonstrate that query weighting significantly outperforms document instance weighting methods.