| Query dependent ranking using K-nearest neighbor |
| Full text |
Pdf
(480 KB)
|
Source
|
Annual ACM Conference on Research and Development in Information Retrieval
archive
Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval
table of contents
Singapore, Singapore
SESSION: Learning to rank--1
table of contents
Pages 115-122
Year of Publication: 2008
ISBN:978-1-60558-164-4
|
|
Authors
|
|
Xiubo Geng
|
Chinese Academy of Sciences, Beijing, China
|
|
Tie-Yan Liu
|
Microsoft Research Asia, Beijing, China
|
|
Tao Qin
|
Tsinghua University, Beijing, China
|
|
Andrew Arnold
|
Carnegie Mellon University, Pittsburgh, PA, USA
|
|
Hang Li
|
Microsoft Research Asia, Beijing, China
|
|
Heung-Yeung Shum
|
Microsoft Corporation, Beijing, China
|
|
| Sponsors |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 48, Downloads (12 Months): 466, Citation Count: 1
|
|
|
ABSTRACT
Many ranking models have been proposed in information retrieval, and recently machine learning techniques have also been applied to ranking model construction. Most of the existing methods do not take into consideration the fact that significant differences exist between queries, and only resort to a single function in ranking of documents. In this paper, we argue that it is necessary to employ different ranking models for different queries and onduct what we call query-dependent ranking. As the first such attempt, we propose a K-Nearest Neighbor (KNN) method for query-dependent ranking. We first consider an online method which creates a ranking model for a given query by using the labeled neighbors of the query in the query feature space and then rank the documents with respect to the query using the created model. Next, we give two offline approximations of the method, which create the ranking models in advance to enhance the efficiency of ranking. And we prove a theory which indicates that the approximations are accurate in terms of difference in loss of prediction, if the learning algorithm used is stable with respect to minor changes in training examples. Our experimental results show that the proposed online and offline methods both outperform the baseline method of using a single ranking function.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
S. Agarwal and P. Niyogi. Stability and generalization of bipartite ranking algorithms. In Proceedings of COLT 2005, pages 32--47, 2005.
|
| |
2
|
|
 |
3
|
|
 |
4
|
Steven M. Beitzel , Eric C. Jensen , Ophir Frieder , David Grossman , David D. Lewis , Abdur Chowdhury , Aleksandr Kolcz, Automatic web query classification using labeled and unlabeled training data, Proceedings of the 28th annual international ACM SIGIR conference on Research and development in information retrieval, August 15-19, 2005, Salvador, Brazil
[doi> 10.1145/1076034.1076138]
|
 |
5
|
Chris Burges , Tal Shaked , Erin Renshaw , Ari Lazier , Matt Deeds , Nicole Hamilton , Greg Hullender, Learning to rank using gradient descent, Proceedings of the 22nd international conference on Machine learning, p.89-96, August 07-11, 2005, Bonn, Germany
[doi> 10.1145/1102351.1102363]
|
 |
6
|
Zhe Cao , Tao Qin , Tie-Yan Liu , Ming-Feng Tsai , Hang Li, Learning to rank: from pairwise approach to listwise approach, Proceedings of the 24th international conference on Machine learning, p.129-136, June 20-24, 2007, Corvalis, Oregon
[doi> 10.1145/1273496.1273513]
|
| |
7
|
|
| |
8
|
D. S. Guru and H. S. Nagendraswamy. Clustering of interval-valued symbolic patterns based on mutual similarity value and the concept of -mutual nearest neighborhood. In ACCV (2), pages 234--243, 2006.
|
 |
9
|
|
| |
10
|
T. Joachims. Making large-scale support vector machine learning practical. In Advances in Kernel Methods: Support Vector Machines.
|
 |
11
|
|
 |
12
|
|
 |
13
|
John Lafferty , Chengxiang Zhai, Document language models, query models, and risk minimization for information retrieval, Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval, p.111-119, September 2001, New Orleans, Louisiana, United States
[doi> 10.1145/383952.383970]
|
 |
14
|
|
| |
15
|
T. Y. Liu, J. Xu, T. Qin, W. Xiong, and H. Li. LETOR: Benchmark dataset for research on learning to rank for information retrieval. In SIGIR '07: Proceedings of the Learning to Rank workshop in the 30th annual international ACM SIGIR conference on Research and development in information retrieval, 2007.
|
 |
16
|
Tie-Yan Liu , Yiming Yang , Hao Wan , Hua-Jun Zeng , Zheng Chen , Wei-Ying Ma, Support vector machines classification with a very large-scale taxonomy, ACM SIGKDD Explorations Newsletter, v.7 n.1, p.36-43, June 2005
[doi> 10.1145/1089815.1089821]
|
 |
17
|
|
 |
18
|
|
| |
19
|
F. P. Preparata and M. I. Shamos. Computational Geometry:Discriminative models An Introduction (Monographs in Computer Science). Springer, August 1985.
|
 |
20
|
|
| |
21
|
S. Robertson. Overview of the okapi projects. In Journal of Documentation, pages 275--281, 1998.
|
 |
22
|
|
| |
23
|
|
 |
24
|
|
 |
25
|
Dou Shen , Jian-Tao Sun , Qiang Yang , Zheng Chen, Building bridges for web query classification, Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval, August 06-11, 2006, Seattle, Washington, USA
[doi> 10.1145/1148170.1148196]
|
| |
26
|
R. Song, J.-R. Wen, S. Shi, G. Xin, T.-Y. Liu, T. Qin, X. Zheng, J. Zhang, G. Xue, and W.-Y. Ma. Microsoft research asia at web track and terabyte track of trec 2004. In Proceedings of the Thirteenth Text REtrieval Conference Proceedings (TREC-2004), 2004.
|
| |
27
|
E. Xing, A. Ng, M. Jordan, and S. Russell. Distance metric learning, with application to clustering with side-information. In Advances in NIPS, number vol. 15, 2003.
|
 |
28
|
|
 |
29
|
|
CITED BY 2
|
|
|
|
|
Heli Sun , Jianbin Huang , Boqin Feng , Tao Li , Yingliang Zhao , Jun Liu, OrdRank: Learning to Rank with Ordered Multiple Hyperplanes, Proceedings of the 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology, p.560-563, September 15-18, 2009
|
|