Learning to rank relational objects and its application to web search

Proceeding of the 17th International Conference on World Wide Web 2008, WWW'08

Volumn , Issue , 2008, Pages 407-416

  Qin, Tao ^a   Wang, De Sheng ^a   Liu, Tie Yan ^b   Xiong, Wen Ying ^c   Zhang, Xu Dong ^a   Li, Hang ^b  

^a TSINGHUA UNIVERSITY   (China)

^b MICROSOFT RESEARCH ASIA   (China)

^c PEKING UNIVERSITY   (China)

Author keywords

Algorithms; Experimentation; Theory

Indexed keywords

CONTROL THEORY; DISTILLATION; EDUCATION; FEEDBACK; INFORMATION RETRIEVAL; INTERNET; MACHINERY; OPTIMIZATION; PAPER; SEARCH ENGINES;

APPROACHES TO LEARNINGS; BASELINE METHODS; CONTENT INFORMATIONS; EXPERIMENTATION; LEARNING PROBLEMS; LEARNING TASKS; LEARNING TO RANKS; OPTIMIZATION PROBLEMS; OPTIMIZATION TASKS; PAPER ADDRESSES; RANKING MODELS; RELATION INFORMATIONS; RELEVANCE FEEDBACKS; RETRIEVED DOCUMENTS; STATISTICAL LEARNINGS; THEORY; TOPIC DISTILLATIONS; WEB SEARCHES;

WORLD WIDE WEB;

EID: 57349173530     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1367497.1367553     Document Type: Conference Paper

References (38)

1. A. Agarwal, S. Chakrabarti, and S. Aggarwal. Learning to rank networked entities. In KDD '06, pages 14-23, New York, NY, USA, 2006. ACM Press.
2. R. Baeza-Yates and B. Ribeiro-Neto. Modern Information Retrieval. Addison Wesley, May 1999.
3. M. Belkin, P. Niyogi, and V. Sindhwani. Manifold regularization: A geometric framework for learning from labeled and unlabeled examples. J. Mach. Learn. Res., 7:2399-2434, 2006.
4. C. Burges, T. Shaked, E. Renshaw, A. Lazier, M. Deeds, N. Hamilton, and G. Hullender. Learning to rank using gradient descent. In ICML '05: Proceedings of the 22nd international conference on Machine learning, pages 89-96, New York, NY, USA, 2005. ACM Press.
5. Y. Cao, J. Xu, T.-Y. Liu, H. Li, Y. Huang, and H.-W. Hon. Adapting ranking svm to document retrieval. In SIGIR '06: Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval, pages 186-193, New York, NY, USA, 2006. ACM Press.
6. Z. Cao, T. Qin, T.-Y. Liu, M.-F. Tsai, and H. Li. Learning to rank: from pairwrise approach to listwise approach. In IGML '07: Proceedings of the 24th international conference on Machine learning, pages 129-136, New York, NY, USA, 2007. ACM Press.
7. W. Dai and R. Srihari. Minimal document set retrieval. In CIKM '05: Proceedings of the 14th ACM international conference on Information and knowledge management, pages 752-759, New York, NY, USA, 2005. ACM Press.
8. H. M. de Almeida, M. A. Gonçalves, M. Cristo, and P. Calado. A combined component approach for finding collection-adapted ranking functions based on genetic programming. In SIGIR '07: Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval, pages 399-406. New York, NY, USA, 2007. ACM.
9. I. S. Dhillon. Co-clustering documents and words using bipartite spectral graph partitioning. In KDD '01, pages 269-274, New York, NY, USA, 2001. ACM Press.
10. F. Diaz. Regularizing query-based retrieval scores. Information Retrieval, 2007.
11. W. Fan, M. D. Gordon, and P. Pathak. A generic ranking function discovery framework by genetic programming for information retrieval. Inf. Process. Manage., 40(4):587-602, 2004.
12. Y. Freund, R.. Iyer, R. E. Schapire, and Y. Singer. An efficient boosting algorithm for combining preferences. J. Mach. Learn. Res., 4:933-969, 2003.
13. X. Geng, T.-Y. Liu, T. Qin, and H. Li. Feature selection for ranking. In SIGIR '07: Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval, pages 407-414, New York, NY, USA, 2007. ACM.
14. G. H. Golub and C. F. V. Loan. Matrix computations (3rd ed.). Johns Hopkins University Press, Baltimore, MD, USA, 1996.
15. R. Herbrich, T. Graepel, and K. Obermayer. Support vector learning for ordinal regression. In ICANN1999, pages 97-102, 1999.
16. W. Hersh, C. Buckley, T. J. Leone, and D. Hickam. Ohsumed: an interactive retrieval evaluation and new large test collection for research. In SIGIR '94, pages 192-201, New York, NY, USA, 1994. Springer-Verlag New York, Inc.
17. K. Jarvelin and J. Kekanainen. IR evaluation methods for retrieving highly relevant documents. In SIGIR2000, pages 41-48, 2000.
18. T. Joachims. Optimizing search engines using clickthrough data. In KDD '02: Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining, pages 133-142, New York, NY, USA, 2002. ACM Press.
19. J. M. Kleinberg. Authoritative sources in a hyperlinked environment. J. ACM, 46(5):604-632, 1999.
20. J. G. Lewis. Algorithm 582: The gibbs-poole-stockmeyer and gibbs-king algorithms for reordering sparse matrices. ACM Trans. Math. Softw., 8(2):190-194, 1982.
21. T.-Y. Liu, J. Xu, T. Qin, W.-Y. Xiong, and H. Li. Letor: Benchmark dataset for research on learning to rank for information retrieval. In Proceedings of SIGIR 2007 Workshop on Learning to Rank for Information Retrieval, 2007.
22. L. Page, S. Brin, R. Motwani, and T. Winograd. The pagerank citation ranking: Bringing order to the web. Technical report, Stanford Digital Library Technologies Project, 1998.
23. T. Qin, T.-Y. Liu, W. Lai, X.-D. Zhang, D.-S. Wang, and H. Li. Ranking with multiple hyperplanes. In SIGIR '07, pages 279-286, New York, NY, USA, 2007. ACM Press.
24. T. Qin, T.-Y. Liu, X.-D. Zhang, Z. Chen, and W.-Y. Ma. A study of relevance propagation for web search. In SIGIR '05, pages 408-415, New York, NY, USA, 2005. ACM Press.
25. T. Qin, T.-Y. Liu, X.-D. Zhang, G. Feng, D.-S. Wang, and W.-Y. Ma. Topic distillation via sub-site retrieval. Information Processing & Management, 43(2) :445-460, 2007.
26. T. Qin, X.-D. Zhang, M.-F. Tsai, D.-S. Wang, T.-Y. Liu, and H. Li. Query-level loss functions for information retrieval. Information Processing & Management, 2007.
27. A. Shakery and C. Zhai. A probabilistic relevance propagation model for hypertext retrieval. In CIKM2006, pages 550-558, New York, NY, USA, 2006. ACM Press.
28. J. Shi and J. Malik. Normalized cuts and image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 22(8):888-905, 2000.
29. T. Tao and C. Zhai. Regularized estimation of mixture models for robust pseudo-relevance feedback. In SIGIR '06, pages 162-169, New York, NY, USA, 2006. ACM.
30. A. Trotman. Learning to rank. Inf. Retr., 8(3):359-381, 2005.
31. M.-F. Tsai, T.-Y. Liu, T. Qin, H.-H. Chen, and W.-Y. Ma. Frank: a ranking method with fidelity loss. In SIGIR '07, pages 383-390, New York, NY, USA, 2007. ACM Press.
32. A. C. Tsoi, G. Morini, F. Scarselli, M. Hagenbuchner, and M. Maggini. Adaptive ranking of web pages. In WWW '03: Proceedings of the 12th international conference on World Wide Web, pages 356-365, New York, NY, USA, 2003. ACM.
33. E. Voorhees and D. Harman. TREC: Experiment and Evaluation in Information Retrieval. MIT Press, 2005.
34. J. Xu and H. Li. Adarank: a boosting algorithm for information retrieval. In SIGIR '07, pages 391-398, New York, NY, USA, 2007. ACM Press.
35. Y. Yue, T. Finley, F. Radlinski, and T. Joachims. A support vector method for optimizing average precision. In SIGIR '07, pages 271-278. New York. NY. USA. 2007. ACM Press.
36. C. X. Zhai, W. W. Cohen, and J. Lafferty. Beyond independent relevance: methods and evaluation metrics for subtopic retrieval. In SIGIR '03: Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval, pages 10-17, New York, NY, USA, 2003. ACM Press.
37. D. Zhou, O. Bousquet, T. Lal, J. Weston, and B. Schölkopf. Learning with local and global consistency, 2003. In 18th Annual Conf. on Neural Information Processing Systems.
38. D. Zhou, J. Huang, and B. Schölkopf. Learning from labeled and unlabeled data on a directed graph. In ICML '05: Proceedings of the 22nd international conference on Machine learning, pages 1036-1043, New York, NY. USA. 2005. ACM.